./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f90c032cad43da2fb4e0b7a9fd7f3200ca1c4adf3f239f2d78774392ccecc031 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:07:48,796 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:07:48,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:07:48,837 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:07:48,838 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:07:48,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:07:48,858 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:07:48,858 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:07:48,858 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:07:48,858 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:07:48,859 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:07:48,859 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:07:48,859 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:07:48,859 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:07:48,860 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:07:48,861 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,861 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:07:48,862 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:07:48,863 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:07:48,863 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f90c032cad43da2fb4e0b7a9fd7f3200ca1c4adf3f239f2d78774392ccecc031 [2025-04-29 11:07:49,076 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:07:49,085 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:07:49,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:07:49,087 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:07:49,087 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:07:49,090 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.c [2025-04-29 11:07:50,422 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488926626/ded969972a294c10a1aab59ad144b1a3/FLAGccb3dfc61 [2025-04-29 11:07:50,611 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:07:50,611 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_24-malloc_races.c [2025-04-29 11:07:50,621 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,625 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,626 WARN L117 ultiparseSymbolTable]: System include stdio.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:07:50,632 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488926626/ded969972a294c10a1aab59ad144b1a3/FLAGccb3dfc61 [2025-04-29 11:07:51,473 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/488926626/ded969972a294c10a1aab59ad144b1a3 [2025-04-29 11:07:51,475 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:07:51,476 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:07:51,477 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:07:51,482 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:07:51,482 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,483 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@771eb537 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51, skipping insertion in model container [2025-04-29 11:07:51,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,494 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:07:51,643 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,652 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:07:51,680 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,697 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:07:51,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51 WrapperNode [2025-04-29 11:07:51,699 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,700 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,700 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:07:51,700 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:07:51,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,712 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,728 INFO L138 Inliner]: procedures = 12, calls = 15, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 60 [2025-04-29 11:07:51,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:07:51,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:07:51,735 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,740 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,740 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,745 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,751 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,754 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,758 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:07:51,758 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:07:51,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:07:51,759 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (1/1) ... [2025-04-29 11:07:51,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:51,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:07:51,784 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:07:51,786 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:07:51,801 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:07:51,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:07:51,802 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:07:51,802 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:07:51,803 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:07:51,864 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:07:51,865 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:07:52,026 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:07:52,026 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:07:52,055 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:07:52,058 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:07:52,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52 BoogieIcfgContainer [2025-04-29 11:07:52,059 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:07:52,061 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:07:52,061 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:07:52,064 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:07:52,065 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:07:51" (1/3) ... [2025-04-29 11:07:52,065 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7832a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:07:52, skipping insertion in model container [2025-04-29 11:07:52,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:07:51" (2/3) ... [2025-04-29 11:07:52,066 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f7832a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:07:52, skipping insertion in model container [2025-04-29 11:07:52,066 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52" (3/3) ... [2025-04-29 11:07:52,067 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_24-malloc_races.c [2025-04-29 11:07:52,079 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:07:52,081 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_24-malloc_races.c that has 2 procedures, 99 locations, 97 edges, 1 initial locations, 0 loop locations, and 10 error locations. [2025-04-29 11:07:52,082 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:07:52,145 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:07:52,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 102 places, 98 transitions, 200 flow [2025-04-29 11:07:52,207 INFO L116 PetriNetUnfolderBase]: 0/97 cut-off events. [2025-04-29 11:07:52,209 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,211 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 97 events. 0/97 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 81 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:07:52,211 INFO L82 GeneralOperation]: Start removeDead. Operand has 102 places, 98 transitions, 200 flow [2025-04-29 11:07:52,215 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 101 places, 97 transitions, 197 flow [2025-04-29 11:07:52,220 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:07:52,232 INFO L340 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;@79291fa7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:07:52,232 INFO L341 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-04-29 11:07:52,236 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:07:52,236 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-29 11:07:52,236 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,237 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,237 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:07:52,237 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,241 INFO L85 PathProgramCache]: Analyzing trace with hash 93244338, now seen corresponding path program 1 times [2025-04-29 11:07:52,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,246 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954251253] [2025-04-29 11:07:52,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,298 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:07:52,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:07:52,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:52,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,370 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954251253] [2025-04-29 11:07:52,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954251253] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75018080] [2025-04-29 11:07:52,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,377 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,393 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,425 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2025-04-29 11:07:52,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 97 transitions, 197 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2025-04-29 11:07:52,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2025-04-29 11:07:52,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,483 INFO L116 PetriNetUnfolderBase]: 12/228 cut-off events. [2025-04-29 11:07:52,483 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:07:52,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 270 conditions, 228 events. 12/228 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 667 event pairs, 12 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 230. Up to 36 conditions per place. [2025-04-29 11:07:52,488 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 11 selfloop transitions, 2 changer transitions 0/96 dead transitions. [2025-04-29 11:07:52,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 96 transitions, 221 flow [2025-04-29 11:07:52,489 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-04-29 11:07:52,498 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-04-29 11:07:52,499 INFO L175 Difference]: Start difference. First operand has 101 places, 97 transitions, 197 flow. Second operand 3 states and 266 transitions. [2025-04-29 11:07:52,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 96 transitions, 221 flow [2025-04-29 11:07:52,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 96 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:52,508 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 198 flow [2025-04-29 11:07:52,510 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-04-29 11:07:52,513 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 0 predicate places. [2025-04-29 11:07:52,515 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 198 flow [2025-04-29 11:07:52,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2025-04-29 11:07:52,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,516 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] [2025-04-29 11:07:52,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:07:52,516 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,517 INFO L85 PathProgramCache]: Analyzing trace with hash 181430534, now seen corresponding path program 1 times [2025-04-29 11:07:52,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1380291908] [2025-04-29 11:07:52,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,529 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-04-29 11:07:52,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-04-29 11:07:52,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:52,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,578 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1380291908] [2025-04-29 11:07:52,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1380291908] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859326319] [2025-04-29 11:07:52,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,579 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,594 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 98 [2025-04-29 11:07:52,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 198 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2025-04-29 11:07:52,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 98 [2025-04-29 11:07:52,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,652 INFO L116 PetriNetUnfolderBase]: 12/227 cut-off events. [2025-04-29 11:07:52,652 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 271 conditions, 227 events. 12/227 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 692 event pairs, 12 based on Foata normal form. 0/200 useless extension candidates. Maximal degree in co-relation 248. Up to 36 conditions per place. [2025-04-29 11:07:52,654 INFO L140 encePairwiseOnDemand]: 95/98 looper letters, 11 selfloop transitions, 2 changer transitions 0/95 dead transitions. [2025-04-29 11:07:52,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 95 transitions, 222 flow [2025-04-29 11:07:52,657 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2025-04-29 11:07:52,658 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9047619047619048 [2025-04-29 11:07:52,659 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 198 flow. Second operand 3 states and 266 transitions. [2025-04-29 11:07:52,659 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 95 transitions, 222 flow [2025-04-29 11:07:52,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 95 transitions, 218 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:07:52,661 INFO L231 Difference]: Finished difference. Result has 100 places, 95 transitions, 196 flow [2025-04-29 11:07:52,661 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=196, PETRI_PLACES=100, PETRI_TRANSITIONS=95} [2025-04-29 11:07:52,661 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -1 predicate places. [2025-04-29 11:07:52,661 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 95 transitions, 196 flow [2025-04-29 11:07:52,662 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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) [2025-04-29 11:07:52,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,662 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] [2025-04-29 11:07:52,662 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:07:52,662 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,663 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1236858366, now seen corresponding path program 1 times [2025-04-29 11:07:52,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,663 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658071577] [2025-04-29 11:07:52,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-04-29 11:07:52,686 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-04-29 11:07:52,686 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:52,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,725 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658071577] [2025-04-29 11:07:52,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658071577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642358581] [2025-04-29 11:07:52,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,726 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,738 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2025-04-29 11:07:52,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 95 transitions, 196 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2025-04-29 11:07:52,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2025-04-29 11:07:52,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,795 INFO L116 PetriNetUnfolderBase]: 16/258 cut-off events. [2025-04-29 11:07:52,795 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,796 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307 conditions, 258 events. 16/258 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 901 event pairs, 7 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 277. Up to 36 conditions per place. [2025-04-29 11:07:52,797 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 12 selfloop transitions, 2 changer transitions 0/97 dead transitions. [2025-04-29 11:07:52,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 97 transitions, 228 flow [2025-04-29 11:07:52,797 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 274 transitions. [2025-04-29 11:07:52,798 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9319727891156463 [2025-04-29 11:07:52,799 INFO L175 Difference]: Start difference. First operand has 100 places, 95 transitions, 196 flow. Second operand 3 states and 274 transitions. [2025-04-29 11:07:52,799 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 97 transitions, 228 flow [2025-04-29 11:07:52,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 97 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:07:52,801 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 202 flow [2025-04-29 11:07:52,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=202, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2025-04-29 11:07:52,802 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, -2 predicate places. [2025-04-29 11:07:52,802 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 202 flow [2025-04-29 11:07:52,802 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2025-04-29 11:07:52,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,802 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] [2025-04-29 11:07:52,802 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:07:52,803 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:52,803 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1920661478, now seen corresponding path program 1 times [2025-04-29 11:07:52,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,803 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881128977] [2025-04-29 11:07:52,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,815 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-04-29 11:07:52,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-04-29 11:07:52,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:53,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,244 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881128977] [2025-04-29 11:07:53,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881128977] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268436708] [2025-04-29 11:07:53,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,245 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,245 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,344 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 98 [2025-04-29 11:07:53,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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) [2025-04-29 11:07:53,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 98 [2025-04-29 11:07:53,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:53,506 INFO L116 PetriNetUnfolderBase]: 231/879 cut-off events. [2025-04-29 11:07:53,506 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:53,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1396 conditions, 879 events. 231/879 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5213 event pairs, 96 based on Foata normal form. 0/807 useless extension candidates. Maximal degree in co-relation 1360. Up to 348 conditions per place. [2025-04-29 11:07:53,510 INFO L140 encePairwiseOnDemand]: 82/98 looper letters, 51 selfloop transitions, 41 changer transitions 0/159 dead transitions. [2025-04-29 11:07:53,510 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 159 transitions, 514 flow [2025-04-29 11:07:53,511 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:53,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:53,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2025-04-29 11:07:53,512 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8724489795918368 [2025-04-29 11:07:53,512 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 202 flow. Second operand 6 states and 513 transitions. [2025-04-29 11:07:53,512 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 159 transitions, 514 flow [2025-04-29 11:07:53,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 159 transitions, 514 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:53,515 INFO L231 Difference]: Finished difference. Result has 108 places, 137 transitions, 460 flow [2025-04-29 11:07:53,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=80, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=460, PETRI_PLACES=108, PETRI_TRANSITIONS=137} [2025-04-29 11:07:53,515 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 7 predicate places. [2025-04-29 11:07:53,516 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 137 transitions, 460 flow [2025-04-29 11:07:53,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.66666666666667) internal successors, (430), 6 states have internal predecessors, (430), 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) [2025-04-29 11:07:53,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:53,516 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] [2025-04-29 11:07:53,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:07:53,517 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:53,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:53,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1697677695, now seen corresponding path program 1 times [2025-04-29 11:07:53,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:53,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856276944] [2025-04-29 11:07:53,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:53,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:53,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-04-29 11:07:53,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-04-29 11:07:53,535 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:53,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,718 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856276944] [2025-04-29 11:07:53,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856276944] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985022640] [2025-04-29 11:07:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,719 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,819 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 98 [2025-04-29 11:07:53,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 137 transitions, 460 flow. Second operand has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 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) [2025-04-29 11:07:53,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 98 [2025-04-29 11:07:53,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,049 INFO L116 PetriNetUnfolderBase]: 285/1196 cut-off events. [2025-04-29 11:07:54,050 INFO L117 PetriNetUnfolderBase]: For 361/435 co-relation queries the response was YES. [2025-04-29 11:07:54,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2463 conditions, 1196 events. 285/1196 cut-off events. For 361/435 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 8236 event pairs, 29 based on Foata normal form. 31/1161 useless extension candidates. Maximal degree in co-relation 2422. Up to 272 conditions per place. [2025-04-29 11:07:54,058 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 71 selfloop transitions, 48 changer transitions 0/212 dead transitions. [2025-04-29 11:07:54,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 212 transitions, 962 flow [2025-04-29 11:07:54,059 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 543 transitions. [2025-04-29 11:07:54,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.923469387755102 [2025-04-29 11:07:54,062 INFO L175 Difference]: Start difference. First operand has 108 places, 137 transitions, 460 flow. Second operand 6 states and 543 transitions. [2025-04-29 11:07:54,062 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 212 transitions, 962 flow [2025-04-29 11:07:54,067 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 212 transitions, 962 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:54,070 INFO L231 Difference]: Finished difference. Result has 118 places, 183 transitions, 866 flow [2025-04-29 11:07:54,071 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=460, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=866, PETRI_PLACES=118, PETRI_TRANSITIONS=183} [2025-04-29 11:07:54,072 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 17 predicate places. [2025-04-29 11:07:54,072 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 183 transitions, 866 flow [2025-04-29 11:07:54,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.5) internal successors, (465), 6 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) [2025-04-29 11:07:54,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,075 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] [2025-04-29 11:07:54,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:07:54,075 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,076 INFO L85 PathProgramCache]: Analyzing trace with hash -871519544, now seen corresponding path program 1 times [2025-04-29 11:07:54,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474148920] [2025-04-29 11:07:54,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-04-29 11:07:54,089 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-04-29 11:07:54,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:54,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,103 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474148920] [2025-04-29 11:07:54,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474148920] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:54,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404257540] [2025-04-29 11:07:54,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,103 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:54,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,104 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:54,104 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:54,113 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 98 [2025-04-29 11:07:54,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 183 transitions, 866 flow. Second operand has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2025-04-29 11:07:54,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 98 [2025-04-29 11:07:54,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,228 INFO L116 PetriNetUnfolderBase]: 231/1138 cut-off events. [2025-04-29 11:07:54,228 INFO L117 PetriNetUnfolderBase]: For 638/713 co-relation queries the response was YES. [2025-04-29 11:07:54,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2451 conditions, 1138 events. 231/1138 cut-off events. For 638/713 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 8027 event pairs, 24 based on Foata normal form. 14/1108 useless extension candidates. Maximal degree in co-relation 2406. Up to 215 conditions per place. [2025-04-29 11:07:54,236 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 13 selfloop transitions, 2 changer transitions 0/186 dead transitions. [2025-04-29 11:07:54,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 186 transitions, 902 flow [2025-04-29 11:07:54,237 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:54,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:54,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 275 transitions. [2025-04-29 11:07:54,238 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.935374149659864 [2025-04-29 11:07:54,238 INFO L175 Difference]: Start difference. First operand has 118 places, 183 transitions, 866 flow. Second operand 3 states and 275 transitions. [2025-04-29 11:07:54,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 186 transitions, 902 flow [2025-04-29 11:07:54,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 186 transitions, 894 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:54,249 INFO L231 Difference]: Finished difference. Result has 119 places, 183 transitions, 868 flow [2025-04-29 11:07:54,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=854, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=868, PETRI_PLACES=119, PETRI_TRANSITIONS=183} [2025-04-29 11:07:54,251 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 18 predicate places. [2025-04-29 11:07:54,251 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 183 transitions, 868 flow [2025-04-29 11:07:54,251 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.66666666666667) internal successors, (263), 3 states have internal predecessors, (263), 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) [2025-04-29 11:07:54,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,251 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] [2025-04-29 11:07:54,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:07:54,252 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,252 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,252 INFO L85 PathProgramCache]: Analyzing trace with hash -74071205, now seen corresponding path program 1 times [2025-04-29 11:07:54,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488542354] [2025-04-29 11:07:54,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-29 11:07:54,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-29 11:07:54,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:54,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,328 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488542354] [2025-04-29 11:07:54,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [488542354] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:07:54,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133837615] [2025-04-29 11:07:54,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,328 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:54,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:54,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:54,333 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 98 [2025-04-29 11:07:54,333 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 183 transitions, 868 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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) [2025-04-29 11:07:54,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 98 [2025-04-29 11:07:54,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,366 INFO L116 PetriNetUnfolderBase]: 40/298 cut-off events. [2025-04-29 11:07:54,366 INFO L117 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2025-04-29 11:07:54,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 298 events. 40/298 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1122 event pairs, 4 based on Foata normal form. 2/288 useless extension candidates. Maximal degree in co-relation 523. Up to 68 conditions per place. [2025-04-29 11:07:54,368 INFO L140 encePairwiseOnDemand]: 94/98 looper letters, 2 selfloop transitions, 4 changer transitions 0/116 dead transitions. [2025-04-29 11:07:54,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 116 transitions, 414 flow [2025-04-29 11:07:54,368 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 284 transitions. [2025-04-29 11:07:54,369 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9659863945578231 [2025-04-29 11:07:54,369 INFO L175 Difference]: Start difference. First operand has 119 places, 183 transitions, 868 flow. Second operand 3 states and 284 transitions. [2025-04-29 11:07:54,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 116 transitions, 414 flow [2025-04-29 11:07:54,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 116 transitions, 364 flow, removed 17 selfloop flow, removed 8 redundant places. [2025-04-29 11:07:54,372 INFO L231 Difference]: Finished difference. Result has 112 places, 116 transitions, 360 flow [2025-04-29 11:07:54,372 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=360, PETRI_PLACES=112, PETRI_TRANSITIONS=116} [2025-04-29 11:07:54,374 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 11 predicate places. [2025-04-29 11:07:54,374 INFO L485 AbstractCegarLoop]: Abstraction has has 112 places, 116 transitions, 360 flow [2025-04-29 11:07:54,374 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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) [2025-04-29 11:07:54,374 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,374 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] [2025-04-29 11:07:54,374 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:07:54,374 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,375 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,376 INFO L85 PathProgramCache]: Analyzing trace with hash 824625184, now seen corresponding path program 1 times [2025-04-29 11:07:54,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,376 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087055432] [2025-04-29 11:07:54,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:07:54,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:07:54,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:07:54,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087055432] [2025-04-29 11:07:54,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087055432] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:54,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [101690081] [2025-04-29 11:07:54,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:54,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:54,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:54,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 98 [2025-04-29 11:07:54,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 116 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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) [2025-04-29 11:07:54,696 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,696 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 98 [2025-04-29 11:07:54,696 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,800 INFO L116 PetriNetUnfolderBase]: 142/641 cut-off events. [2025-04-29 11:07:54,801 INFO L117 PetriNetUnfolderBase]: For 114/129 co-relation queries the response was YES. [2025-04-29 11:07:54,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1270 conditions, 641 events. 142/641 cut-off events. For 114/129 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 3448 event pairs, 35 based on Foata normal form. 0/624 useless extension candidates. Maximal degree in co-relation 1226. Up to 231 conditions per place. [2025-04-29 11:07:54,804 INFO L140 encePairwiseOnDemand]: 86/98 looper letters, 59 selfloop transitions, 25 changer transitions 4/156 dead transitions. [2025-04-29 11:07:54,804 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 156 transitions, 648 flow [2025-04-29 11:07:54,805 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 489 transitions. [2025-04-29 11:07:54,806 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8316326530612245 [2025-04-29 11:07:54,806 INFO L175 Difference]: Start difference. First operand has 112 places, 116 transitions, 360 flow. Second operand 6 states and 489 transitions. [2025-04-29 11:07:54,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 156 transitions, 648 flow [2025-04-29 11:07:54,808 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 156 transitions, 644 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:54,809 INFO L231 Difference]: Finished difference. Result has 120 places, 141 transitions, 544 flow [2025-04-29 11:07:54,809 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=544, PETRI_PLACES=120, PETRI_TRANSITIONS=141} [2025-04-29 11:07:54,810 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 19 predicate places. [2025-04-29 11:07:54,810 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 141 transitions, 544 flow [2025-04-29 11:07:54,810 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 72.33333333333333) internal successors, (434), 6 states have internal predecessors, (434), 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) [2025-04-29 11:07:54,811 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,811 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] [2025-04-29 11:07:54,811 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:07:54,811 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:54,811 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1301904690, now seen corresponding path program 1 times [2025-04-29 11:07:54,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,812 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330263321] [2025-04-29 11:07:54,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:07:54,826 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:07:54,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:55,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:55,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:55,024 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330263321] [2025-04-29 11:07:55,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330263321] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:55,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:55,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:55,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175202127] [2025-04-29 11:07:55,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:55,025 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:55,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:55,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:55,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:55,142 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 98 [2025-04-29 11:07:55,143 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 141 transitions, 544 flow. Second operand has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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) [2025-04-29 11:07:55,143 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,143 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 98 [2025-04-29 11:07:55,143 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:55,316 INFO L116 PetriNetUnfolderBase]: 204/835 cut-off events. [2025-04-29 11:07:55,317 INFO L117 PetriNetUnfolderBase]: For 450/469 co-relation queries the response was YES. [2025-04-29 11:07:55,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2171 conditions, 835 events. 204/835 cut-off events. For 450/469 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 4990 event pairs, 16 based on Foata normal form. 22/855 useless extension candidates. Maximal degree in co-relation 2122. Up to 239 conditions per place. [2025-04-29 11:07:55,321 INFO L140 encePairwiseOnDemand]: 83/98 looper letters, 65 selfloop transitions, 51 changer transitions 24/215 dead transitions. [2025-04-29 11:07:55,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 215 transitions, 1170 flow [2025-04-29 11:07:55,321 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 539 transitions. [2025-04-29 11:07:55,322 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9166666666666666 [2025-04-29 11:07:55,322 INFO L175 Difference]: Start difference. First operand has 120 places, 141 transitions, 544 flow. Second operand 6 states and 539 transitions. [2025-04-29 11:07:55,322 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 215 transitions, 1170 flow [2025-04-29 11:07:55,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 215 transitions, 1156 flow, removed 7 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:55,327 INFO L231 Difference]: Finished difference. Result has 129 places, 175 transitions, 914 flow [2025-04-29 11:07:55,327 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=141, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=914, PETRI_PLACES=129, PETRI_TRANSITIONS=175} [2025-04-29 11:07:55,328 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 28 predicate places. [2025-04-29 11:07:55,328 INFO L485 AbstractCegarLoop]: Abstraction has has 129 places, 175 transitions, 914 flow [2025-04-29 11:07:55,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 77.66666666666667) internal successors, (466), 6 states have internal predecessors, (466), 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) [2025-04-29 11:07:55,328 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:55,328 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] [2025-04-29 11:07:55,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:07:55,328 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:55,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:55,329 INFO L85 PathProgramCache]: Analyzing trace with hash -70757258, now seen corresponding path program 1 times [2025-04-29 11:07:55,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:55,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500148088] [2025-04-29 11:07:55,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:55,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:55,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:07:55,343 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:07:55,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:55,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:55,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:55,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:55,653 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500148088] [2025-04-29 11:07:55,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500148088] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:55,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:55,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:55,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438390230] [2025-04-29 11:07:55,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:55,655 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:55,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:55,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:55,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:07:55,990 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 98 [2025-04-29 11:07:55,991 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 129 places, 175 transitions, 914 flow. Second operand has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 11 states have internal predecessors, (707), 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) [2025-04-29 11:07:55,991 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 98 [2025-04-29 11:07:55,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:56,301 INFO L116 PetriNetUnfolderBase]: 220/858 cut-off events. [2025-04-29 11:07:56,301 INFO L117 PetriNetUnfolderBase]: For 1079/1107 co-relation queries the response was YES. [2025-04-29 11:07:56,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2695 conditions, 858 events. 220/858 cut-off events. For 1079/1107 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 5372 event pairs, 46 based on Foata normal form. 12/852 useless extension candidates. Maximal degree in co-relation 2634. Up to 299 conditions per place. [2025-04-29 11:07:56,305 INFO L140 encePairwiseOnDemand]: 86/98 looper letters, 94 selfloop transitions, 31 changer transitions 4/201 dead transitions. [2025-04-29 11:07:56,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 201 transitions, 1400 flow [2025-04-29 11:07:56,305 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:07:56,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:07:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 800 transitions. [2025-04-29 11:07:56,307 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6802721088435374 [2025-04-29 11:07:56,307 INFO L175 Difference]: Start difference. First operand has 129 places, 175 transitions, 914 flow. Second operand 12 states and 800 transitions. [2025-04-29 11:07:56,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 201 transitions, 1400 flow [2025-04-29 11:07:56,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 201 transitions, 1351 flow, removed 13 selfloop flow, removed 4 redundant places. [2025-04-29 11:07:56,316 INFO L231 Difference]: Finished difference. Result has 135 places, 174 transitions, 923 flow [2025-04-29 11:07:56,316 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=923, PETRI_PLACES=135, PETRI_TRANSITIONS=174} [2025-04-29 11:07:56,316 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 34 predicate places. [2025-04-29 11:07:56,316 INFO L485 AbstractCegarLoop]: Abstraction has has 135 places, 174 transitions, 923 flow [2025-04-29 11:07:56,317 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 64.27272727272727) internal successors, (707), 11 states have internal predecessors, (707), 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) [2025-04-29 11:07:56,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:56,317 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] [2025-04-29 11:07:56,317 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:07:56,317 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:56,318 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:56,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1835166904, now seen corresponding path program 1 times [2025-04-29 11:07:56,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:56,318 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022773169] [2025-04-29 11:07:56,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:56,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:56,326 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-29 11:07:56,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-29 11:07:56,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:56,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:56,607 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:07:56,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:56,608 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022773169] [2025-04-29 11:07:56,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022773169] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:56,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:56,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:56,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152084523] [2025-04-29 11:07:56,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:56,609 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:56,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:56,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:56,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:07:56,877 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 98 [2025-04-29 11:07:56,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 174 transitions, 923 flow. Second operand has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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) [2025-04-29 11:07:56,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:56,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 98 [2025-04-29 11:07:56,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:57,193 INFO L116 PetriNetUnfolderBase]: 219/825 cut-off events. [2025-04-29 11:07:57,193 INFO L117 PetriNetUnfolderBase]: For 1099/1134 co-relation queries the response was YES. [2025-04-29 11:07:57,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2744 conditions, 825 events. 219/825 cut-off events. For 1099/1134 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 5043 event pairs, 20 based on Foata normal form. 18/832 useless extension candidates. Maximal degree in co-relation 2679. Up to 177 conditions per place. [2025-04-29 11:07:57,197 INFO L140 encePairwiseOnDemand]: 81/98 looper letters, 95 selfloop transitions, 59 changer transitions 12/232 dead transitions. [2025-04-29 11:07:57,197 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 232 transitions, 1654 flow [2025-04-29 11:07:57,198 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:07:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:07:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 911 transitions. [2025-04-29 11:07:57,200 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7746598639455783 [2025-04-29 11:07:57,200 INFO L175 Difference]: Start difference. First operand has 135 places, 174 transitions, 923 flow. Second operand 12 states and 911 transitions. [2025-04-29 11:07:57,200 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 232 transitions, 1654 flow [2025-04-29 11:07:57,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 232 transitions, 1552 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-04-29 11:07:57,208 INFO L231 Difference]: Finished difference. Result has 140 places, 181 transitions, 1152 flow [2025-04-29 11:07:57,208 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=98, PETRI_DIFFERENCE_MINUEND_FLOW=861, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1152, PETRI_PLACES=140, PETRI_TRANSITIONS=181} [2025-04-29 11:07:57,208 INFO L279 CegarLoopForPetriNet]: 101 programPoint places, 39 predicate places. [2025-04-29 11:07:57,208 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 181 transitions, 1152 flow [2025-04-29 11:07:57,209 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 69.72727272727273) internal successors, (767), 11 states have internal predecessors, (767), 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) [2025-04-29 11:07:57,209 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:57,209 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] [2025-04-29 11:07:57,209 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:07:57,209 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-04-29 11:07:57,210 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:57,210 INFO L85 PathProgramCache]: Analyzing trace with hash 2011571604, now seen corresponding path program 1 times [2025-04-29 11:07:57,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:57,210 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746641267] [2025-04-29 11:07:57,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:57,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:57,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:07:57,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:07:57,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:57,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:07:57,227 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:07:57,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:07:57,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:07:57,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:57,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:07:57,260 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:07:57,260 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:07:57,261 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (14 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-04-29 11:07:57,262 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-04-29 11:07:57,263 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-04-29 11:07:57,263 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:07:57,263 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:07:57,325 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:07:57,325 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:07:57,329 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:07:57 BasicIcfg [2025-04-29 11:07:57,330 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:07:57,330 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:07:57,330 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:07:57,330 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:07:57,331 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:07:52" (3/4) ... [2025-04-29 11:07:57,331 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:07:57,376 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:07:57,401 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:07:57,402 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:07:57,402 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:07:57,402 INFO L158 Benchmark]: Toolchain (without parser) took 5926.47ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.5MB in the beginning and 79.5MB in the end (delta: 76.0MB). Peak memory consumption was 117.9MB. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: CACSL2BoogieTranslator took 222.07ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 140.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: Boogie Procedure Inliner took 29.73ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: Boogie Preprocessor took 27.69ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 138.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: RCFGBuilder took 300.58ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 121.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:07:57,403 INFO L158 Benchmark]: TraceAbstraction took 5269.43ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 121.6MB in the beginning and 91.0MB in the end (delta: 30.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. [2025-04-29 11:07:57,404 INFO L158 Benchmark]: Witness Printer took 71.58ms. Allocated memory is still 243.3MB. Free memory was 91.0MB in the beginning and 79.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:07:57,404 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.32ms. Allocated memory is still 201.3MB. Free memory is still 118.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 222.07ms. Allocated memory is still 201.3MB. Free memory was 155.1MB in the beginning and 140.9MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 29.73ms. Allocated memory is still 201.3MB. Free memory was 140.9MB in the beginning and 139.4MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.69ms. Allocated memory is still 201.3MB. Free memory was 139.4MB in the beginning and 138.0MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 300.58ms. Allocated memory is still 201.3MB. Free memory was 138.0MB in the beginning and 121.9MB in the end (delta: 16.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5269.43ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 121.6MB in the beginning and 91.0MB in the end (delta: 30.6MB). Peak memory consumption was 67.6MB. Max. memory is 16.1GB. * Witness Printer took 71.58ms. Allocated memory is still 243.3MB. Free memory was 91.0MB in the beginning and 79.5MB in the end (delta: 11.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 36]: Data race detected Data race detected The following path leads to a data race: [L12] 0 int *x; VAL [x={0:0}] [L13] 0 int *y; VAL [x={0:0}, y={0:0}] [L15] 0 pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER; VAL [m={1:0}, x={0:0}, y={0:0}] [L26] 0 pthread_t id; VAL [m={1:0}, x={0:0}, y={0:0}] [L28] 0 x = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={0:0}] [L29] 0 y = malloc(sizeof(int)) VAL [m={1:0}, x={-2:0}, y={-3:0}] [L31] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L34] EXPR 0 *x VAL [\at(arg, Pre)={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L34] EXPR 0 *x VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L34] EXPR 0 \read(*x) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L34] 0 printf("%d\n",*x) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L19] EXPR 1 *x VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L19] 1 *x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L36] EXPR 0 *y VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L20] EXPR 1 *y VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L20] 1 *y = 8 VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L36] EXPR 0 *y VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L36] EXPR 0 \read(*y) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] [L20] 1 *y = 8 VAL [\at(arg, Pre)={0:0}, arg={0:0}, m={1:0}, x={-2:0}, y={-3:0}] [L36] 0 printf("%d\n",*y) VAL [\at(arg, Pre)={0:0}, arg={0:0}, id=-1, m={1:0}, x={-2:0}, y={-3:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: *x = 3 [19] * C: y = malloc(sizeof(int)) [29] * C: *x = 3 [19] * C: x = malloc(sizeof(int)) [28] * C: *y = 8 [20] * C: *x = 3 [19] * C: *x = 3 [19] and C: printf("%d\n",*y) [36] - UnprovableResult [Line: 28]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 29]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 34]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 36]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 31]: 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: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 20]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 132 locations, 130 edges, 15 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: 5.1s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 773 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 564 mSDsluCounter, 353 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 322 mSDsCounter, 226 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2675 IncrementalHoareTripleChecker+Invalid, 2901 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 226 mSolverCounterUnsat, 31 mSDtfsCounter, 2675 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1152occurred in iteration=11, InterpolantAutomatonStates: 63, 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, 1.8s InterpolantComputationTime, 543 NumberOfCodeBlocks, 543 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 460 ConstructedInterpolants, 0 QuantifiedInterpolants, 1589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 9/9 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! [2025-04-29 11:07:57,416 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with 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)