./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-data-race.prp --file ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB --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 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 20:07:22,504 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 20:07:22,587 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-27 20:07:22,594 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 20:07:22,594 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 20:07:22,626 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 20:07:22,627 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 20:07:22,627 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 20:07:22,627 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 20:07:22,628 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 20:07:22,628 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 20:07:22,628 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 20:07:22,628 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 20:07:22,629 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 20:07:22,629 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-27 20:07:22,629 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-27 20:07:22,629 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 20:07:22,629 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-27 20:07:22,630 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 20:07:22,631 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-27 20:07:22,631 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-27 20:07:22,631 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 20:07:22,631 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 20:07:22,631 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 20:07:22,631 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:07:22,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:07:22,632 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:22,632 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 20:07:22,632 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 20:07:22,632 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 20:07:22,633 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:22,633 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 20:07:22,633 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 20:07:22,633 INFO L153 SettingsManager]: * Compute procedure contracts=false [2024-11-27 20:07:22,633 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-27 20:07:22,633 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 20:07:22,634 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB 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 -> 645ee85d2a671dd1acf511bbf13e9e3bda7e0b5cc29e8abc16fb4ed3af500077 [2024-11-27 20:07:22,993 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 20:07:23,011 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 20:07:23,014 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 20:07:23,018 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 20:07:23,019 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 20:07:23,023 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-27 20:07:26,799 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/data/742474275/2da6ea0c990545aab1768832045b157d/FLAG2a1d21a42 [2024-11-27 20:07:27,351 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 20:07:27,355 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/sv-benchmarks/c/pthread-nondet/nondet-loop-bound-variant-1.i [2024-11-27 20:07:27,387 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/data/742474275/2da6ea0c990545aab1768832045b157d/FLAG2a1d21a42 [2024-11-27 20:07:27,413 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/data/742474275/2da6ea0c990545aab1768832045b157d [2024-11-27 20:07:27,417 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 20:07:27,419 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 20:07:27,422 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 20:07:27,424 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 20:07:27,430 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 20:07:27,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:07:27" (1/1) ... [2024-11-27 20:07:27,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d6aa808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:27, skipping insertion in model container [2024-11-27 20:07:27,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 08:07:27" (1/1) ... [2024-11-27 20:07:27,495 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 20:07:28,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:07:28,077 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 20:07:28,129 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 20:07:28,174 INFO L204 MainTranslator]: Completed translation [2024-11-27 20:07:28,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28 WrapperNode [2024-11-27 20:07:28,175 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 20:07:28,176 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 20:07:28,176 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 20:07:28,176 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 20:07:28,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,199 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,232 INFO L138 Inliner]: procedures = 171, calls = 20, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 107 [2024-11-27 20:07:28,233 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 20:07:28,234 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 20:07:28,234 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 20:07:28,234 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 20:07:28,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,243 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,256 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,260 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,262 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 20:07:28,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 20:07:28,267 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 20:07:28,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 20:07:28,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (1/1) ... [2024-11-27 20:07:28,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 20:07:28,303 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 20:07:28,323 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 20:07:28,330 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure thr2 [2024-11-27 20:07:28,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thr2 [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2024-11-27 20:07:28,359 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-27 20:07:28,359 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-27 20:07:28,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 20:07:28,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 20:07:28,361 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-27 20:07:28,532 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 20:07:28,534 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 20:07:28,925 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-27 20:07:28,925 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 20:07:28,956 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 20:07:28,957 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-27 20:07:28,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:07:28 BoogieIcfgContainer [2024-11-27 20:07:28,958 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 20:07:28,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 20:07:28,961 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 20:07:28,967 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 20:07:28,968 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 08:07:27" (1/3) ... [2024-11-27 20:07:28,969 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a728933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:07:28, skipping insertion in model container [2024-11-27 20:07:28,969 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 08:07:28" (2/3) ... [2024-11-27 20:07:28,970 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a728933 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 08:07:28, skipping insertion in model container [2024-11-27 20:07:28,970 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:07:28" (3/3) ... [2024-11-27 20:07:28,971 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-loop-bound-variant-1.i [2024-11-27 20:07:28,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 20:07:28,995 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-loop-bound-variant-1.i that has 3 procedures, 131 locations, 1 initial locations, 1 loop locations, and 10 error locations. [2024-11-27 20:07:28,995 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-27 20:07:29,116 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:07:29,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 138 transitions, 284 flow [2024-11-27 20:07:29,281 INFO L124 PetriNetUnfolderBase]: 8/152 cut-off events. [2024-11-27 20:07:29,286 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:07:29,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 159 conditions, 152 events. 8/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 194 event pairs, 0 based on Foata normal form. 0/131 useless extension candidates. Maximal degree in co-relation 99. Up to 4 conditions per place. [2024-11-27 20:07:29,301 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 138 transitions, 284 flow [2024-11-27 20:07:29,310 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 136 places, 137 transitions, 281 flow [2024-11-27 20:07:29,324 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:07:29,340 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;@1bc35e59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:07:29,341 INFO L334 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2024-11-27 20:07:29,364 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:07:29,364 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-27 20:07:29,364 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:07:29,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:29,365 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:29,366 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:29,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:29,378 INFO L85 PathProgramCache]: Analyzing trace with hash 354889181, now seen corresponding path program 1 times [2024-11-27 20:07:29,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:29,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506040137] [2024-11-27 20:07:29,392 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:29,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:29,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:29,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:29,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:29,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506040137] [2024-11-27 20:07:29,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506040137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:29,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:29,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920385835] [2024-11-27 20:07:29,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:29,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:29,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:29,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:29,825 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:29,902 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 138 [2024-11-27 20:07:29,908 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 137 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:29,908 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:29,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 138 [2024-11-27 20:07:29,910 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:30,161 INFO L124 PetriNetUnfolderBase]: 23/314 cut-off events. [2024-11-27 20:07:30,162 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-27 20:07:30,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 314 events. 23/314 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1244 event pairs, 19 based on Foata normal form. 38/300 useless extension candidates. Maximal degree in co-relation 304. Up to 47 conditions per place. [2024-11-27 20:07:30,172 INFO L140 encePairwiseOnDemand]: 130/138 looper letters, 11 selfloop transitions, 2 changer transitions 1/129 dead transitions. [2024-11-27 20:07:30,173 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 129 transitions, 291 flow [2024-11-27 20:07:30,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:30,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:30,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2024-11-27 20:07:30,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9009661835748792 [2024-11-27 20:07:30,200 INFO L175 Difference]: Start difference. First operand has 136 places, 137 transitions, 281 flow. Second operand 3 states and 373 transitions. [2024-11-27 20:07:30,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 129 transitions, 291 flow [2024-11-27 20:07:30,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 129 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:30,220 INFO L231 Difference]: Finished difference. Result has 134 places, 128 transitions, 266 flow [2024-11-27 20:07:30,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=134, PETRI_TRANSITIONS=128} [2024-11-27 20:07:30,231 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-27 20:07:30,231 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 128 transitions, 266 flow [2024-11-27 20:07:30,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:30,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:30,232 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:30,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 20:07:30,233 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:30,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:30,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1455007423, now seen corresponding path program 1 times [2024-11-27 20:07:30,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:30,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530445623] [2024-11-27 20:07:30,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:30,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:30,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:30,395 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:30,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:30,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530445623] [2024-11-27 20:07:30,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530445623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:30,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:30,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:30,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502992685] [2024-11-27 20:07:30,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:30,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:30,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:30,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:30,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:30,498 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 138 [2024-11-27 20:07:30,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 128 transitions, 266 flow. Second operand has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:30,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:30,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 138 [2024-11-27 20:07:30,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:30,628 INFO L124 PetriNetUnfolderBase]: 28/394 cut-off events. [2024-11-27 20:07:30,628 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 20:07:30,634 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 394 events. 28/394 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1719 event pairs, 26 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 436. Up to 62 conditions per place. [2024-11-27 20:07:30,636 INFO L140 encePairwiseOnDemand]: 135/138 looper letters, 13 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2024-11-27 20:07:30,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 127 transitions, 294 flow [2024-11-27 20:07:30,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:30,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:30,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 364 transitions. [2024-11-27 20:07:30,643 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8792270531400966 [2024-11-27 20:07:30,644 INFO L175 Difference]: Start difference. First operand has 134 places, 128 transitions, 266 flow. Second operand 3 states and 364 transitions. [2024-11-27 20:07:30,644 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 127 transitions, 294 flow [2024-11-27 20:07:30,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 127 transitions, 290 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:30,649 INFO L231 Difference]: Finished difference. Result has 132 places, 127 transitions, 264 flow [2024-11-27 20:07:30,650 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=264, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2024-11-27 20:07:30,651 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -4 predicate places. [2024-11-27 20:07:30,651 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 264 flow [2024-11-27 20:07:30,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 117.33333333333333) internal successors, (352), 3 states have internal predecessors, (352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:30,652 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:30,652 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 20:07:30,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:30,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:30,656 INFO L85 PathProgramCache]: Analyzing trace with hash -2140821955, now seen corresponding path program 1 times [2024-11-27 20:07:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003703653] [2024-11-27 20:07:30,656 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:30,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:30,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:30,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:30,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:30,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003703653] [2024-11-27 20:07:30,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003703653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:30,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:30,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:30,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2007455144] [2024-11-27 20:07:30,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:30,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:30,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:30,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:30,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:30,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 138 [2024-11-27 20:07:30,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:30,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:30,880 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 138 [2024-11-27 20:07:30,880 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:31,085 INFO L124 PetriNetUnfolderBase]: 68/518 cut-off events. [2024-11-27 20:07:31,085 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-27 20:07:31,088 INFO L83 FinitePrefix]: Finished finitePrefix Result has 649 conditions, 518 events. 68/518 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2771 event pairs, 58 based on Foata normal form. 0/464 useless extension candidates. Maximal degree in co-relation 609. Up to 116 conditions per place. [2024-11-27 20:07:31,091 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 14 selfloop transitions, 1 changer transitions 0/122 dead transitions. [2024-11-27 20:07:31,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 122 transitions, 284 flow [2024-11-27 20:07:31,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:31,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:31,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 356 transitions. [2024-11-27 20:07:31,094 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8599033816425121 [2024-11-27 20:07:31,094 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 264 flow. Second operand 3 states and 356 transitions. [2024-11-27 20:07:31,094 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 122 transitions, 284 flow [2024-11-27 20:07:31,096 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 122 transitions, 280 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:31,098 INFO L231 Difference]: Finished difference. Result has 127 places, 122 transitions, 252 flow [2024-11-27 20:07:31,099 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=252, PETRI_PLACES=127, PETRI_TRANSITIONS=122} [2024-11-27 20:07:31,100 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -9 predicate places. [2024-11-27 20:07:31,100 INFO L471 AbstractCegarLoop]: Abstraction has has 127 places, 122 transitions, 252 flow [2024-11-27 20:07:31,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:31,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:31,101 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:31,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 20:07:31,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:31,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:31,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1955982752, now seen corresponding path program 1 times [2024-11-27 20:07:31,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:31,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443657741] [2024-11-27 20:07:31,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:31,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:31,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:31,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443657741] [2024-11-27 20:07:31,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443657741] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:31,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:31,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:31,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045751446] [2024-11-27 20:07:31,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:31,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:31,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:31,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:31,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:31,283 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 138 [2024-11-27 20:07:31,284 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 122 transitions, 252 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:31,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:31,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 138 [2024-11-27 20:07:31,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:31,374 INFO L124 PetriNetUnfolderBase]: 17/278 cut-off events. [2024-11-27 20:07:31,374 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-27 20:07:31,375 INFO L83 FinitePrefix]: Finished finitePrefix Result has 336 conditions, 278 events. 17/278 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 885 event pairs, 6 based on Foata normal form. 0/255 useless extension candidates. Maximal degree in co-relation 296. Up to 32 conditions per place. [2024-11-27 20:07:31,377 INFO L140 encePairwiseOnDemand]: 132/138 looper letters, 13 selfloop transitions, 4 changer transitions 0/127 dead transitions. [2024-11-27 20:07:31,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 127 transitions, 299 flow [2024-11-27 20:07:31,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:31,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:31,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 379 transitions. [2024-11-27 20:07:31,380 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9154589371980676 [2024-11-27 20:07:31,380 INFO L175 Difference]: Start difference. First operand has 127 places, 122 transitions, 252 flow. Second operand 3 states and 379 transitions. [2024-11-27 20:07:31,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 127 transitions, 299 flow [2024-11-27 20:07:31,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 127 places, 127 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:31,385 INFO L231 Difference]: Finished difference. Result has 129 places, 124 transitions, 279 flow [2024-11-27 20:07:31,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=249, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=129, PETRI_TRANSITIONS=124} [2024-11-27 20:07:31,387 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -7 predicate places. [2024-11-27 20:07:31,387 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 124 transitions, 279 flow [2024-11-27 20:07:31,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:31,388 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:31,388 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:31,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 20:07:31,388 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:31,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:31,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1217702170, now seen corresponding path program 1 times [2024-11-27 20:07:31,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:31,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835990110] [2024-11-27 20:07:31,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:31,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:31,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:31,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:31,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835990110] [2024-11-27 20:07:31,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [835990110] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:31,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:31,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:07:31,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135395592] [2024-11-27 20:07:31,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:31,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:07:31,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:31,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:07:31,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:07:31,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 138 [2024-11-27 20:07:31,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 124 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:31,702 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:31,702 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 138 [2024-11-27 20:07:31,702 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:31,861 INFO L124 PetriNetUnfolderBase]: 12/280 cut-off events. [2024-11-27 20:07:31,861 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2024-11-27 20:07:31,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 280 events. 12/280 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 910 event pairs, 8 based on Foata normal form. 1/258 useless extension candidates. Maximal degree in co-relation 325. Up to 34 conditions per place. [2024-11-27 20:07:31,865 INFO L140 encePairwiseOnDemand]: 134/138 looper letters, 16 selfloop transitions, 0 changer transitions 4/127 dead transitions. [2024-11-27 20:07:31,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 127 transitions, 325 flow [2024-11-27 20:07:31,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:07:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:07:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 591 transitions. [2024-11-27 20:07:31,931 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8565217391304348 [2024-11-27 20:07:31,932 INFO L175 Difference]: Start difference. First operand has 129 places, 124 transitions, 279 flow. Second operand 5 states and 591 transitions. [2024-11-27 20:07:31,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 127 transitions, 325 flow [2024-11-27 20:07:31,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 127 transitions, 317 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:31,938 INFO L231 Difference]: Finished difference. Result has 134 places, 123 transitions, 275 flow [2024-11-27 20:07:31,939 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=138, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=275, PETRI_PLACES=134, PETRI_TRANSITIONS=123} [2024-11-27 20:07:31,941 INFO L279 CegarLoopForPetriNet]: 136 programPoint places, -2 predicate places. [2024-11-27 20:07:31,943 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 123 transitions, 275 flow [2024-11-27 20:07:31,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 116.4) internal successors, (582), 5 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:31,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:31,945 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:31,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 20:07:31,945 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-11-27 20:07:31,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:31,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1120237794, now seen corresponding path program 1 times [2024-11-27 20:07:31,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:31,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500991181] [2024-11-27 20:07:31,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:31,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:32,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:32,018 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:07:32,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:32,156 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:07:32,156 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:07:32,159 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 17 remaining) [2024-11-27 20:07:32,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (15 of 17 remaining) [2024-11-27 20:07:32,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (14 of 17 remaining) [2024-11-27 20:07:32,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (13 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (12 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (11 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 17 remaining) [2024-11-27 20:07:32,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 17 remaining) [2024-11-27 20:07:32,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (6 of 17 remaining) [2024-11-27 20:07:32,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 17 remaining) [2024-11-27 20:07:32,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (4 of 17 remaining) [2024-11-27 20:07:32,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (3 of 17 remaining) [2024-11-27 20:07:32,174 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (2 of 17 remaining) [2024-11-27 20:07:32,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 17 remaining) [2024-11-27 20:07:32,175 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 17 remaining) [2024-11-27 20:07:32,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 20:07:32,176 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-27 20:07:32,183 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 20:07:32,184 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2024-11-27 20:07:32,291 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:07:32,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 193 places, 194 transitions, 408 flow [2024-11-27 20:07:32,387 INFO L124 PetriNetUnfolderBase]: 11/206 cut-off events. [2024-11-27 20:07:32,387 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-27 20:07:32,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 206 events. 11/206 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 361 event pairs, 0 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 213. Up to 6 conditions per place. [2024-11-27 20:07:32,389 INFO L82 GeneralOperation]: Start removeDead. Operand has 193 places, 194 transitions, 408 flow [2024-11-27 20:07:32,393 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 170 places, 171 transitions, 355 flow [2024-11-27 20:07:32,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:07:32,396 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1bc35e59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:07:32,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2024-11-27 20:07:32,402 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:07:32,402 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-27 20:07:32,402 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:07:32,402 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:32,403 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:32,403 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:32,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1448834145, now seen corresponding path program 1 times [2024-11-27 20:07:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:32,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181948152] [2024-11-27 20:07:32,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:32,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:32,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:32,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:32,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:32,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181948152] [2024-11-27 20:07:32,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181948152] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:32,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:32,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:32,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679730833] [2024-11-27 20:07:32,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:32,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:32,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:32,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:32,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:32,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 194 [2024-11-27 20:07:32,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 171 transitions, 355 flow. Second operand has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:32,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:32,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 194 [2024-11-27 20:07:32,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:32,946 INFO L124 PetriNetUnfolderBase]: 216/1072 cut-off events. [2024-11-27 20:07:32,946 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-27 20:07:32,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1431 conditions, 1072 events. 216/1072 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7386 event pairs, 189 based on Foata normal form. 226/1128 useless extension candidates. Maximal degree in co-relation 1362. Up to 317 conditions per place. [2024-11-27 20:07:32,966 INFO L140 encePairwiseOnDemand]: 185/194 looper letters, 16 selfloop transitions, 2 changer transitions 1/162 dead transitions. [2024-11-27 20:07:32,967 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 162 transitions, 373 flow [2024-11-27 20:07:32,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:32,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:32,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 514 transitions. [2024-11-27 20:07:32,971 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8831615120274914 [2024-11-27 20:07:32,971 INFO L175 Difference]: Start difference. First operand has 170 places, 171 transitions, 355 flow. Second operand 3 states and 514 transitions. [2024-11-27 20:07:32,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 162 transitions, 373 flow [2024-11-27 20:07:32,978 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 162 transitions, 372 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:32,982 INFO L231 Difference]: Finished difference. Result has 168 places, 161 transitions, 338 flow [2024-11-27 20:07:32,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=160, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=338, PETRI_PLACES=168, PETRI_TRANSITIONS=161} [2024-11-27 20:07:32,984 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -2 predicate places. [2024-11-27 20:07:32,985 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 161 transitions, 338 flow [2024-11-27 20:07:32,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 164.33333333333334) internal successors, (493), 3 states have internal predecessors, (493), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:32,987 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:32,987 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:32,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 20:07:32,987 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:32,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:32,988 INFO L85 PathProgramCache]: Analyzing trace with hash -376749119, now seen corresponding path program 1 times [2024-11-27 20:07:32,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:32,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951277148] [2024-11-27 20:07:32,989 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:32,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:33,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:33,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:33,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951277148] [2024-11-27 20:07:33,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951277148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:33,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:33,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703832578] [2024-11-27 20:07:33,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:33,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:33,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:33,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:33,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-27 20:07:33,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 161 transitions, 338 flow. Second operand has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:33,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:33,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-27 20:07:33,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:33,658 INFO L124 PetriNetUnfolderBase]: 200/1574 cut-off events. [2024-11-27 20:07:33,658 INFO L125 PetriNetUnfolderBase]: For 42/42 co-relation queries the response was YES. [2024-11-27 20:07:33,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1938 conditions, 1574 events. 200/1574 cut-off events. For 42/42 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 12207 event pairs, 194 based on Foata normal form. 0/1326 useless extension candidates. Maximal degree in co-relation 1904. Up to 326 conditions per place. [2024-11-27 20:07:33,682 INFO L140 encePairwiseOnDemand]: 191/194 looper letters, 17 selfloop transitions, 2 changer transitions 0/160 dead transitions. [2024-11-27 20:07:33,682 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 160 transitions, 374 flow [2024-11-27 20:07:33,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:33,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:33,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 506 transitions. [2024-11-27 20:07:33,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8694158075601375 [2024-11-27 20:07:33,688 INFO L175 Difference]: Start difference. First operand has 168 places, 161 transitions, 338 flow. Second operand 3 states and 506 transitions. [2024-11-27 20:07:33,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 160 transitions, 374 flow [2024-11-27 20:07:33,691 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 160 transitions, 370 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:33,694 INFO L231 Difference]: Finished difference. Result has 166 places, 160 transitions, 336 flow [2024-11-27 20:07:33,695 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=336, PETRI_PLACES=166, PETRI_TRANSITIONS=160} [2024-11-27 20:07:33,700 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -4 predicate places. [2024-11-27 20:07:33,700 INFO L471 AbstractCegarLoop]: Abstraction has has 166 places, 160 transitions, 336 flow [2024-11-27 20:07:33,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 163.33333333333334) internal successors, (490), 3 states have internal predecessors, (490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:33,701 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:33,701 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:33,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 20:07:33,702 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:33,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash -409464129, now seen corresponding path program 1 times [2024-11-27 20:07:33,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:33,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671922092] [2024-11-27 20:07:33,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:33,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:33,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:33,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:33,783 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:33,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671922092] [2024-11-27 20:07:33,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671922092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:33,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:33,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:33,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688969534] [2024-11-27 20:07:33,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:33,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:33,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:33,786 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:33,786 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:33,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 194 [2024-11-27 20:07:33,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 160 transitions, 336 flow. Second operand has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:33,845 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:33,845 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 194 [2024-11-27 20:07:33,845 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:34,430 INFO L124 PetriNetUnfolderBase]: 590/2525 cut-off events. [2024-11-27 20:07:34,430 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-27 20:07:34,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3377 conditions, 2525 events. 590/2525 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 21305 event pairs, 508 based on Foata normal form. 0/2204 useless extension candidates. Maximal degree in co-relation 3336. Up to 791 conditions per place. [2024-11-27 20:07:34,461 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 19 selfloop transitions, 1 changer transitions 0/154 dead transitions. [2024-11-27 20:07:34,461 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 154 transitions, 364 flow [2024-11-27 20:07:34,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:34,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:34,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2024-11-27 20:07:34,464 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2024-11-27 20:07:34,465 INFO L175 Difference]: Start difference. First operand has 166 places, 160 transitions, 336 flow. Second operand 3 states and 488 transitions. [2024-11-27 20:07:34,465 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 154 transitions, 364 flow [2024-11-27 20:07:34,466 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 154 transitions, 360 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:34,470 INFO L231 Difference]: Finished difference. Result has 160 places, 154 transitions, 322 flow [2024-11-27 20:07:34,471 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=322, PETRI_PLACES=160, PETRI_TRANSITIONS=154} [2024-11-27 20:07:34,471 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -10 predicate places. [2024-11-27 20:07:34,474 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 154 transitions, 322 flow [2024-11-27 20:07:34,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 155.0) internal successors, (465), 3 states have internal predecessors, (465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:34,475 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:34,475 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:34,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 20:07:34,475 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:34,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:34,476 INFO L85 PathProgramCache]: Analyzing trace with hash 346003596, now seen corresponding path program 1 times [2024-11-27 20:07:34,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:34,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969824128] [2024-11-27 20:07:34,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:34,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:34,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:34,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:34,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969824128] [2024-11-27 20:07:34,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969824128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:34,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:34,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:34,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208243517] [2024-11-27 20:07:34,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:34,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:34,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:34,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:34,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:34,602 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 161 out of 194 [2024-11-27 20:07:34,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 160 places, 154 transitions, 322 flow. Second operand has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:34,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:34,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 161 of 194 [2024-11-27 20:07:34,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:34,937 INFO L124 PetriNetUnfolderBase]: 347/1375 cut-off events. [2024-11-27 20:07:34,938 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-27 20:07:34,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2057 conditions, 1375 events. 347/1375 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 9650 event pairs, 117 based on Foata normal form. 0/1210 useless extension candidates. Maximal degree in co-relation 2016. Up to 382 conditions per place. [2024-11-27 20:07:34,959 INFO L140 encePairwiseOnDemand]: 183/194 looper letters, 25 selfloop transitions, 8 changer transitions 0/168 dead transitions. [2024-11-27 20:07:34,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 168 transitions, 424 flow [2024-11-27 20:07:34,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:34,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:34,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 519 transitions. [2024-11-27 20:07:34,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8917525773195877 [2024-11-27 20:07:34,962 INFO L175 Difference]: Start difference. First operand has 160 places, 154 transitions, 322 flow. Second operand 3 states and 519 transitions. [2024-11-27 20:07:34,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 168 transitions, 424 flow [2024-11-27 20:07:34,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 168 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:34,969 INFO L231 Difference]: Finished difference. Result has 163 places, 162 transitions, 391 flow [2024-11-27 20:07:34,970 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=321, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=154, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=146, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=391, PETRI_PLACES=163, PETRI_TRANSITIONS=162} [2024-11-27 20:07:34,971 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -7 predicate places. [2024-11-27 20:07:34,972 INFO L471 AbstractCegarLoop]: Abstraction has has 163 places, 162 transitions, 391 flow [2024-11-27 20:07:34,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 162.33333333333334) internal successors, (487), 3 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:34,973 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:34,973 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:34,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 20:07:34,974 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:34,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:34,975 INFO L85 PathProgramCache]: Analyzing trace with hash -706906415, now seen corresponding path program 1 times [2024-11-27 20:07:34,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:34,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072484829] [2024-11-27 20:07:34,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:34,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:35,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:35,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072484829] [2024-11-27 20:07:35,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072484829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:35,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:35,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:35,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718548290] [2024-11-27 20:07:35,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:35,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:35,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:35,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:35,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:35,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 165 out of 194 [2024-11-27 20:07:35,193 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 391 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:35,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:35,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 165 of 194 [2024-11-27 20:07:35,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:35,641 INFO L124 PetriNetUnfolderBase]: 447/1925 cut-off events. [2024-11-27 20:07:35,641 INFO L125 PetriNetUnfolderBase]: For 614/634 co-relation queries the response was YES. [2024-11-27 20:07:35,652 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3363 conditions, 1925 events. 447/1925 cut-off events. For 614/634 co-relation queries the response was YES. Maximal size of possible extension queue 112. Compared 15412 event pairs, 158 based on Foata normal form. 2/1715 useless extension candidates. Maximal degree in co-relation 3321. Up to 585 conditions per place. [2024-11-27 20:07:35,669 INFO L140 encePairwiseOnDemand]: 187/194 looper letters, 23 selfloop transitions, 10 changer transitions 0/173 dead transitions. [2024-11-27 20:07:35,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 173 transitions, 502 flow [2024-11-27 20:07:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:35,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:35,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 521 transitions. [2024-11-27 20:07:35,675 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8951890034364262 [2024-11-27 20:07:35,675 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 391 flow. Second operand 3 states and 521 transitions. [2024-11-27 20:07:35,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 173 transitions, 502 flow [2024-11-27 20:07:35,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 173 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:35,686 INFO L231 Difference]: Finished difference. Result has 165 places, 170 transitions, 461 flow [2024-11-27 20:07:35,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=375, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=162, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=165, PETRI_TRANSITIONS=170} [2024-11-27 20:07:35,687 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, -5 predicate places. [2024-11-27 20:07:35,687 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 170 transitions, 461 flow [2024-11-27 20:07:35,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:35,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:35,690 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:35,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 20:07:35,691 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:35,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:35,692 INFO L85 PathProgramCache]: Analyzing trace with hash 580989303, now seen corresponding path program 1 times [2024-11-27 20:07:35,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:35,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480987178] [2024-11-27 20:07:35,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:35,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:35,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:35,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:35,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:35,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480987178] [2024-11-27 20:07:35,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480987178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:35,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:35,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:07:35,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071557499] [2024-11-27 20:07:35,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:35,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:07:35,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:35,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:07:35,868 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:07:35,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 162 out of 194 [2024-11-27 20:07:35,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 170 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:35,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:35,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 162 of 194 [2024-11-27 20:07:35,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:36,600 INFO L124 PetriNetUnfolderBase]: 538/2944 cut-off events. [2024-11-27 20:07:36,600 INFO L125 PetriNetUnfolderBase]: For 549/789 co-relation queries the response was YES. [2024-11-27 20:07:36,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4723 conditions, 2944 events. 538/2944 cut-off events. For 549/789 co-relation queries the response was YES. Maximal size of possible extension queue 151. Compared 27524 event pairs, 212 based on Foata normal form. 1/2583 useless extension candidates. Maximal degree in co-relation 4680. Up to 439 conditions per place. [2024-11-27 20:07:36,636 INFO L140 encePairwiseOnDemand]: 190/194 looper letters, 19 selfloop transitions, 0 changer transitions 4/173 dead transitions. [2024-11-27 20:07:36,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 173 transitions, 513 flow [2024-11-27 20:07:36,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:07:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:07:36,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 834 transitions. [2024-11-27 20:07:36,644 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8597938144329897 [2024-11-27 20:07:36,644 INFO L175 Difference]: Start difference. First operand has 165 places, 170 transitions, 461 flow. Second operand 5 states and 834 transitions. [2024-11-27 20:07:36,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 173 transitions, 513 flow [2024-11-27 20:07:36,655 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 173 transitions, 493 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:36,658 INFO L231 Difference]: Finished difference. Result has 170 places, 169 transitions, 445 flow [2024-11-27 20:07:36,658 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=194, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=170, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=445, PETRI_PLACES=170, PETRI_TRANSITIONS=169} [2024-11-27 20:07:36,659 INFO L279 CegarLoopForPetriNet]: 170 programPoint places, 0 predicate places. [2024-11-27 20:07:36,659 INFO L471 AbstractCegarLoop]: Abstraction has has 170 places, 169 transitions, 445 flow [2024-11-27 20:07:36,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.6) internal successors, (823), 5 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:36,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:36,662 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 20:07:36,663 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2024-11-27 20:07:36,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:36,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2074259023, now seen corresponding path program 1 times [2024-11-27 20:07:36,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:36,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193734219] [2024-11-27 20:07:36,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:36,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:36,705 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:07:36,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:36,768 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:07:36,768 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:07:36,768 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (21 of 22 remaining) [2024-11-27 20:07:36,768 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2024-11-27 20:07:36,769 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (13 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (12 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2024-11-27 20:07:36,770 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2024-11-27 20:07:36,771 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2024-11-27 20:07:36,772 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2024-11-27 20:07:36,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 20:07:36,772 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:36,773 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2024-11-27 20:07:36,773 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2024-11-27 20:07:36,868 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-27 20:07:36,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 249 places, 250 transitions, 536 flow [2024-11-27 20:07:36,924 INFO L124 PetriNetUnfolderBase]: 14/260 cut-off events. [2024-11-27 20:07:36,924 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2024-11-27 20:07:36,927 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 260 events. 14/260 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 543 event pairs, 0 based on Foata normal form. 0/223 useless extension candidates. Maximal degree in co-relation 271. Up to 8 conditions per place. [2024-11-27 20:07:36,927 INFO L82 GeneralOperation]: Start removeDead. Operand has 249 places, 250 transitions, 536 flow [2024-11-27 20:07:36,930 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 204 places, 205 transitions, 431 flow [2024-11-27 20:07:36,932 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 20:07:36,932 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;@1bc35e59, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 20:07:36,933 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-27 20:07:36,936 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-27 20:07:36,936 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-27 20:07:36,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-27 20:07:36,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:36,937 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:36,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:36,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:36,937 INFO L85 PathProgramCache]: Analyzing trace with hash 1672975769, now seen corresponding path program 1 times [2024-11-27 20:07:36,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:36,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629602477] [2024-11-27 20:07:36,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:36,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:36,983 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:36,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:36,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629602477] [2024-11-27 20:07:36,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629602477] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:36,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:36,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:36,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514837541] [2024-11-27 20:07:36,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:36,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:36,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:36,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:36,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:37,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-27 20:07:37,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 205 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:37,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:37,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-27 20:07:37,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:38,269 INFO L124 PetriNetUnfolderBase]: 1589/4910 cut-off events. [2024-11-27 20:07:38,270 INFO L125 PetriNetUnfolderBase]: For 336/336 co-relation queries the response was YES. [2024-11-27 20:07:38,312 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7220 conditions, 4910 events. 1589/4910 cut-off events. For 336/336 co-relation queries the response was YES. Maximal size of possible extension queue 212. Compared 44503 event pairs, 1439 based on Foata normal form. 1274/5496 useless extension candidates. Maximal degree in co-relation 7150. Up to 2067 conditions per place. [2024-11-27 20:07:38,361 INFO L140 encePairwiseOnDemand]: 240/250 looper letters, 21 selfloop transitions, 2 changer transitions 1/195 dead transitions. [2024-11-27 20:07:38,361 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 195 transitions, 457 flow [2024-11-27 20:07:38,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:38,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:38,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 655 transitions. [2024-11-27 20:07:38,364 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8733333333333333 [2024-11-27 20:07:38,364 INFO L175 Difference]: Start difference. First operand has 204 places, 205 transitions, 431 flow. Second operand 3 states and 655 transitions. [2024-11-27 20:07:38,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 195 transitions, 457 flow [2024-11-27 20:07:38,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 202 places, 195 transitions, 454 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:38,371 INFO L231 Difference]: Finished difference. Result has 202 places, 194 transitions, 410 flow [2024-11-27 20:07:38,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=410, PETRI_PLACES=202, PETRI_TRANSITIONS=194} [2024-11-27 20:07:38,373 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -2 predicate places. [2024-11-27 20:07:38,373 INFO L471 AbstractCegarLoop]: Abstraction has has 202 places, 194 transitions, 410 flow [2024-11-27 20:07:38,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:38,375 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:38,375 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:38,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 20:07:38,376 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:38,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:38,377 INFO L85 PathProgramCache]: Analyzing trace with hash 52254715, now seen corresponding path program 1 times [2024-11-27 20:07:38,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:38,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006075077] [2024-11-27 20:07:38,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:38,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:38,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:38,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:38,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:38,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006075077] [2024-11-27 20:07:38,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006075077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:38,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:38,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:38,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328709774] [2024-11-27 20:07:38,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:38,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:38,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:38,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:38,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:38,521 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 250 [2024-11-27 20:07:38,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 194 transitions, 410 flow. Second operand has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:38,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:38,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 250 [2024-11-27 20:07:38,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:39,607 INFO L124 PetriNetUnfolderBase]: 1197/5332 cut-off events. [2024-11-27 20:07:39,607 INFO L125 PetriNetUnfolderBase]: For 506/506 co-relation queries the response was YES. [2024-11-27 20:07:39,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7137 conditions, 5332 events. 1197/5332 cut-off events. For 506/506 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 52774 event pairs, 1154 based on Foata normal form. 0/4734 useless extension candidates. Maximal degree in co-relation 7102. Up to 1670 conditions per place. [2024-11-27 20:07:39,695 INFO L140 encePairwiseOnDemand]: 247/250 looper letters, 21 selfloop transitions, 2 changer transitions 0/193 dead transitions. [2024-11-27 20:07:39,695 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 193 transitions, 454 flow [2024-11-27 20:07:39,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:39,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:39,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 648 transitions. [2024-11-27 20:07:39,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.864 [2024-11-27 20:07:39,702 INFO L175 Difference]: Start difference. First operand has 202 places, 194 transitions, 410 flow. Second operand 3 states and 648 transitions. [2024-11-27 20:07:39,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 193 transitions, 454 flow [2024-11-27 20:07:39,710 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 193 transitions, 450 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:39,713 INFO L231 Difference]: Finished difference. Result has 200 places, 193 transitions, 408 flow [2024-11-27 20:07:39,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=404, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=408, PETRI_PLACES=200, PETRI_TRANSITIONS=193} [2024-11-27 20:07:39,714 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -4 predicate places. [2024-11-27 20:07:39,714 INFO L471 AbstractCegarLoop]: Abstraction has has 200 places, 193 transitions, 408 flow [2024-11-27 20:07:39,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.33333333333334) internal successors, (628), 3 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:39,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:39,715 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:39,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 20:07:39,716 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:39,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:39,719 INFO L85 PathProgramCache]: Analyzing trace with hash 94824569, now seen corresponding path program 1 times [2024-11-27 20:07:39,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:39,719 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863465371] [2024-11-27 20:07:39,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:39,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:39,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:39,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:39,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863465371] [2024-11-27 20:07:39,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863465371] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:39,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:39,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:39,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485369458] [2024-11-27 20:07:39,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:39,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:39,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:39,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:39,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:39,861 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 196 out of 250 [2024-11-27 20:07:39,862 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 193 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:39,863 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:39,863 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 196 of 250 [2024-11-27 20:07:39,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:42,244 INFO L124 PetriNetUnfolderBase]: 4181/12619 cut-off events. [2024-11-27 20:07:42,244 INFO L125 PetriNetUnfolderBase]: For 517/517 co-relation queries the response was YES. [2024-11-27 20:07:42,319 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17972 conditions, 12619 events. 4181/12619 cut-off events. For 517/517 co-relation queries the response was YES. Maximal size of possible extension queue 434. Compared 133763 event pairs, 3658 based on Foata normal form. 0/10992 useless extension candidates. Maximal degree in co-relation 17930. Up to 5066 conditions per place. [2024-11-27 20:07:42,425 INFO L140 encePairwiseOnDemand]: 242/250 looper letters, 24 selfloop transitions, 1 changer transitions 0/186 dead transitions. [2024-11-27 20:07:42,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 186 transitions, 444 flow [2024-11-27 20:07:42,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:42,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:42,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 620 transitions. [2024-11-27 20:07:42,428 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8266666666666667 [2024-11-27 20:07:42,428 INFO L175 Difference]: Start difference. First operand has 200 places, 193 transitions, 408 flow. Second operand 3 states and 620 transitions. [2024-11-27 20:07:42,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 186 transitions, 444 flow [2024-11-27 20:07:42,432 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 186 transitions, 440 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:42,435 INFO L231 Difference]: Finished difference. Result has 193 places, 186 transitions, 392 flow [2024-11-27 20:07:42,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=392, PETRI_PLACES=193, PETRI_TRANSITIONS=186} [2024-11-27 20:07:42,437 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -11 predicate places. [2024-11-27 20:07:42,437 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 186 transitions, 392 flow [2024-11-27 20:07:42,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 197.0) internal successors, (591), 3 states have internal predecessors, (591), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:42,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:42,438 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:42,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 20:07:42,438 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:42,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:42,439 INFO L85 PathProgramCache]: Analyzing trace with hash -400832987, now seen corresponding path program 1 times [2024-11-27 20:07:42,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:42,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056586827] [2024-11-27 20:07:42,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:42,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:42,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:42,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:42,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056586827] [2024-11-27 20:07:42,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056586827] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:42,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:42,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:42,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097614564] [2024-11-27 20:07:42,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:42,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:42,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:42,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:42,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:42,588 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 250 [2024-11-27 20:07:42,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 186 transitions, 392 flow. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:42,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:42,590 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 250 [2024-11-27 20:07:42,590 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:45,118 INFO L124 PetriNetUnfolderBase]: 4747/12923 cut-off events. [2024-11-27 20:07:45,118 INFO L125 PetriNetUnfolderBase]: For 840/840 co-relation queries the response was YES. [2024-11-27 20:07:45,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20480 conditions, 12923 events. 4747/12923 cut-off events. For 840/840 co-relation queries the response was YES. Maximal size of possible extension queue 577. Compared 135031 event pairs, 1658 based on Foata normal form. 0/11283 useless extension candidates. Maximal degree in co-relation 20438. Up to 4100 conditions per place. [2024-11-27 20:07:45,301 INFO L140 encePairwiseOnDemand]: 235/250 looper letters, 35 selfloop transitions, 11 changer transitions 0/206 dead transitions. [2024-11-27 20:07:45,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 206 transitions, 537 flow [2024-11-27 20:07:45,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:45,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:45,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2024-11-27 20:07:45,305 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8746666666666667 [2024-11-27 20:07:45,305 INFO L175 Difference]: Start difference. First operand has 193 places, 186 transitions, 392 flow. Second operand 3 states and 656 transitions. [2024-11-27 20:07:45,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 206 transitions, 537 flow [2024-11-27 20:07:45,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 206 transitions, 536 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-27 20:07:45,312 INFO L231 Difference]: Finished difference. Result has 196 places, 197 transitions, 487 flow [2024-11-27 20:07:45,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=391, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=186, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=175, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=196, PETRI_TRANSITIONS=197} [2024-11-27 20:07:45,313 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -8 predicate places. [2024-11-27 20:07:45,314 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 197 transitions, 487 flow [2024-11-27 20:07:45,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:45,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:45,315 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:45,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-27 20:07:45,315 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thr2Err2ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:45,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:45,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1737218883, now seen corresponding path program 1 times [2024-11-27 20:07:45,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:45,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22157475] [2024-11-27 20:07:45,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:45,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:45,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:45,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22157475] [2024-11-27 20:07:45,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22157475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:45,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:45,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 20:07:45,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037950713] [2024-11-27 20:07:45,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:45,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 20:07:45,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:45,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 20:07:45,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 20:07:45,484 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-27 20:07:45,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 197 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:45,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:45,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-27 20:07:45,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:47,502 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][122], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 200#$Ultimate##0true, 250#true]) [2024-11-27 20:07:47,504 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is cut-off event [2024-11-27 20:07:47,504 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-27 20:07:47,504 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:47,505 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-11-27 20:07:47,537 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 250#true]) [2024-11-27 20:07:47,538 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-27 20:07:47,538 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:47,538 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:47,538 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:47,773 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][213], [201#L703-4true, 248#true, 240#true, 2#L714-3true, 102#L700-3true, Black: 261#true, 210#L694-1true, 56#L705-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 250#true]) [2024-11-27 20:07:47,774 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-27 20:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:47,774 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:48,401 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 250#true, 22#L705-2true]) [2024-11-27 20:07:48,401 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 20:07:48,401 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:48,401 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:48,401 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 20:07:48,625 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][203], [201#L703-4true, 248#true, 240#true, 2#L714-3true, Black: 261#true, 56#L705-2true, 117#L694-2true, 246#true, 263#(= |#race~x~0| 0), 260#(= |#race~n~0| 0), 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 250#true, 22#L705-2true]) [2024-11-27 20:07:48,626 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-27 20:07:48,626 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-27 20:07:48,626 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-27 20:07:48,626 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-27 20:07:48,726 INFO L124 PetriNetUnfolderBase]: 6575/18065 cut-off events. [2024-11-27 20:07:48,726 INFO L125 PetriNetUnfolderBase]: For 7564/8117 co-relation queries the response was YES. [2024-11-27 20:07:48,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35123 conditions, 18065 events. 6575/18065 cut-off events. For 7564/8117 co-relation queries the response was YES. Maximal size of possible extension queue 801. Compared 203299 event pairs, 2466 based on Foata normal form. 44/15760 useless extension candidates. Maximal degree in co-relation 35080. Up to 7191 conditions per place. [2024-11-27 20:07:48,980 INFO L140 encePairwiseOnDemand]: 241/250 looper letters, 33 selfloop transitions, 14 changer transitions 0/215 dead transitions. [2024-11-27 20:07:48,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 215 transitions, 657 flow [2024-11-27 20:07:48,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 20:07:48,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-27 20:07:48,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2024-11-27 20:07:48,984 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.888 [2024-11-27 20:07:48,984 INFO L175 Difference]: Start difference. First operand has 196 places, 197 transitions, 487 flow. Second operand 3 states and 666 transitions. [2024-11-27 20:07:48,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 215 transitions, 657 flow [2024-11-27 20:07:49,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 215 transitions, 625 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:49,013 INFO L231 Difference]: Finished difference. Result has 198 places, 209 transitions, 591 flow [2024-11-27 20:07:49,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=198, PETRI_TRANSITIONS=209} [2024-11-27 20:07:49,014 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -6 predicate places. [2024-11-27 20:07:49,014 INFO L471 AbstractCegarLoop]: Abstraction has has 198 places, 209 transitions, 591 flow [2024-11-27 20:07:49,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:49,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:49,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:49,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-27 20:07:49,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:49,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:49,016 INFO L85 PathProgramCache]: Analyzing trace with hash 908509346, now seen corresponding path program 1 times [2024-11-27 20:07:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736416506] [2024-11-27 20:07:49,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:49,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 20:07:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 20:07:49,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 20:07:49,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736416506] [2024-11-27 20:07:49,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736416506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 20:07:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 20:07:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 20:07:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053663928] [2024-11-27 20:07:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 20:07:49,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 20:07:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 20:07:49,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 20:07:49,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 20:07:49,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 250 [2024-11-27 20:07:49,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 209 transitions, 591 flow. Second operand has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:49,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-27 20:07:49,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 250 [2024-11-27 20:07:49,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-27 20:07:49,741 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 22#L705-2true, 249#true]) [2024-11-27 20:07:49,741 INFO L294 olderBase$Statistics]: this new event has 118 ancestors and is cut-off event [2024-11-27 20:07:49,741 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-27 20:07:49,742 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2024-11-27 20:07:49,742 INFO L297 olderBase$Statistics]: existing Event has 118 ancestors and is cut-off event [2024-11-27 20:07:50,405 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 28#$Ultimate##0true]) [2024-11-27 20:07:50,405 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,406 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,406 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,406 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:07:50,451 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2024-11-27 20:07:50,451 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,451 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:07:50,451 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,451 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,457 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 249#true, 22#L705-2true]) [2024-11-27 20:07:50,457 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,457 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,457 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,457 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-11-27 20:07:50,676 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2024-11-27 20:07:50,676 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-27 20:07:50,676 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,676 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 20:07:50,676 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,684 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 249#true, 22#L705-2true]) [2024-11-27 20:07:50,684 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-11-27 20:07:50,684 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-11-27 20:07:50,684 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,684 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-11-27 20:07:50,963 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 102#L700-3true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true]) [2024-11-27 20:07:50,963 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-27 20:07:50,963 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:50,963 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:50,963 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,307 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:51,307 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,307 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:51,307 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,307 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,311 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 28#$Ultimate##0true]) [2024-11-27 20:07:51,311 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,311 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,311 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,311 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:51,314 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2024-11-27 20:07:51,314 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,314 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-11-27 20:07:51,314 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,314 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,439 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 102#L700-3true, 192#L705-2true, Black: 261#true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2024-11-27 20:07:51,439 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-27 20:07:51,439 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:51,439 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:07:51,439 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is cut-off event [2024-11-27 20:07:51,497 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 102#L700-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2024-11-27 20:07:51,498 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-27 20:07:51,498 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 20:07:51,498 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is cut-off event [2024-11-27 20:07:51,498 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:51,695 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([808] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][199], [201#L703-4true, 248#true, 240#true, 2#L714-3true, Black: 261#true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 55#L701-1true]) [2024-11-27 20:07:51,695 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 20:07:51,695 INFO L297 olderBase$Statistics]: existing Event has 150 ancestors and is cut-off event [2024-11-27 20:07:51,695 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:51,695 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:51,764 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 197#$Ultimate##0true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:51,764 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-27 20:07:51,764 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,764 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-27 20:07:51,764 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,774 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 200#$Ultimate##0true, 250#true, 22#L705-2true]) [2024-11-27 20:07:51,775 INFO L294 olderBase$Statistics]: this new event has 147 ancestors and is cut-off event [2024-11-27 20:07:51,775 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:51,775 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-27 20:07:51,775 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-11-27 20:07:52,059 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2024-11-27 20:07:52,059 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-11-27 20:07:52,059 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:07:52,059 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:07:52,059 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-27 20:07:52,128 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true]) [2024-11-27 20:07:52,128 INFO L294 olderBase$Statistics]: this new event has 150 ancestors and is cut-off event [2024-11-27 20:07:52,128 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:52,128 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:52,128 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-27 20:07:52,408 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 162#L703-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 250#true]) [2024-11-27 20:07:52,408 INFO L294 olderBase$Statistics]: this new event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,408 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-27 20:07:52,408 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,408 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,487 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-27 20:07:52,487 INFO L294 olderBase$Statistics]: this new event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,487 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,487 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,487 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,583 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 211#L700-3true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,583 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,583 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,583 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 20:07:52,583 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,584 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 192#L705-2true, 102#L700-3true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2024-11-27 20:07:52,584 INFO L294 olderBase$Statistics]: this new event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,584 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,584 INFO L297 olderBase$Statistics]: existing Event has 149 ancestors and is cut-off event [2024-11-27 20:07:52,584 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:52,668 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,668 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,668 INFO L297 olderBase$Statistics]: existing Event has 147 ancestors and is cut-off event [2024-11-27 20:07:52,668 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,668 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,724 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,724 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-27 20:07:52,724 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,724 INFO L297 olderBase$Statistics]: existing Event has 148 ancestors and is cut-off event [2024-11-27 20:07:52,724 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,787 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 55#L701-1true]) [2024-11-27 20:07:52,788 INFO L294 olderBase$Statistics]: this new event has 156 ancestors and is cut-off event [2024-11-27 20:07:52,788 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-27 20:07:52,788 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:52,788 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:52,918 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,919 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,919 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,919 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,919 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,928 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [42#L701-2true, 248#true, 240#true, 192#L705-2true, Black: 261#true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2024-11-27 20:07:52,928 INFO L294 olderBase$Statistics]: this new event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,928 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:52,928 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,928 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:52,985 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 56#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,985 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-27 20:07:52,985 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 20:07:52,985 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,985 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:52,989 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, Black: 261#true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:52,989 INFO L294 olderBase$Statistics]: this new event has 158 ancestors and is cut-off event [2024-11-27 20:07:52,989 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-27 20:07:52,989 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-27 20:07:52,989 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 20:07:53,042 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][208], [201#L703-4true, 248#true, 240#true, Black: 261#true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,042 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,042 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,042 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,042 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,078 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 210#L694-1true, 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,078 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-11-27 20:07:53,078 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:53,078 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:53,078 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:53,122 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 211#L700-3true, 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,122 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is cut-off event [2024-11-27 20:07:53,122 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 20:07:53,122 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:53,122 INFO L297 olderBase$Statistics]: existing Event has 154 ancestors and is cut-off event [2024-11-27 20:07:53,152 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 117#L694-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 211#L700-3true, 271#true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,152 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,152 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,152 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,152 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,182 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue, 55#L701-1true]) [2024-11-27 20:07:53,182 INFO L294 olderBase$Statistics]: this new event has 159 ancestors and is not cut-off event [2024-11-27 20:07:53,182 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-11-27 20:07:53,182 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-11-27 20:07:53,182 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is not cut-off event [2024-11-27 20:07:53,202 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,202 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,202 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:53,203 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-27 20:07:53,203 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,205 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, 210#L694-1true, Black: 261#true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,205 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,205 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,205 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,205 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,206 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([841] L701-->L701-1: Formula: (= |v_#race~x~0_1| 0) InVars {} OutVars{#race~x~0=|v_#race~x~0_1|} AuxVars[] AssignedVars[#race~x~0][177], [248#true, 240#true, Black: 261#true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 136#L702-4true, 260#(= |#race~n~0| 0), 271#true, 101#L701-1true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,206 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-27 20:07:53,206 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-27 20:07:53,206 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 20:07:53,206 INFO L297 olderBase$Statistics]: existing Event has 163 ancestors and is cut-off event [2024-11-27 20:07:53,206 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 20:07:53,239 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([851] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread3of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread3of3ForFork0_#t~ret6#1=|v_thr2Thread3of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread3of3ForFork0_#t~ret6#1][185], [248#true, 240#true, 2#L714-3true, Black: 263#(= |#race~x~0| 0), 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,239 INFO L294 olderBase$Statistics]: this new event has 163 ancestors and is cut-off event [2024-11-27 20:07:53,239 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:53,239 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-27 20:07:53,239 INFO L297 olderBase$Statistics]: existing Event has 158 ancestors and is cut-off event [2024-11-27 20:07:53,250 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 210#L694-1true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true]) [2024-11-27 20:07:53,250 INFO L294 olderBase$Statistics]: this new event has 161 ancestors and is cut-off event [2024-11-27 20:07:53,251 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:53,251 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-27 20:07:53,251 INFO L297 olderBase$Statistics]: existing Event has 156 ancestors and is cut-off event [2024-11-27 20:07:53,500 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, Black: 263#(= |#race~x~0| 0), 102#L700-3true, 192#L705-2true, 56#L705-2true, 266#true, 117#L694-2true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 39#L-1-4true, 250#true]) [2024-11-27 20:07:53,501 INFO L294 olderBase$Statistics]: this new event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,501 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,501 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,501 INFO L297 olderBase$Statistics]: existing Event has 157 ancestors and is cut-off event [2024-11-27 20:07:53,524 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 200#$Ultimate##0true, 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,524 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-27 20:07:53,524 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-27 20:07:53,524 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 20:07:53,524 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 20:07:53,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 210#L694-1true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,573 INFO L294 olderBase$Statistics]: this new event has 166 ancestors and is cut-off event [2024-11-27 20:07:53,573 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-27 20:07:53,573 INFO L297 olderBase$Statistics]: existing Event has 161 ancestors and is cut-off event [2024-11-27 20:07:53,573 INFO L297 olderBase$Statistics]: existing Event has 166 ancestors and is cut-off event [2024-11-27 20:07:53,581 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([785] L702-4-->L705-2: Formula: (and (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0))) (= |v_thr2Thread1of3ForFork0_#t~ret6#1_1| 0)) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread1of3ForFork0_#t~ret6#1=|v_thr2Thread1of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread1of3ForFork0_#t~ret6#1][125], [248#true, 240#true, 162#L703-3true, Black: 261#true, 192#L705-2true, 56#L705-2true, 266#true, 246#true, Black: 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 260#(= |#race~n~0| 0), 271#true, 200#$Ultimate##0true, 39#L-1-4true, 250#true]) [2024-11-27 20:07:53,581 INFO L294 olderBase$Statistics]: this new event has 164 ancestors and is cut-off event [2024-11-27 20:07:53,581 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-27 20:07:53,581 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-27 20:07:53,581 INFO L297 olderBase$Statistics]: existing Event has 164 ancestors and is cut-off event [2024-11-27 20:07:53,592 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 117#L694-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true]) [2024-11-27 20:07:53,592 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-27 20:07:53,592 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,592 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,592 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-27 20:07:53,600 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([818] L702-4-->L705-2: Formula: (and (= |v_thr2Thread2of3ForFork0_#t~ret6#1_1| 0) (= |v_#pthreadsMutex_17| (store |v_#pthreadsMutex_18| |v_~#mut~0.base_15| (store (select |v_#pthreadsMutex_18| |v_~#mut~0.base_15|) |v_~#mut~0.offset_15| 0)))) InVars {~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_18|, ~#mut~0.base=|v_~#mut~0.base_15|} OutVars{~#mut~0.offset=|v_~#mut~0.offset_15|, #pthreadsMutex=|v_#pthreadsMutex_17|, ~#mut~0.base=|v_~#mut~0.base_15|, thr2Thread2of3ForFork0_#t~ret6#1=|v_thr2Thread2of3ForFork0_#t~ret6#1_1|} AuxVars[] AssignedVars[#pthreadsMutex, thr2Thread2of3ForFork0_#t~ret6#1][162], [248#true, 240#true, Black: 261#true, 56#L705-2true, 246#true, Black: 266#true, 260#(= |#race~n~0| 0), 225#L703-3true, 271#true, 268#(= |thr2Thread1of3ForFork0_#t~nondet5#1| |#race~x~0|), 39#L-1-4true, 250#true, 22#L705-2true, 19#thr1Err0ASSERT_VIOLATIONDATA_RACEtrue]) [2024-11-27 20:07:53,600 INFO L294 olderBase$Statistics]: this new event has 167 ancestors and is cut-off event [2024-11-27 20:07:53,600 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,600 INFO L297 olderBase$Statistics]: existing Event has 162 ancestors and is cut-off event [2024-11-27 20:07:53,600 INFO L297 olderBase$Statistics]: existing Event has 167 ancestors and is cut-off event [2024-11-27 20:07:53,672 INFO L124 PetriNetUnfolderBase]: 7495/26481 cut-off events. [2024-11-27 20:07:53,672 INFO L125 PetriNetUnfolderBase]: For 6293/10999 co-relation queries the response was YES. [2024-11-27 20:07:53,816 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45842 conditions, 26481 events. 7495/26481 cut-off events. For 6293/10999 co-relation queries the response was YES. Maximal size of possible extension queue 1098. Compared 345817 event pairs, 2967 based on Foata normal form. 10/22479 useless extension candidates. Maximal degree in co-relation 45798. Up to 4933 conditions per place. [2024-11-27 20:07:53,930 INFO L140 encePairwiseOnDemand]: 246/250 looper letters, 22 selfloop transitions, 0 changer transitions 4/212 dead transitions. [2024-11-27 20:07:53,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 212 transitions, 649 flow [2024-11-27 20:07:53,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 20:07:53,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-27 20:07:53,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1077 transitions. [2024-11-27 20:07:53,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8616 [2024-11-27 20:07:53,934 INFO L175 Difference]: Start difference. First operand has 198 places, 209 transitions, 591 flow. Second operand 5 states and 1077 transitions. [2024-11-27 20:07:53,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 212 transitions, 649 flow [2024-11-27 20:07:54,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 212 transitions, 621 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-27 20:07:54,003 INFO L231 Difference]: Finished difference. Result has 203 places, 208 transitions, 567 flow [2024-11-27 20:07:54,003 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=250, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=209, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=567, PETRI_PLACES=203, PETRI_TRANSITIONS=208} [2024-11-27 20:07:54,004 INFO L279 CegarLoopForPetriNet]: 204 programPoint places, -1 predicate places. [2024-11-27 20:07:54,004 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 208 transitions, 567 flow [2024-11-27 20:07:54,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 212.6) internal successors, (1063), 5 states have internal predecessors, (1063), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 20:07:54,005 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-27 20:07:54,006 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:54,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-27 20:07:54,006 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err0ASSERT_VIOLATIONDATA_RACE === [thr2Err0ASSERT_VIOLATIONDATA_RACE, thr2Err1ASSERT_VIOLATIONDATA_RACE, thr2Err2ASSERT_VIOLATIONDATA_RACE, thr1Err0ASSERT_VIOLATIONDATA_RACE (and 23 more)] === [2024-11-27 20:07:54,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 20:07:54,007 INFO L85 PathProgramCache]: Analyzing trace with hash -784884826, now seen corresponding path program 1 times [2024-11-27 20:07:54,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 20:07:54,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849443953] [2024-11-27 20:07:54,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 20:07:54,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 20:07:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:54,032 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-27 20:07:54,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-27 20:07:54,060 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-27 20:07:54,060 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-27 20:07:54,060 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err0ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2024-11-27 20:07:54,060 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2024-11-27 20:07:54,061 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2024-11-27 20:07:54,062 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err0ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err1ASSERT_VIOLATIONDATA_RACE (6 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr2Err2ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2024-11-27 20:07:54,063 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2024-11-27 20:07:54,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-27 20:07:54,063 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-27 20:07:54,236 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 3 thread instances [2024-11-27 20:07:54,237 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-27 20:07:54,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.11 08:07:54 BasicIcfg [2024-11-27 20:07:54,251 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-27 20:07:54,253 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-27 20:07:54,253 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-27 20:07:54,253 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-27 20:07:54,254 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 08:07:28" (3/4) ... [2024-11-27 20:07:54,256 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-27 20:07:54,369 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 9. [2024-11-27 20:07:54,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-27 20:07:54,421 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-27 20:07:54,422 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-27 20:07:54,424 INFO L158 Benchmark]: Toolchain (without parser) took 27004.08ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 104.5MB in the beginning and 7.0GB in the end (delta: -6.9GB). Peak memory consumption was 930.6MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,424 INFO L158 Benchmark]: CDTParser took 0.58ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:07:54,425 INFO L158 Benchmark]: CACSL2BoogieTranslator took 753.39ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,426 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.97ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,426 INFO L158 Benchmark]: Boogie Preprocessor took 32.79ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-27 20:07:54,426 INFO L158 Benchmark]: RCFGBuilder took 690.54ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 65.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,426 INFO L158 Benchmark]: TraceAbstraction took 25290.76ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 64.6MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 855.1MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,427 INFO L158 Benchmark]: Witness Printer took 168.88ms. Allocated memory is still 8.0GB. Free memory was 7.1GB in the beginning and 7.0GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-27 20:07:54,429 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.58ms. Allocated memory is still 167.8MB. Free memory is still 104.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 753.39ms. Allocated memory is still 142.6MB. Free memory was 104.2MB in the beginning and 84.3MB in the end (delta: 19.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.97ms. Allocated memory is still 142.6MB. Free memory was 84.3MB in the beginning and 82.3MB in the end (delta: 2.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.79ms. Allocated memory is still 142.6MB. Free memory was 82.3MB in the beginning and 81.3MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 690.54ms. Allocated memory is still 142.6MB. Free memory was 81.3MB in the beginning and 65.2MB in the end (delta: 16.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 25290.76ms. Allocated memory was 142.6MB in the beginning and 8.0GB in the end (delta: 7.9GB). Free memory was 64.6MB in the beginning and 7.1GB in the end (delta: -7.0GB). Peak memory consumption was 855.1MB. Max. memory is 16.1GB. * Witness Printer took 168.88ms. Allocated memory is still 8.0GB. Free memory was 7.1GB in the beginning and 7.0GB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 694]: Data race detected Data race detected The following path leads to a data race: [L690] 0 volatile int x; VAL [x=0] [L691] 0 volatile int n; VAL [n=0, x=0] [L692] 0 pthread_mutex_t mut = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [mut={3:0}, n=0, x=0] [L708] 0 pthread_t t1, t2; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L709] 0 x = 0 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=0, x=0] [L710] 0 n = __VERIFIER_nondet_uint() VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n >= (10/2) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] EXPR 0 n >= (10/2) && n <= 10 VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, x=0] [L711] CALL 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L687] COND FALSE 0 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=10, x=0] [L711] RET 0 assume_abort_if_not(n >= (10/2) && n <= 10) [L712] FCALL, FORK 0 pthread_create(&t1, 0, thr1, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, mut={3:0}, n=10, t1=-1, x=0] [L713] 0 int i = 0; VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, t1=-1, x=0] [L713] 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, t1=-1, x=0] [L713] COND TRUE 0 i < n VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, t1=-1, x=0] [L714] FCALL, FORK 0 pthread_create(&t2, 0, thr2, 0) VAL [\old(argc)=52, \old(argv)={50:53}, argc=52, i=0, mut={3:0}, n=10, t1=-1, t2=0, x=0] [L697] 2 int t; VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L698] 2 int k = __VERIFIER_nondet_uint(); VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, x=0] [L699] CALL 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L687] COND FALSE 2 !(!cond) VAL [\old(cond)=1, cond=1, mut={3:0}, n=10, x=0] [L699] RET 2 assume_abort_if_not(k >= (10/2) && k <= 10) [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, x=0] [L701] 2 t = x VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L702] COND TRUE 2 k == n VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=0] [L703] 2 x = t + 1 VAL [\old(arg)={0:0}, arg={0:0}, k=10, mut={3:0}, n=10, t=0, x=1] [L694] 1 x < n VAL [\old(arg)={0:0}, arg={0:0}, mut={3:0}, n=10, x=1] Now there is a data race on ~x~0 between C: x = t + 1 [703] and C: x < n [694] - UnprovableResult [Line: 701]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 702]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 711]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 714]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 185 locations, 17 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.0s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 146 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 33 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 181 IncrementalHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 45 mSDtfsCounter, 181 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=281occurred in iteration=0, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 285 NumberOfCodeBlocks, 285 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 207 ConstructedInterpolants, 0 QuantifiedInterpolants, 222 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 237 locations, 22 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.5s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 250 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 92 mSDsluCounter, 76 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 34 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 303 IncrementalHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 34 mSolverCounterUnsat, 36 mSDtfsCounter, 303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=461occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 390 NumberOfCodeBlocks, 390 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 316 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 9 procedures, 289 locations, 27 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 17.2s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 16.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 370 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 138 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 40 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 392 IncrementalHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 22 mSDtfsCounter, 392 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=591occurred in iteration=5, InterpolantAutomatonStates: 20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 392 NumberOfCodeBlocks, 392 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 300 ConstructedInterpolants, 0 QuantifiedInterpolants, 317 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-27 20:07:54,458 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a6066cd7-b006-49c2-bd91-c277fd1ea03f/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)