./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.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_26-malloc_struct.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 35c5c2f16af42b98b1ab7b41b9d586c18e7bed3d8d4b2db75e06bb8de929769e --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:07:48,811 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:07:48,866 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,870 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:07:48,872 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:07:48,889 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:07:48,889 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:07:48,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:07:48,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:07:48,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:07:48,890 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:07:48,890 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:07:48,891 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:07:48,891 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,892 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:48,892 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:07:48,892 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:07:48,893 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:07:48,893 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:07:48,893 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:07:48,893 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 -> 35c5c2f16af42b98b1ab7b41b9d586c18e7bed3d8d4b2db75e06bb8de929769e [2025-04-29 11:07:49,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:07:49,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:07:49,114 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:07:49,115 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:07:49,115 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:07:49,116 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.c [2025-04-29 11:07:50,430 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44105f786/ba7a65a081c8468eaa07527e73f4341a/FLAG90f3376f8 [2025-04-29 11:07:50,638 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:07:50,639 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/02-base_26-malloc_struct.c [2025-04-29 11:07:50,640 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,640 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,640 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,647 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44105f786/ba7a65a081c8468eaa07527e73f4341a/FLAG90f3376f8 [2025-04-29 11:07:51,630 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/44105f786/ba7a65a081c8468eaa07527e73f4341a [2025-04-29 11:07:51,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:07:51,633 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:07:51,634 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,634 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:07:51,637 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:07:51,638 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,638 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c7ee4ec 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,639 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,655 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:07:51,784 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,793 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:07:51,819 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:07:51,835 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:07:51,835 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,836 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:07:51,836 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,837 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:07:51,837 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:07:51,842 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,851 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,867 INFO L138 Inliner]: procedures = 12, calls = 14, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 54 [2025-04-29 11:07:51,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:07:51,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,869 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:07:51,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:07:51,875 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,875 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,879 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,880 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,890 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,891 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,895 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,896 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,897 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,900 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:07:51,901 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:07:51,901 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:07:51,901 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:07:51,902 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,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:07:51,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:07:51,924 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,927 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,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:07:51,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:07:51,942 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-29 11:07:51,942 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-29 11:07:51,943 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:52,016 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:07:52,018 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:07:52,220 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:07:52,221 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:07:52,245 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:07:52,246 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:07:52,247 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,247 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:07:52,248 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:07:52,248 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:07:52,251 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:07:52,251 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,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63042281 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,252 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,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63042281 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,252 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,254 INFO L128 eAbstractionObserver]: Analyzing ICFG 02-base_26-malloc_struct.c [2025-04-29 11:07:52,264 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:07:52,266 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 02-base_26-malloc_struct.c that has 2 procedures, 92 locations, 90 edges, 1 initial locations, 0 loop locations, and 9 error locations. [2025-04-29 11:07:52,266 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:07:52,318 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-04-29 11:07:52,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 91 transitions, 186 flow [2025-04-29 11:07:52,373 INFO L116 PetriNetUnfolderBase]: 0/90 cut-off events. [2025-04-29 11:07:52,375 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 94 conditions, 90 events. 0/90 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 76 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-04-29 11:07:52,377 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 91 transitions, 186 flow [2025-04-29 11:07:52,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 183 flow [2025-04-29 11:07:52,387 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:07:52,398 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;@4418f5ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:07:52,399 INFO L341 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2025-04-29 11:07:52,406 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:07:52,406 INFO L116 PetriNetUnfolderBase]: 0/14 cut-off events. [2025-04-29 11:07:52,406 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:52,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,407 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,407 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:52,411 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1157269347, now seen corresponding path program 1 times [2025-04-29 11:07:52,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,417 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068451587] [2025-04-29 11:07:52,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:07:52,478 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,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,549 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,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,550 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068451587] [2025-04-29 11:07:52,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068451587] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265808246] [2025-04-29 11:07:52,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,556 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,571 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,606 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 91 [2025-04-29 11:07:52,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 91 [2025-04-29 11:07:52,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,688 INFO L116 PetriNetUnfolderBase]: 16/225 cut-off events. [2025-04-29 11:07:52,689 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:07:52,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 225 events. 16/225 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 727 event pairs, 16 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 240. Up to 46 conditions per place. [2025-04-29 11:07:52,693 INFO L140 encePairwiseOnDemand]: 88/91 looper letters, 13 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2025-04-29 11:07:52,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 211 flow [2025-04-29 11:07:52,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 241 transitions. [2025-04-29 11:07:52,704 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8827838827838828 [2025-04-29 11:07:52,708 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 183 flow. Second operand 3 states and 241 transitions. [2025-04-29 11:07:52,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 211 flow [2025-04-29 11:07:52,713 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 210 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:52,716 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 184 flow [2025-04-29 11:07:52,718 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2025-04-29 11:07:52,720 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2025-04-29 11:07:52,720 INFO L485 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 184 flow [2025-04-29 11:07:52,721 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.33333333333333) internal successors, (229), 3 states have internal predecessors, (229), 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,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,721 INFO L206 CegarLoopForPetriNet]: trace histogram [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,721 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:07:52,721 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:52,722 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1418108599, now seen corresponding path program 1 times [2025-04-29 11:07:52,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,722 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009070247] [2025-04-29 11:07:52,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-29 11:07:52,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-29 11:07:52,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:52,770 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,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:52,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009070247] [2025-04-29 11:07:52,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009070247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:52,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:52,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:07:52,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385268324] [2025-04-29 11:07:52,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:52,772 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:52,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:52,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:52,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:52,790 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-04-29 11:07:52,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:52,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-04-29 11:07:52,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:52,839 INFO L116 PetriNetUnfolderBase]: 24/297 cut-off events. [2025-04-29 11:07:52,840 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:07:52,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 366 conditions, 297 events. 24/297 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1306 event pairs, 24 based on Foata normal form. 0/276 useless extension candidates. Maximal degree in co-relation 343. Up to 61 conditions per place. [2025-04-29 11:07:52,841 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 13 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2025-04-29 11:07:52,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 85 transitions, 204 flow [2025-04-29 11:07:52,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:52,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2025-04-29 11:07:52,843 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8681318681318682 [2025-04-29 11:07:52,843 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 237 transitions. [2025-04-29 11:07:52,843 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 85 transitions, 204 flow [2025-04-29 11:07:52,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 85 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:07:52,845 INFO L231 Difference]: Finished difference. Result has 90 places, 85 transitions, 174 flow [2025-04-29 11:07:52,845 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=90, PETRI_TRANSITIONS=85} [2025-04-29 11:07:52,846 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -4 predicate places. [2025-04-29 11:07:52,846 INFO L485 AbstractCegarLoop]: Abstraction has has 90 places, 85 transitions, 174 flow [2025-04-29 11:07:52,846 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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,846 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:52,846 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] [2025-04-29 11:07:52,847 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:07:52,847 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:52,847 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:52,847 INFO L85 PathProgramCache]: Analyzing trace with hash 193515332, now seen corresponding path program 1 times [2025-04-29 11:07:52,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:52,847 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591847930] [2025-04-29 11:07:52,848 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:52,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:52,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-04-29 11:07:52,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-04-29 11:07:52,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:52,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,263 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,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,263 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591847930] [2025-04-29 11:07:53,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591847930] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988416610] [2025-04-29 11:07:53,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,263 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,395 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 91 [2025-04-29 11:07:53,396 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 85 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 91 [2025-04-29 11:07:53,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:53,554 INFO L116 PetriNetUnfolderBase]: 185/653 cut-off events. [2025-04-29 11:07:53,554 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:07:53,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 653 events. 185/653 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 3614 event pairs, 52 based on Foata normal form. 0/613 useless extension candidates. Maximal degree in co-relation 1036. Up to 246 conditions per place. [2025-04-29 11:07:53,559 INFO L140 encePairwiseOnDemand]: 75/91 looper letters, 47 selfloop transitions, 41 changer transitions 0/149 dead transitions. [2025-04-29 11:07:53,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 149 transitions, 478 flow [2025-04-29 11:07:53,559 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:53,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:53,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 491 transitions. [2025-04-29 11:07:53,561 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8992673992673993 [2025-04-29 11:07:53,561 INFO L175 Difference]: Start difference. First operand has 90 places, 85 transitions, 174 flow. Second operand 6 states and 491 transitions. [2025-04-29 11:07:53,561 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 149 transitions, 478 flow [2025-04-29 11:07:53,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 149 transitions, 477 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:53,564 INFO L231 Difference]: Finished difference. Result has 98 places, 127 transitions, 431 flow [2025-04-29 11:07:53,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=431, PETRI_PLACES=98, PETRI_TRANSITIONS=127} [2025-04-29 11:07:53,565 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-04-29 11:07:53,565 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 127 transitions, 431 flow [2025-04-29 11:07:53,565 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 68.66666666666667) internal successors, (412), 6 states have internal predecessors, (412), 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,565 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:53,565 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] [2025-04-29 11:07:53,566 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:07:53,566 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:53,566 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:53,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1796501703, now seen corresponding path program 1 times [2025-04-29 11:07:53,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:53,566 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714375918] [2025-04-29 11:07:53,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:53,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:53,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-29 11:07:53,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-29 11:07:53,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:53,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:53,776 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,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:53,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714375918] [2025-04-29 11:07:53,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714375918] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:53,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:53,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:53,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433573055] [2025-04-29 11:07:53,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:53,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:53,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:53,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:53,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:53,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 91 [2025-04-29 11:07:53,945 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 127 transitions, 431 flow. Second operand has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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,945 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:53,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 91 [2025-04-29 11:07:53,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,076 INFO L116 PetriNetUnfolderBase]: 231/990 cut-off events. [2025-04-29 11:07:54,076 INFO L117 PetriNetUnfolderBase]: For 292/339 co-relation queries the response was YES. [2025-04-29 11:07:54,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2064 conditions, 990 events. 231/990 cut-off events. For 292/339 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 6824 event pairs, 25 based on Foata normal form. 26/983 useless extension candidates. Maximal degree in co-relation 2036. Up to 180 conditions per place. [2025-04-29 11:07:54,083 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 67 selfloop transitions, 32 changer transitions 0/186 dead transitions. [2025-04-29 11:07:54,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 186 transitions, 861 flow [2025-04-29 11:07:54,083 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 505 transitions. [2025-04-29 11:07:54,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.924908424908425 [2025-04-29 11:07:54,085 INFO L175 Difference]: Start difference. First operand has 98 places, 127 transitions, 431 flow. Second operand 6 states and 505 transitions. [2025-04-29 11:07:54,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 186 transitions, 861 flow [2025-04-29 11:07:54,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 186 transitions, 861 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:54,090 INFO L231 Difference]: Finished difference. Result has 108 places, 157 transitions, 733 flow [2025-04-29 11:07:54,090 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=733, PETRI_PLACES=108, PETRI_TRANSITIONS=157} [2025-04-29 11:07:54,091 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 14 predicate places. [2025-04-29 11:07:54,091 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 157 transitions, 733 flow [2025-04-29 11:07:54,091 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 74.5) internal successors, (447), 6 states have internal predecessors, (447), 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,091 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,091 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] [2025-04-29 11:07:54,091 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:07:54,092 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:54,092 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,092 INFO L85 PathProgramCache]: Analyzing trace with hash -943480521, now seen corresponding path program 1 times [2025-04-29 11:07:54,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,092 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315888919] [2025-04-29 11:07:54,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-29 11:07:54,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:07:54,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,152 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,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,153 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315888919] [2025-04-29 11:07:54,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315888919] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:07:54,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527139929] [2025-04-29 11:07:54,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,154 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:07:54,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:07:54,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:07:54,157 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 91 [2025-04-29 11:07:54,158 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 157 transitions, 733 flow. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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,158 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,158 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 91 [2025-04-29 11:07:54,158 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,188 INFO L116 PetriNetUnfolderBase]: 39/274 cut-off events. [2025-04-29 11:07:54,189 INFO L117 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-04-29 11:07:54,189 INFO L83 FinitePrefix]: Finished finitePrefix Result has 517 conditions, 274 events. 39/274 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 966 event pairs, 4 based on Foata normal form. 2/263 useless extension candidates. Maximal degree in co-relation 485. Up to 64 conditions per place. [2025-04-29 11:07:54,190 INFO L140 encePairwiseOnDemand]: 87/91 looper letters, 2 selfloop transitions, 4 changer transitions 0/106 dead transitions. [2025-04-29 11:07:54,191 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 106 transitions, 367 flow [2025-04-29 11:07:54,191 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:07:54,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:07:54,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2025-04-29 11:07:54,193 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9633699633699634 [2025-04-29 11:07:54,193 INFO L175 Difference]: Start difference. First operand has 108 places, 157 transitions, 733 flow. Second operand 3 states and 263 transitions. [2025-04-29 11:07:54,194 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 106 transitions, 367 flow [2025-04-29 11:07:54,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 106 transitions, 325 flow, removed 13 selfloop flow, removed 8 redundant places. [2025-04-29 11:07:54,200 INFO L231 Difference]: Finished difference. Result has 101 places, 106 transitions, 321 flow [2025-04-29 11:07:54,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=313, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=321, PETRI_PLACES=101, PETRI_TRANSITIONS=106} [2025-04-29 11:07:54,201 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2025-04-29 11:07:54,201 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 106 transitions, 321 flow [2025-04-29 11:07:54,202 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 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,202 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,202 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] [2025-04-29 11:07:54,202 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:07:54,202 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:54,204 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1485404682, now seen corresponding path program 1 times [2025-04-29 11:07:54,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,205 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194075692] [2025-04-29 11:07:54,205 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:07:54,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:07:54,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,453 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,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194075692] [2025-04-29 11:07:54,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194075692] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:54,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071639116] [2025-04-29 11:07:54,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,454 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:54,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:54,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:54,573 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 91 [2025-04-29 11:07:54,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 106 transitions, 321 flow. Second operand has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:54,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 91 [2025-04-29 11:07:54,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:54,660 INFO L116 PetriNetUnfolderBase]: 93/470 cut-off events. [2025-04-29 11:07:54,660 INFO L117 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2025-04-29 11:07:54,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 897 conditions, 470 events. 93/470 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2172 event pairs, 20 based on Foata normal form. 0/444 useless extension candidates. Maximal degree in co-relation 867. Up to 153 conditions per place. [2025-04-29 11:07:54,663 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 34 selfloop transitions, 22 changer transitions 0/127 dead transitions. [2025-04-29 11:07:54,663 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 507 flow [2025-04-29 11:07:54,664 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:54,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:54,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 473 transitions. [2025-04-29 11:07:54,665 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8663003663003663 [2025-04-29 11:07:54,665 INFO L175 Difference]: Start difference. First operand has 101 places, 106 transitions, 321 flow. Second operand 6 states and 473 transitions. [2025-04-29 11:07:54,665 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 507 flow [2025-04-29 11:07:54,667 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 503 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:54,669 INFO L231 Difference]: Finished difference. Result has 110 places, 127 transitions, 499 flow [2025-04-29 11:07:54,670 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=317, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=499, PETRI_PLACES=110, PETRI_TRANSITIONS=127} [2025-04-29 11:07:54,670 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 16 predicate places. [2025-04-29 11:07:54,670 INFO L485 AbstractCegarLoop]: Abstraction has has 110 places, 127 transitions, 499 flow [2025-04-29 11:07:54,671 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 73.66666666666667) internal successors, (442), 6 states have internal predecessors, (442), 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,671 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:54,671 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] [2025-04-29 11:07:54,671 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:07:54,671 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:54,671 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:54,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1622214714, now seen corresponding path program 1 times [2025-04-29 11:07:54,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:54,671 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807542535] [2025-04-29 11:07:54,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:54,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:54,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:07:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:07:54,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:54,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:54,890 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,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:54,891 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807542535] [2025-04-29 11:07:54,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807542535] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:54,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:54,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:07:54,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972844005] [2025-04-29 11:07:54,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:54,891 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:07:54,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:54,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:07:54,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:07:55,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 91 [2025-04-29 11:07:55,022 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 127 transitions, 499 flow. Second operand has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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,022 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 91 [2025-04-29 11:07:55,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:55,164 INFO L116 PetriNetUnfolderBase]: 195/723 cut-off events. [2025-04-29 11:07:55,164 INFO L117 PetriNetUnfolderBase]: For 309/315 co-relation queries the response was YES. [2025-04-29 11:07:55,166 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1810 conditions, 723 events. 195/723 cut-off events. For 309/315 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4016 event pairs, 12 based on Foata normal form. 0/701 useless extension candidates. Maximal degree in co-relation 1775. Up to 295 conditions per place. [2025-04-29 11:07:55,168 INFO L140 encePairwiseOnDemand]: 76/91 looper letters, 56 selfloop transitions, 52 changer transitions 11/184 dead transitions. [2025-04-29 11:07:55,169 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 184 transitions, 1006 flow [2025-04-29 11:07:55,169 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:07:55,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:07:55,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 477 transitions. [2025-04-29 11:07:55,172 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8736263736263736 [2025-04-29 11:07:55,172 INFO L175 Difference]: Start difference. First operand has 110 places, 127 transitions, 499 flow. Second operand 6 states and 477 transitions. [2025-04-29 11:07:55,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 184 transitions, 1006 flow [2025-04-29 11:07:55,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 184 transitions, 968 flow, removed 19 selfloop flow, removed 0 redundant places. [2025-04-29 11:07:55,179 INFO L231 Difference]: Finished difference. Result has 120 places, 169 transitions, 923 flow [2025-04-29 11:07:55,179 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=467, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=99, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=120, PETRI_TRANSITIONS=169} [2025-04-29 11:07:55,180 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 26 predicate places. [2025-04-29 11:07:55,180 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 169 transitions, 923 flow [2025-04-29 11:07:55,181 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.83333333333333) internal successors, (419), 6 states have internal predecessors, (419), 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,181 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:55,181 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] [2025-04-29 11:07:55,181 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:07:55,182 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:55,182 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:55,182 INFO L85 PathProgramCache]: Analyzing trace with hash 523922950, now seen corresponding path program 1 times [2025-04-29 11:07:55,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:55,182 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653500226] [2025-04-29 11:07:55,182 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:55,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:55,191 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:07:55,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:07:55,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:55,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:55,686 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:55,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:55,686 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653500226] [2025-04-29 11:07:55,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653500226] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:55,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:55,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:07:55,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946338303] [2025-04-29 11:07:55,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:55,687 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:07:55,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:55,687 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:07:55,687 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:07:55,945 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2025-04-29 11:07:55,946 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 169 transitions, 923 flow. Second operand has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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,946 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:55,946 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2025-04-29 11:07:55,946 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:56,073 INFO L116 PetriNetUnfolderBase]: 189/689 cut-off events. [2025-04-29 11:07:56,074 INFO L117 PetriNetUnfolderBase]: For 731/761 co-relation queries the response was YES. [2025-04-29 11:07:56,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2122 conditions, 689 events. 189/689 cut-off events. For 731/761 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 3770 event pairs, 19 based on Foata normal form. 21/703 useless extension candidates. Maximal degree in co-relation 2078. Up to 133 conditions per place. [2025-04-29 11:07:56,078 INFO L140 encePairwiseOnDemand]: 79/91 looper letters, 88 selfloop transitions, 36 changer transitions 16/216 dead transitions. [2025-04-29 11:07:56,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 216 transitions, 1537 flow [2025-04-29 11:07:56,078 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:07:56,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:07:56,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 672 transitions. [2025-04-29 11:07:56,080 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7384615384615385 [2025-04-29 11:07:56,080 INFO L175 Difference]: Start difference. First operand has 120 places, 169 transitions, 923 flow. Second operand 10 states and 672 transitions. [2025-04-29 11:07:56,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 216 transitions, 1537 flow [2025-04-29 11:07:56,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 216 transitions, 1494 flow, removed 18 selfloop flow, removed 1 redundant places. [2025-04-29 11:07:56,089 INFO L231 Difference]: Finished difference. Result has 134 places, 177 transitions, 1070 flow [2025-04-29 11:07:56,089 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=169, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1070, PETRI_PLACES=134, PETRI_TRANSITIONS=177} [2025-04-29 11:07:56,089 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 40 predicate places. [2025-04-29 11:07:56,090 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 177 transitions, 1070 flow [2025-04-29 11:07:56,090 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 63.3) internal successors, (633), 10 states have internal predecessors, (633), 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,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:56,090 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] [2025-04-29 11:07:56,090 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:07:56,090 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:56,091 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:56,091 INFO L85 PathProgramCache]: Analyzing trace with hash 267054290, now seen corresponding path program 1 times [2025-04-29 11:07:56,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:56,091 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75035875] [2025-04-29 11:07:56,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:56,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:56,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:07:56,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:07:56,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:56,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:56,518 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:56,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:56,518 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75035875] [2025-04-29 11:07:56,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75035875] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:56,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:56,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-04-29 11:07:56,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834080939] [2025-04-29 11:07:56,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:56,519 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:07:56,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:56,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:07:56,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:07:56,726 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 91 [2025-04-29 11:07:56,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 177 transitions, 1070 flow. Second operand has 10 states, 10 states have (on average 64.7) internal successors, (647), 10 states have internal predecessors, (647), 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,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:56,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 91 [2025-04-29 11:07:56,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:57,018 INFO L116 PetriNetUnfolderBase]: 230/790 cut-off events. [2025-04-29 11:07:57,018 INFO L117 PetriNetUnfolderBase]: For 1355/1399 co-relation queries the response was YES. [2025-04-29 11:07:57,020 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2779 conditions, 790 events. 230/790 cut-off events. For 1355/1399 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 4572 event pairs, 8 based on Foata normal form. 28/814 useless extension candidates. Maximal degree in co-relation 2750. Up to 159 conditions per place. [2025-04-29 11:07:57,022 INFO L140 encePairwiseOnDemand]: 75/91 looper letters, 116 selfloop transitions, 67 changer transitions 17/259 dead transitions. [2025-04-29 11:07:57,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 259 transitions, 2082 flow [2025-04-29 11:07:57,022 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:07:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-29 11:07:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 670 transitions. [2025-04-29 11:07:57,024 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.818070818070818 [2025-04-29 11:07:57,024 INFO L175 Difference]: Start difference. First operand has 134 places, 177 transitions, 1070 flow. Second operand 9 states and 670 transitions. [2025-04-29 11:07:57,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 259 transitions, 2082 flow [2025-04-29 11:07:57,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 259 transitions, 2043 flow, removed 3 selfloop flow, removed 5 redundant places. [2025-04-29 11:07:57,035 INFO L231 Difference]: Finished difference. Result has 140 places, 198 transitions, 1447 flow [2025-04-29 11:07:57,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1042, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=177, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=49, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1447, PETRI_PLACES=140, PETRI_TRANSITIONS=198} [2025-04-29 11:07:57,035 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 46 predicate places. [2025-04-29 11:07:57,035 INFO L485 AbstractCegarLoop]: Abstraction has has 140 places, 198 transitions, 1447 flow [2025-04-29 11:07:57,036 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 64.7) internal successors, (647), 10 states have internal predecessors, (647), 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,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:57,036 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] [2025-04-29 11:07:57,036 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:07:57,036 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:57,036 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash 1794648683, now seen corresponding path program 1 times [2025-04-29 11:07:57,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:57,037 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721580282] [2025-04-29 11:07:57,037 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:07:57,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:57,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:07:57,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:07:57,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:07:57,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:57,465 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:57,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:57,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721580282] [2025-04-29 11:07:57,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721580282] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:57,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:57,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:57,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650199682] [2025-04-29 11:07:57,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:57,465 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:57,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:57,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:57,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:07:57,689 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2025-04-29 11:07:57,690 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 198 transitions, 1447 flow. Second operand has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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,690 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:57,690 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2025-04-29 11:07:57,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:57,858 INFO L116 PetriNetUnfolderBase]: 199/785 cut-off events. [2025-04-29 11:07:57,858 INFO L117 PetriNetUnfolderBase]: For 2271/2357 co-relation queries the response was YES. [2025-04-29 11:07:57,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2982 conditions, 785 events. 199/785 cut-off events. For 2271/2357 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4642 event pairs, 21 based on Foata normal form. 43/821 useless extension candidates. Maximal degree in co-relation 2925. Up to 167 conditions per place. [2025-04-29 11:07:57,862 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 93 selfloop transitions, 36 changer transitions 6/225 dead transitions. [2025-04-29 11:07:57,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 225 transitions, 2033 flow [2025-04-29 11:07:57,862 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-29 11:07:57,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-04-29 11:07:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 728 transitions. [2025-04-29 11:07:57,864 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2025-04-29 11:07:57,864 INFO L175 Difference]: Start difference. First operand has 140 places, 198 transitions, 1447 flow. Second operand 11 states and 728 transitions. [2025-04-29 11:07:57,864 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 225 transitions, 2033 flow [2025-04-29 11:07:57,875 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 225 transitions, 1985 flow, removed 11 selfloop flow, removed 4 redundant places. [2025-04-29 11:07:57,877 INFO L231 Difference]: Finished difference. Result has 148 places, 196 transitions, 1471 flow [2025-04-29 11:07:57,878 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1415, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1471, PETRI_PLACES=148, PETRI_TRANSITIONS=196} [2025-04-29 11:07:57,882 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 54 predicate places. [2025-04-29 11:07:57,882 INFO L485 AbstractCegarLoop]: Abstraction has has 148 places, 196 transitions, 1471 flow [2025-04-29 11:07:57,882 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:57,882 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] [2025-04-29 11:07:57,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:07:57,882 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:57,883 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:57,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1642737745, now seen corresponding path program 2 times [2025-04-29 11:07:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:57,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156148518] [2025-04-29 11:07:57,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:07:57,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:57,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:07:57,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:07:57,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-29 11:07:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:58,233 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:58,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:58,233 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156148518] [2025-04-29 11:07:58,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156148518] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:58,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:58,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193779372] [2025-04-29 11:07:58,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:58,234 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:58,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:58,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:07:58,498 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2025-04-29 11:07:58,499 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 148 places, 196 transitions, 1471 flow. Second operand has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:58,499 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:58,499 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2025-04-29 11:07:58,499 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:58,769 INFO L116 PetriNetUnfolderBase]: 196/780 cut-off events. [2025-04-29 11:07:58,769 INFO L117 PetriNetUnfolderBase]: For 2419/2473 co-relation queries the response was YES. [2025-04-29 11:07:58,771 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2985 conditions, 780 events. 196/780 cut-off events. For 2419/2473 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4637 event pairs, 21 based on Foata normal form. 28/801 useless extension candidates. Maximal degree in co-relation 2952. Up to 167 conditions per place. [2025-04-29 11:07:58,774 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 93 selfloop transitions, 34 changer transitions 7/224 dead transitions. [2025-04-29 11:07:58,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 224 transitions, 2049 flow [2025-04-29 11:07:58,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:07:58,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-04-29 11:07:58,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 789 transitions. [2025-04-29 11:07:58,777 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7225274725274725 [2025-04-29 11:07:58,777 INFO L175 Difference]: Start difference. First operand has 148 places, 196 transitions, 1471 flow. Second operand 12 states and 789 transitions. [2025-04-29 11:07:58,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 224 transitions, 2049 flow [2025-04-29 11:07:58,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 224 transitions, 1967 flow, removed 5 selfloop flow, removed 10 redundant places. [2025-04-29 11:07:58,793 INFO L231 Difference]: Finished difference. Result has 150 places, 194 transitions, 1447 flow [2025-04-29 11:07:58,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1393, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=1447, PETRI_PLACES=150, PETRI_TRANSITIONS=194} [2025-04-29 11:07:58,793 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 56 predicate places. [2025-04-29 11:07:58,794 INFO L485 AbstractCegarLoop]: Abstraction has has 150 places, 194 transitions, 1447 flow [2025-04-29 11:07:58,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:58,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:58,794 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] [2025-04-29 11:07:58,794 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:07:58,794 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:58,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:58,795 INFO L85 PathProgramCache]: Analyzing trace with hash -469109845, now seen corresponding path program 3 times [2025-04-29 11:07:58,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:58,795 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939236664] [2025-04-29 11:07:58,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:07:58,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:58,810 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:07:58,814 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:07:58,815 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-29 11:07:58,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:59,086 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:59,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:59,086 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939236664] [2025-04-29 11:07:59,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939236664] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:59,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:59,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:59,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608426479] [2025-04-29 11:07:59,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:59,086 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:59,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:59,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:59,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:07:59,375 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2025-04-29 11:07:59,376 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 194 transitions, 1447 flow. Second operand has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:59,376 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:07:59,376 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2025-04-29 11:07:59,376 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:07:59,685 INFO L116 PetriNetUnfolderBase]: 200/837 cut-off events. [2025-04-29 11:07:59,685 INFO L117 PetriNetUnfolderBase]: For 2498/2523 co-relation queries the response was YES. [2025-04-29 11:07:59,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3155 conditions, 837 events. 200/837 cut-off events. For 2498/2523 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5196 event pairs, 21 based on Foata normal form. 13/843 useless extension candidates. Maximal degree in co-relation 3121. Up to 242 conditions per place. [2025-04-29 11:07:59,691 INFO L140 encePairwiseOnDemand]: 75/91 looper letters, 70 selfloop transitions, 42 changer transitions 12/214 dead transitions. [2025-04-29 11:07:59,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 214 transitions, 1888 flow [2025-04-29 11:07:59,692 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:07:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:07:59,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 859 transitions. [2025-04-29 11:07:59,694 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7261200338123415 [2025-04-29 11:07:59,694 INFO L175 Difference]: Start difference. First operand has 150 places, 194 transitions, 1447 flow. Second operand 13 states and 859 transitions. [2025-04-29 11:07:59,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 214 transitions, 1888 flow [2025-04-29 11:07:59,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 214 transitions, 1782 flow, removed 7 selfloop flow, removed 11 redundant places. [2025-04-29 11:07:59,708 INFO L231 Difference]: Finished difference. Result has 155 places, 200 transitions, 1558 flow [2025-04-29 11:07:59,709 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1371, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=153, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1558, PETRI_PLACES=155, PETRI_TRANSITIONS=200} [2025-04-29 11:07:59,710 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 61 predicate places. [2025-04-29 11:07:59,710 INFO L485 AbstractCegarLoop]: Abstraction has has 155 places, 200 transitions, 1558 flow [2025-04-29 11:07:59,711 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:59,711 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:07:59,711 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] [2025-04-29 11:07:59,711 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:07:59,711 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:07:59,712 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:07:59,712 INFO L85 PathProgramCache]: Analyzing trace with hash 656301751, now seen corresponding path program 4 times [2025-04-29 11:07:59,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:07:59,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537126041] [2025-04-29 11:07:59,712 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-29 11:07:59,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:07:59,720 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 65 statements into 2 equivalence classes. [2025-04-29 11:07:59,724 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:07:59,724 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-04-29 11:07:59,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:07:59,996 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:59,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:07:59,997 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537126041] [2025-04-29 11:07:59,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537126041] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:07:59,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:07:59,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:07:59,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610513137] [2025-04-29 11:07:59,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:07:59,997 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:07:59,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:07:59,997 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:07:59,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2025-04-29 11:08:00,221 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 61 out of 91 [2025-04-29 11:08:00,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 200 transitions, 1558 flow. Second operand has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:08:00,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:08:00,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 61 of 91 [2025-04-29 11:08:00,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:08:00,427 INFO L116 PetriNetUnfolderBase]: 197/823 cut-off events. [2025-04-29 11:08:00,427 INFO L117 PetriNetUnfolderBase]: For 2473/2497 co-relation queries the response was YES. [2025-04-29 11:08:00,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3144 conditions, 823 events. 197/823 cut-off events. For 2473/2497 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5098 event pairs, 21 based on Foata normal form. 13/829 useless extension candidates. Maximal degree in co-relation 3110. Up to 169 conditions per place. [2025-04-29 11:08:00,431 INFO L140 encePairwiseOnDemand]: 80/91 looper letters, 91 selfloop transitions, 37 changer transitions 7/225 dead transitions. [2025-04-29 11:08:00,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 162 places, 225 transitions, 2114 flow [2025-04-29 11:08:00,432 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:08:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:08:00,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 846 transitions. [2025-04-29 11:08:00,434 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7151310228233305 [2025-04-29 11:08:00,435 INFO L175 Difference]: Start difference. First operand has 155 places, 200 transitions, 1558 flow. Second operand 13 states and 846 transitions. [2025-04-29 11:08:00,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 162 places, 225 transitions, 2114 flow [2025-04-29 11:08:00,447 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 225 transitions, 2061 flow, removed 11 selfloop flow, removed 8 redundant places. [2025-04-29 11:08:00,451 INFO L231 Difference]: Finished difference. Result has 154 places, 195 transitions, 1544 flow [2025-04-29 11:08:00,451 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=1499, PETRI_DIFFERENCE_MINUEND_PLACES=142, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=162, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1544, PETRI_PLACES=154, PETRI_TRANSITIONS=195} [2025-04-29 11:08:00,452 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 60 predicate places. [2025-04-29 11:08:00,453 INFO L485 AbstractCegarLoop]: Abstraction has has 154 places, 195 transitions, 1544 flow [2025-04-29 11:08:00,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 63.54545454545455) internal successors, (699), 11 states have internal predecessors, (699), 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:08:00,453 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:08:00,453 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] [2025-04-29 11:08:00,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:08:00,453 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 11 more)] === [2025-04-29 11:08:00,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:08:00,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1919859942, now seen corresponding path program 1 times [2025-04-29 11:08:00,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:08:00,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717926932] [2025-04-29 11:08:00,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:08:00,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:08:00,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:08:00,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:08:00,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:00,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:00,475 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:08:00,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:08:00,481 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:08:00,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:08:00,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:08:00,507 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:08:00,507 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:08:00,508 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (13 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (9 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 14 remaining) [2025-04-29 11:08:00,509 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 14 remaining) [2025-04-29 11:08:00,509 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:08:00,509 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:08:00,555 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-29 11:08:00,555 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:08:00,560 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:08:00 BasicIcfg [2025-04-29 11:08:00,560 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:08:00,561 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:08:00,561 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:08:00,561 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:08:00,561 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:08:00,561 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-29 11:08:00,606 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 1. [2025-04-29 11:08:00,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:08:00,633 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:08:00,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:08:00,634 INFO L158 Benchmark]: Toolchain (without parser) took 9000.71ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 135.1MB in the beginning and 297.7MB in the end (delta: -162.6MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,634 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,634 INFO L158 Benchmark]: CACSL2BoogieTranslator took 201.82ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 121.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,634 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.49ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,634 INFO L158 Benchmark]: Boogie Preprocessor took 32.31ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,634 INFO L158 Benchmark]: RCFGBuilder took 345.71ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 102.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,635 INFO L158 Benchmark]: TraceAbstraction took 8312.05ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 102.3MB in the beginning and 306.1MB in the end (delta: -203.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:08:00,635 INFO L158 Benchmark]: Witness Printer took 72.80ms. Allocated memory is still 352.3MB. Free memory was 306.1MB in the beginning and 297.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:08:00,636 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.28ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 201.82ms. Allocated memory is still 167.8MB. Free memory was 135.1MB in the beginning and 121.4MB in the end (delta: 13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.49ms. Allocated memory is still 167.8MB. Free memory was 121.3MB in the beginning and 119.5MB in the end (delta: 1.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.31ms. Allocated memory is still 167.8MB. Free memory was 119.5MB in the beginning and 118.1MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 345.71ms. Allocated memory is still 167.8MB. Free memory was 118.1MB in the beginning and 102.7MB in the end (delta: 15.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 8312.05ms. Allocated memory was 167.8MB in the beginning and 352.3MB in the end (delta: 184.5MB). Free memory was 102.3MB in the beginning and 306.1MB in the end (delta: -203.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 72.80ms. Allocated memory is still 352.3MB. Free memory was 306.1MB in the beginning and 297.7MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 41]: Data race detected Data race detected The following path leads to a data race: [L17] 0 data *d; VAL [d={0:0}] [L19] 0 pthread_mutex_t m = PTHREAD_MUTEX_INITIALIZER; VAL [d={0:0}, m={1:0}] [L30] 0 pthread_t id; VAL [d={0:0}, m={1:0}] [L31] 0 data *z; VAL [d={0:0}, m={1:0}] [L33] 0 d = malloc(sizeof(data)) VAL [d={-2:0}, m={1:0}] [L34] 0 z = d VAL [d={-2:0}, m={1:0}, z={-2:0}] [L36] FCALL, FORK 0 pthread_create(&id, NULL, t_fun, NULL) VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L39] EXPR 0 d->x VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L39] 0 printf("%d\n",d->x) VAL [\at(arg, Pre)={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L23] EXPR 1 d->x VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L23] 1 d->x = 3 VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L41] EXPR 0 z->y VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2:0}] [L24] EXPR 1 d->y VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L24] 1 d->y = 8 VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, m={1:0}] [L41] 0 printf("%d\n",z->y) VAL [\at(arg, Pre)={0:0}, arg={0:0}, d={-2:0}, id=-1, m={1:0}, z={-2: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: d->x = 3 [23] * C: d->x = 3 [23] * C: d->x = 3 [23] * C: d = malloc(sizeof(data)) [33] * C: d->y = 8 [24] * C: d->x = 3 [23] and C: printf("%d\n",z->y) [41] - UnprovableResult [Line: 33]: 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: 39]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 39]: 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 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: 23]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 23]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 24]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 24]: 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, 125 locations, 123 edges, 14 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: 8.2s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1408 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1010 mSDsluCounter, 397 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 294 mSDsCounter, 511 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4554 IncrementalHoareTripleChecker+Invalid, 5065 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 511 mSolverCounterUnsat, 103 mSDtfsCounter, 4554 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 111 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1558occurred in iteration=12, InterpolantAutomatonStates: 101, 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, 3.3s InterpolantComputationTime, 684 NumberOfCodeBlocks, 684 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 605 ConstructedInterpolants, 0 QuantifiedInterpolants, 4047 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-04-29 11:08:00,648 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)