./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread/twostage_3-race.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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 ../sv-benchmarks/c/pthread/twostage_3-race.i -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 c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 21:57:47,621 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 21:57:47,687 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 21:57:47,693 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 21:57:47,695 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 21:57:47,720 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 21:57:47,721 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 21:57:47,721 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 21:57:47,722 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 21:57:47,722 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 21:57:47,723 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 21:57:47,723 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 21:57:47,723 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 21:57:47,723 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 21:57:47,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 21:57:47,724 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 21:57:47,725 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 21:57:47,725 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 21:57:47,725 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 21:57:47,725 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:47,725 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 21:57:47,725 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 21:57:47,725 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 21:57:47,726 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 21:57:47,726 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 -> c1c75e051173a22f60f33f26eab32e0b3a7dcaf46f2d4cc494d0c9d8775c984e [2025-03-13 21:57:47,940 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 21:57:47,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 21:57:47,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 21:57:47,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 21:57:47,951 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 21:57:47,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread/twostage_3-race.i [2025-03-13 21:57:49,065 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fdd4c380/8a790c2aac4544d2b8d95e4486f13369/FLAG752b34211 [2025-03-13 21:57:49,322 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 21:57:49,322 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/twostage_3-race.i [2025-03-13 21:57:49,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fdd4c380/8a790c2aac4544d2b8d95e4486f13369/FLAG752b34211 [2025-03-13 21:57:49,347 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fdd4c380/8a790c2aac4544d2b8d95e4486f13369 [2025-03-13 21:57:49,349 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 21:57:49,350 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 21:57:49,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:49,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 21:57:49,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 21:57:49,354 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,356 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49, skipping insertion in model container [2025-03-13 21:57:49,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,389 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 21:57:49,787 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-13 21:57:49,788 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-13 21:57:49,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:49,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 21:57:49,854 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-13 21:57:49,854 WARN L1731 CHandler]: Possible shadowing of function lock [2025-03-13 21:57:49,855 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 21:57:49,905 INFO L204 MainTranslator]: Completed translation [2025-03-13 21:57:49,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49 WrapperNode [2025-03-13 21:57:49,906 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 21:57:49,907 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:49,907 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 21:57:49,907 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 21:57:49,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,926 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,943 INFO L138 Inliner]: procedures = 373, calls = 32, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 272 [2025-03-13 21:57:49,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 21:57:49,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 21:57:49,944 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 21:57:49,944 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 21:57:49,949 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,949 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,952 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,952 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,959 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,961 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,963 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 21:57:49,966 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 21:57:49,966 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 21:57:49,966 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 21:57:49,966 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (1/1) ... [2025-03-13 21:57:49,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 21:57:49,981 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 21:57:49,991 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-03-13 21:57:49,994 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-03-13 21:57:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure funcA [2025-03-13 21:57:50,011 INFO L138 BoogieDeclarations]: Found implementation of procedure funcA [2025-03-13 21:57:50,011 INFO L130 BoogieDeclarations]: Found specification of procedure funcB [2025-03-13 21:57:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure funcB [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 21:57:50,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 21:57:50,012 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 21:57:50,013 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 21:57:50,109 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 21:57:50,111 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 21:57:50,390 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297: havoc main_~#tPool~0#1.base, main_~#tPool~0#1.offset; [2025-03-13 21:57:50,391 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1297-1: SUMMARY for call ULTIMATE.dealloc(main_~#tPool~0#1.base, main_~#tPool~0#1.offset); srcloc: null [2025-03-13 21:57:50,391 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298: havoc main_~#rPool~0#1.base, main_~#rPool~0#1.offset; [2025-03-13 21:57:50,391 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1298-1: SUMMARY for call ULTIMATE.dealloc(main_~#rPool~0#1.base, main_~#rPool~0#1.offset); srcloc: null [2025-03-13 21:57:50,440 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 21:57:50,440 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 21:57:50,440 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 21:57:50,475 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 21:57:50,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:50 BoogieIcfgContainer [2025-03-13 21:57:50,475 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 21:57:50,476 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 21:57:50,477 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 21:57:50,481 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 21:57:50,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 09:57:49" (1/3) ... [2025-03-13 21:57:50,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1696a808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:50, skipping insertion in model container [2025-03-13 21:57:50,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 09:57:49" (2/3) ... [2025-03-13 21:57:50,481 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1696a808 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 09:57:50, skipping insertion in model container [2025-03-13 21:57:50,481 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 09:57:50" (3/3) ... [2025-03-13 21:57:50,482 INFO L128 eAbstractionObserver]: Analyzing ICFG twostage_3-race.i [2025-03-13 21:57:50,493 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 21:57:50,494 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG twostage_3-race.i that has 3 procedures, 335 locations, 1 initial locations, 4 loop locations, and 43 error locations. [2025-03-13 21:57:50,494 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 21:57:50,558 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-03-13 21:57:50,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 341 places, 357 transitions, 734 flow [2025-03-13 21:57:50,724 INFO L124 PetriNetUnfolderBase]: 43/670 cut-off events. [2025-03-13 21:57:50,726 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-13 21:57:50,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 687 conditions, 670 events. 43/670 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2893 event pairs, 0 based on Foata normal form. 0/544 useless extension candidates. Maximal degree in co-relation 354. Up to 8 conditions per place. [2025-03-13 21:57:50,735 INFO L82 GeneralOperation]: Start removeDead. Operand has 341 places, 357 transitions, 734 flow [2025-03-13 21:57:50,742 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 341 places, 357 transitions, 734 flow [2025-03-13 21:57:50,750 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:57:50,757 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@675f27f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:57:50,757 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2025-03-13 21:57:50,762 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:57:50,762 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-13 21:57:50,762 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:57:50,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:50,763 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] [2025-03-13 21:57:50,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:50,768 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1845704969, now seen corresponding path program 1 times [2025-03-13 21:57:50,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:50,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063827011] [2025-03-13 21:57:50,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:50,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:50,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:57:50,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:57:50,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:50,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:50,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:50,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063827011] [2025-03-13 21:57:50,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063827011] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:50,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:50,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:50,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249761445] [2025-03-13 21:57:50,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:50,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:50,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:50,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:50,946 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:50,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-03-13 21:57:50,998 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 357 transitions, 734 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-03-13 21:57:50,998 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:50,998 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-03-13 21:57:51,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:51,279 INFO L124 PetriNetUnfolderBase]: 197/2060 cut-off events. [2025-03-13 21:57:51,279 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2025-03-13 21:57:51,290 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2444 conditions, 2060 events. 197/2060 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 15302 event pairs, 166 based on Foata normal form. 186/1888 useless extension candidates. Maximal degree in co-relation 1786. Up to 338 conditions per place. [2025-03-13 21:57:51,299 INFO L140 encePairwiseOnDemand]: 338/357 looper letters, 23 selfloop transitions, 1 changer transitions 8/337 dead transitions. [2025-03-13 21:57:51,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 337 places, 337 transitions, 742 flow [2025-03-13 21:57:51,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 984 transitions. [2025-03-13 21:57:51,316 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9187675070028011 [2025-03-13 21:57:51,317 INFO L175 Difference]: Start difference. First operand has 341 places, 357 transitions, 734 flow. Second operand 3 states and 984 transitions. [2025-03-13 21:57:51,319 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 337 places, 337 transitions, 742 flow [2025-03-13 21:57:51,324 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 337 transitions, 742 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:51,329 INFO L231 Difference]: Finished difference. Result has 337 places, 329 transitions, 680 flow [2025-03-13 21:57:51,331 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=694, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=336, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=680, PETRI_PLACES=337, PETRI_TRANSITIONS=329} [2025-03-13 21:57:51,333 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -4 predicate places. [2025-03-13 21:57:51,333 INFO L471 AbstractCegarLoop]: Abstraction has has 337 places, 329 transitions, 680 flow [2025-03-13 21:57:51,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-03-13 21:57:51,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:51,334 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:51,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 21:57:51,334 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:51,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:51,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1382349041, now seen corresponding path program 1 times [2025-03-13 21:57:51,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:51,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234872216] [2025-03-13 21:57:51,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:51,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:51,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:57:51,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:57:51,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:51,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:51,399 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:51,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:51,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234872216] [2025-03-13 21:57:51,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234872216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:51,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:51,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:51,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257321402] [2025-03-13 21:57:51,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:51,400 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:51,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:51,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:51,401 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:51,409 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-03-13 21:57:51,410 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 337 places, 329 transitions, 680 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-03-13 21:57:51,410 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:51,410 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-03-13 21:57:51,410 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:51,703 INFO L124 PetriNetUnfolderBase]: 120/2428 cut-off events. [2025-03-13 21:57:51,704 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-03-13 21:57:51,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2743 conditions, 2428 events. 120/2428 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 18332 event pairs, 84 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 1341. Up to 113 conditions per place. [2025-03-13 21:57:51,724 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/343 dead transitions. [2025-03-13 21:57:51,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 343 transitions, 790 flow [2025-03-13 21:57:51,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:51,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:51,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-03-13 21:57:51,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-03-13 21:57:51,728 INFO L175 Difference]: Start difference. First operand has 337 places, 329 transitions, 680 flow. Second operand 3 states and 1005 transitions. [2025-03-13 21:57:51,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 343 transitions, 790 flow [2025-03-13 21:57:51,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 343 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:51,736 INFO L231 Difference]: Finished difference. Result has 329 places, 328 transitions, 679 flow [2025-03-13 21:57:51,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=677, PETRI_DIFFERENCE_MINUEND_PLACES=327, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=328, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=327, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=679, PETRI_PLACES=329, PETRI_TRANSITIONS=328} [2025-03-13 21:57:51,738 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -12 predicate places. [2025-03-13 21:57:51,738 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 328 transitions, 679 flow [2025-03-13 21:57:51,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-03-13 21:57:51,739 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:51,739 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] [2025-03-13 21:57:51,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 21:57:51,740 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:51,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:51,742 INFO L85 PathProgramCache]: Analyzing trace with hash -96722911, now seen corresponding path program 1 times [2025-03-13 21:57:51,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:51,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1177937208] [2025-03-13 21:57:51,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:51,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:51,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:57:51,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:57:51,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:51,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:51,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:51,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:51,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1177937208] [2025-03-13 21:57:51,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1177937208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:51,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:51,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:51,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571182175] [2025-03-13 21:57:51,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:51,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:51,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:51,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:51,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:51,807 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 357 [2025-03-13 21:57:51,808 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 328 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-03-13 21:57:51,808 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:51,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 357 [2025-03-13 21:57:51,808 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:52,198 INFO L124 PetriNetUnfolderBase]: 544/3303 cut-off events. [2025-03-13 21:57:52,199 INFO L125 PetriNetUnfolderBase]: For 266/326 co-relation queries the response was YES. [2025-03-13 21:57:52,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4410 conditions, 3303 events. 544/3303 cut-off events. For 266/326 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 27143 event pairs, 116 based on Foata normal form. 5/2913 useless extension candidates. Maximal degree in co-relation 2202. Up to 785 conditions per place. [2025-03-13 21:57:52,219 INFO L140 encePairwiseOnDemand]: 341/357 looper letters, 33 selfloop transitions, 5 changer transitions 11/335 dead transitions. [2025-03-13 21:57:52,219 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 335 transitions, 785 flow [2025-03-13 21:57:52,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:52,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:52,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 960 transitions. [2025-03-13 21:57:52,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.896358543417367 [2025-03-13 21:57:52,221 INFO L175 Difference]: Start difference. First operand has 329 places, 328 transitions, 679 flow. Second operand 3 states and 960 transitions. [2025-03-13 21:57:52,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 335 transitions, 785 flow [2025-03-13 21:57:52,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 335 transitions, 784 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:52,226 INFO L231 Difference]: Finished difference. Result has 323 places, 313 transitions, 667 flow [2025-03-13 21:57:52,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=662, PETRI_DIFFERENCE_MINUEND_PLACES=320, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=667, PETRI_PLACES=323, PETRI_TRANSITIONS=313} [2025-03-13 21:57:52,227 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -18 predicate places. [2025-03-13 21:57:52,227 INFO L471 AbstractCegarLoop]: Abstraction has has 323 places, 313 transitions, 667 flow [2025-03-13 21:57:52,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 303.6666666666667) internal successors, (911), 3 states have internal predecessors, (911), 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-03-13 21:57:52,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:52,228 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] [2025-03-13 21:57:52,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 21:57:52,228 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:52,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:52,228 INFO L85 PathProgramCache]: Analyzing trace with hash -646479791, now seen corresponding path program 1 times [2025-03-13 21:57:52,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:52,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [450252121] [2025-03-13 21:57:52,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:52,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:52,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-13 21:57:52,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-13 21:57:52,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:52,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:52,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:52,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:52,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [450252121] [2025-03-13 21:57:52,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [450252121] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:52,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:52,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:52,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465662280] [2025-03-13 21:57:52,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:52,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:52,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:52,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:52,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-03-13 21:57:52,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 323 places, 313 transitions, 667 flow. Second operand has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-03-13 21:57:52,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:52,277 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-03-13 21:57:52,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:52,653 INFO L124 PetriNetUnfolderBase]: 644/5442 cut-off events. [2025-03-13 21:57:52,653 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-13 21:57:52,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6763 conditions, 5442 events. 644/5442 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 52979 event pairs, 548 based on Foata normal form. 0/4586 useless extension candidates. Maximal degree in co-relation 6140. Up to 1038 conditions per place. [2025-03-13 21:57:52,685 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-03-13 21:57:52,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 711 flow [2025-03-13 21:57:52,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:52,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:52,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-03-13 21:57:52,687 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9066293183940243 [2025-03-13 21:57:52,687 INFO L175 Difference]: Start difference. First operand has 323 places, 313 transitions, 667 flow. Second operand 3 states and 971 transitions. [2025-03-13 21:57:52,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 711 flow [2025-03-13 21:57:52,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 310 transitions, 711 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:52,692 INFO L231 Difference]: Finished difference. Result has 313 places, 310 transitions, 669 flow [2025-03-13 21:57:52,693 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=659, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=669, PETRI_PLACES=313, PETRI_TRANSITIONS=310} [2025-03-13 21:57:52,694 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-03-13 21:57:52,694 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 310 transitions, 669 flow [2025-03-13 21:57:52,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 314.6666666666667) internal successors, (944), 3 states have internal predecessors, (944), 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-03-13 21:57:52,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:52,695 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] [2025-03-13 21:57:52,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 21:57:52,695 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:52,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:52,696 INFO L85 PathProgramCache]: Analyzing trace with hash -2123121846, now seen corresponding path program 1 times [2025-03-13 21:57:52,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:52,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797368771] [2025-03-13 21:57:52,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:52,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:52,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-13 21:57:52,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-13 21:57:52,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:52,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:52,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:52,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:52,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797368771] [2025-03-13 21:57:52,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797368771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:52,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:52,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:52,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406319261] [2025-03-13 21:57:52,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:52,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:52,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:52,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:52,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:52,767 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-03-13 21:57:52,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 310 transitions, 669 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-03-13 21:57:52,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:52,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-03-13 21:57:52,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:53,117 INFO L124 PetriNetUnfolderBase]: 396/3957 cut-off events. [2025-03-13 21:57:53,119 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-13 21:57:53,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4869 conditions, 3957 events. 396/3957 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 36246 event pairs, 324 based on Foata normal form. 0/3350 useless extension candidates. Maximal degree in co-relation 4413. Up to 666 conditions per place. [2025-03-13 21:57:53,154 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-03-13 21:57:53,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 314 places, 309 transitions, 717 flow [2025-03-13 21:57:53,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:53,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:53,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-03-13 21:57:53,156 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-03-13 21:57:53,157 INFO L175 Difference]: Start difference. First operand has 313 places, 310 transitions, 669 flow. Second operand 3 states and 974 transitions. [2025-03-13 21:57:53,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 314 places, 309 transitions, 717 flow [2025-03-13 21:57:53,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 314 places, 309 transitions, 717 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:57:53,161 INFO L231 Difference]: Finished difference. Result has 314 places, 309 transitions, 671 flow [2025-03-13 21:57:53,161 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=667, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=671, PETRI_PLACES=314, PETRI_TRANSITIONS=309} [2025-03-13 21:57:53,162 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -27 predicate places. [2025-03-13 21:57:53,162 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 309 transitions, 671 flow [2025-03-13 21:57:53,162 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-03-13 21:57:53,162 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:53,162 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] [2025-03-13 21:57:53,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 21:57:53,163 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:53,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:53,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1442831950, now seen corresponding path program 1 times [2025-03-13 21:57:53,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:53,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295120722] [2025-03-13 21:57:53,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:53,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:53,169 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-13 21:57:53,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-13 21:57:53,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:53,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:53,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295120722] [2025-03-13 21:57:53,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295120722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:53,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:53,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 21:57:53,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159581927] [2025-03-13 21:57:53,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:53,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:53,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:53,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:53,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:53,229 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-03-13 21:57:53,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 309 transitions, 671 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-03-13 21:57:53,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:53,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-03-13 21:57:53,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:53,497 INFO L124 PetriNetUnfolderBase]: 260/3163 cut-off events. [2025-03-13 21:57:53,497 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-03-13 21:57:53,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3830 conditions, 3163 events. 260/3163 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 27469 event pairs, 200 based on Foata normal form. 2/2672 useless extension candidates. Maximal degree in co-relation 3465. Up to 444 conditions per place. [2025-03-13 21:57:53,520 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 22 selfloop transitions, 0 changer transitions 1/308 dead transitions. [2025-03-13 21:57:53,521 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 308 transitions, 712 flow [2025-03-13 21:57:53,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:53,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-03-13 21:57:53,523 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9103641456582633 [2025-03-13 21:57:53,523 INFO L175 Difference]: Start difference. First operand has 314 places, 309 transitions, 671 flow. Second operand 3 states and 975 transitions. [2025-03-13 21:57:53,523 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 308 transitions, 712 flow [2025-03-13 21:57:53,525 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 308 transitions, 704 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-03-13 21:57:53,528 INFO L231 Difference]: Finished difference. Result has 313 places, 307 transitions, 658 flow [2025-03-13 21:57:53,529 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=658, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=658, PETRI_PLACES=313, PETRI_TRANSITIONS=307} [2025-03-13 21:57:53,531 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -28 predicate places. [2025-03-13 21:57:53,531 INFO L471 AbstractCegarLoop]: Abstraction has has 313 places, 307 transitions, 658 flow [2025-03-13 21:57:53,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-03-13 21:57:53,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:53,532 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:53,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 21:57:53,532 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:53,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:53,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1115049641, now seen corresponding path program 1 times [2025-03-13 21:57:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-03-13 21:57:53,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:53,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:53,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:57:53,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:57:53,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:53,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:53,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:53,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:53,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209534860] [2025-03-13 21:57:53,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209534860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:53,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:53,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:53,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943223770] [2025-03-13 21:57:53,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:53,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:53,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:53,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:53,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:53,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 357 [2025-03-13 21:57:53,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 313 places, 307 transitions, 658 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-03-13 21:57:53,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:53,598 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 357 [2025-03-13 21:57:53,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:53,815 INFO L124 PetriNetUnfolderBase]: 122/2376 cut-off events. [2025-03-13 21:57:53,816 INFO L125 PetriNetUnfolderBase]: For 242/302 co-relation queries the response was YES. [2025-03-13 21:57:53,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2794 conditions, 2376 events. 122/2376 cut-off events. For 242/302 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 17798 event pairs, 84 based on Foata normal form. 0/2064 useless extension candidates. Maximal degree in co-relation 2787. Up to 113 conditions per place. [2025-03-13 21:57:53,832 INFO L140 encePairwiseOnDemand]: 355/357 looper letters, 31 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2025-03-13 21:57:53,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 321 transitions, 768 flow [2025-03-13 21:57:53,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:53,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:53,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1005 transitions. [2025-03-13 21:57:53,834 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.938375350140056 [2025-03-13 21:57:53,834 INFO L175 Difference]: Start difference. First operand has 313 places, 307 transitions, 658 flow. Second operand 3 states and 1005 transitions. [2025-03-13 21:57:53,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 321 transitions, 768 flow [2025-03-13 21:57:53,836 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 321 transitions, 766 flow, removed 1 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:53,838 INFO L231 Difference]: Finished difference. Result has 312 places, 306 transitions, 656 flow [2025-03-13 21:57:53,838 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=306, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=656, PETRI_PLACES=312, PETRI_TRANSITIONS=306} [2025-03-13 21:57:53,839 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-13 21:57:53,839 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 306 transitions, 656 flow [2025-03-13 21:57:53,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-03-13 21:57:53,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:53,840 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:53,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 21:57:53,840 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:53,840 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:53,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1731541226, now seen corresponding path program 1 times [2025-03-13 21:57:53,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:53,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690398760] [2025-03-13 21:57:53,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:53,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:53,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 21:57:53,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 21:57:53,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:53,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:53,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:53,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:53,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690398760] [2025-03-13 21:57:53,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690398760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:53,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:53,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:53,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722791612] [2025-03-13 21:57:53,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:53,866 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:53,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:53,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:53,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:53,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 357 [2025-03-13 21:57:53,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 306 transitions, 656 flow. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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-03-13 21:57:53,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:53,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 357 [2025-03-13 21:57:53,896 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:54,237 INFO L124 PetriNetUnfolderBase]: 488/4220 cut-off events. [2025-03-13 21:57:54,237 INFO L125 PetriNetUnfolderBase]: For 390/534 co-relation queries the response was YES. [2025-03-13 21:57:54,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5330 conditions, 4220 events. 488/4220 cut-off events. For 390/534 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 39948 event pairs, 412 based on Foata normal form. 0/3506 useless extension candidates. Maximal degree in co-relation 5323. Up to 830 conditions per place. [2025-03-13 21:57:54,263 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 25 selfloop transitions, 2 changer transitions 0/305 dead transitions. [2025-03-13 21:57:54,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 305 transitions, 708 flow [2025-03-13 21:57:54,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:54,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:54,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 970 transitions. [2025-03-13 21:57:54,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9056956115779645 [2025-03-13 21:57:54,266 INFO L175 Difference]: Start difference. First operand has 312 places, 306 transitions, 656 flow. Second operand 3 states and 970 transitions. [2025-03-13 21:57:54,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 305 transitions, 708 flow [2025-03-13 21:57:54,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 305 transitions, 707 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:54,272 INFO L231 Difference]: Finished difference. Result has 312 places, 305 transitions, 657 flow [2025-03-13 21:57:54,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=653, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=657, PETRI_PLACES=312, PETRI_TRANSITIONS=305} [2025-03-13 21:57:54,273 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -29 predicate places. [2025-03-13 21:57:54,273 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 305 transitions, 657 flow [2025-03-13 21:57:54,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 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-03-13 21:57:54,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:54,275 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] [2025-03-13 21:57:54,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 21:57:54,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:54,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 190578519, now seen corresponding path program 1 times [2025-03-13 21:57:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:54,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541403915] [2025-03-13 21:57:54,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:54,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-13 21:57:54,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-13 21:57:54,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:54,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:54,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:54,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:54,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541403915] [2025-03-13 21:57:54,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541403915] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:54,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:54,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:54,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192384782] [2025-03-13 21:57:54,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:54,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:54,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:54,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:54,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:54,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 316 out of 357 [2025-03-13 21:57:54,330 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 305 transitions, 657 flow. Second operand has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-03-13 21:57:54,330 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:54,331 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 316 of 357 [2025-03-13 21:57:54,331 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:54,751 INFO L124 PetriNetUnfolderBase]: 514/4563 cut-off events. [2025-03-13 21:57:54,751 INFO L125 PetriNetUnfolderBase]: For 176/176 co-relation queries the response was YES. [2025-03-13 21:57:54,767 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5667 conditions, 4563 events. 514/4563 cut-off events. For 176/176 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 43432 event pairs, 432 based on Foata normal form. 0/3846 useless extension candidates. Maximal degree in co-relation 5660. Up to 836 conditions per place. [2025-03-13 21:57:54,777 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 23 selfloop transitions, 2 changer transitions 0/304 dead transitions. [2025-03-13 21:57:54,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 313 places, 304 transitions, 705 flow [2025-03-13 21:57:54,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:54,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:54,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 974 transitions. [2025-03-13 21:57:54,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9094304388422035 [2025-03-13 21:57:54,779 INFO L175 Difference]: Start difference. First operand has 312 places, 305 transitions, 657 flow. Second operand 3 states and 974 transitions. [2025-03-13 21:57:54,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 313 places, 304 transitions, 705 flow [2025-03-13 21:57:54,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 304 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:54,783 INFO L231 Difference]: Finished difference. Result has 311 places, 304 transitions, 655 flow [2025-03-13 21:57:54,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=651, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=304, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=655, PETRI_PLACES=311, PETRI_TRANSITIONS=304} [2025-03-13 21:57:54,783 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -30 predicate places. [2025-03-13 21:57:54,783 INFO L471 AbstractCegarLoop]: Abstraction has has 311 places, 304 transitions, 655 flow [2025-03-13 21:57:54,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 317.3333333333333) internal successors, (952), 3 states have internal predecessors, (952), 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-03-13 21:57:54,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:54,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:54,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 21:57:54,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:54,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:54,784 INFO L85 PathProgramCache]: Analyzing trace with hash -136799155, now seen corresponding path program 1 times [2025-03-13 21:57:54,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:54,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529647716] [2025-03-13 21:57:54,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:54,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:54,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-03-13 21:57:54,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-03-13 21:57:54,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:54,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:54,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:54,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:54,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529647716] [2025-03-13 21:57:54,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529647716] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:54,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:54,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:54,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610569781] [2025-03-13 21:57:54,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:54,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:54,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:54,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:54,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:54,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 315 out of 357 [2025-03-13 21:57:54,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 311 places, 304 transitions, 655 flow. Second operand has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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-03-13 21:57:54,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:54,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 315 of 357 [2025-03-13 21:57:54,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:55,120 INFO L124 PetriNetUnfolderBase]: 440/3867 cut-off events. [2025-03-13 21:57:55,121 INFO L125 PetriNetUnfolderBase]: For 310/386 co-relation queries the response was YES. [2025-03-13 21:57:55,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4885 conditions, 3867 events. 440/3867 cut-off events. For 310/386 co-relation queries the response was YES. Maximal size of possible extension queue 131. Compared 35933 event pairs, 368 based on Foata normal form. 0/3282 useless extension candidates. Maximal degree in co-relation 4878. Up to 748 conditions per place. [2025-03-13 21:57:55,143 INFO L140 encePairwiseOnDemand]: 354/357 looper letters, 24 selfloop transitions, 2 changer transitions 0/303 dead transitions. [2025-03-13 21:57:55,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 303 transitions, 705 flow [2025-03-13 21:57:55,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:55,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 972 transitions. [2025-03-13 21:57:55,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.907563025210084 [2025-03-13 21:57:55,148 INFO L175 Difference]: Start difference. First operand has 311 places, 304 transitions, 655 flow. Second operand 3 states and 972 transitions. [2025-03-13 21:57:55,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 303 transitions, 705 flow [2025-03-13 21:57:55,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 303 transitions, 701 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:55,151 INFO L231 Difference]: Finished difference. Result has 310 places, 303 transitions, 653 flow [2025-03-13 21:57:55,152 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=649, PETRI_DIFFERENCE_MINUEND_PLACES=308, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=653, PETRI_PLACES=310, PETRI_TRANSITIONS=303} [2025-03-13 21:57:55,152 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -31 predicate places. [2025-03-13 21:57:55,152 INFO L471 AbstractCegarLoop]: Abstraction has has 310 places, 303 transitions, 653 flow [2025-03-13 21:57:55,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 316.3333333333333) internal successors, (949), 3 states have internal predecessors, (949), 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-03-13 21:57:55,153 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:55,153 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] [2025-03-13 21:57:55,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 21:57:55,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:55,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash -408041453, now seen corresponding path program 1 times [2025-03-13 21:57:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:55,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254209888] [2025-03-13 21:57:55,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:55,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:55,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-03-13 21:57:55,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-03-13 21:57:55,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:55,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:55,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:55,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254209888] [2025-03-13 21:57:55,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254209888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:55,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:55,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:55,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736191451] [2025-03-13 21:57:55,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:55,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:55,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:55,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:55,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:55,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 308 out of 357 [2025-03-13 21:57:55,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 310 places, 303 transitions, 653 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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-03-13 21:57:55,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:55,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 308 of 357 [2025-03-13 21:57:55,202 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:55,502 INFO L124 PetriNetUnfolderBase]: 362/4085 cut-off events. [2025-03-13 21:57:55,502 INFO L125 PetriNetUnfolderBase]: For 594/1586 co-relation queries the response was YES. [2025-03-13 21:57:55,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5110 conditions, 4085 events. 362/4085 cut-off events. For 594/1586 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 37717 event pairs, 268 based on Foata normal form. 0/3580 useless extension candidates. Maximal degree in co-relation 5103. Up to 630 conditions per place. [2025-03-13 21:57:55,524 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 27 selfloop transitions, 1 changer transitions 0/297 dead transitions. [2025-03-13 21:57:55,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 297 transitions, 697 flow [2025-03-13 21:57:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:55,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 958 transitions. [2025-03-13 21:57:55,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8944911297852475 [2025-03-13 21:57:55,526 INFO L175 Difference]: Start difference. First operand has 310 places, 303 transitions, 653 flow. Second operand 3 states and 958 transitions. [2025-03-13 21:57:55,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 297 transitions, 697 flow [2025-03-13 21:57:55,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 297 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:55,530 INFO L231 Difference]: Finished difference. Result has 304 places, 297 transitions, 639 flow [2025-03-13 21:57:55,530 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=637, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=297, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=296, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=639, PETRI_PLACES=304, PETRI_TRANSITIONS=297} [2025-03-13 21:57:55,531 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -37 predicate places. [2025-03-13 21:57:55,531 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 297 transitions, 639 flow [2025-03-13 21:57:55,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 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-03-13 21:57:55,531 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:55,531 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 21:57:55,532 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1714253471, now seen corresponding path program 1 times [2025-03-13 21:57:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388977442] [2025-03-13 21:57:55,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:55,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-13 21:57:55,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-13 21:57:55,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:55,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:55,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:55,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:55,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388977442] [2025-03-13 21:57:55,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388977442] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:55,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:55,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:55,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646091496] [2025-03-13 21:57:55,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:55,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:55,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:55,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:55,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:55,584 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 311 out of 357 [2025-03-13 21:57:55,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 297 transitions, 639 flow. Second operand has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-03-13 21:57:55,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:55,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 311 of 357 [2025-03-13 21:57:55,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:55,810 INFO L124 PetriNetUnfolderBase]: 322/3123 cut-off events. [2025-03-13 21:57:55,810 INFO L125 PetriNetUnfolderBase]: For 494/594 co-relation queries the response was YES. [2025-03-13 21:57:55,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 3123 events. 322/3123 cut-off events. For 494/594 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 25919 event pairs, 228 based on Foata normal form. 0/2820 useless extension candidates. Maximal degree in co-relation 4059. Up to 574 conditions per place. [2025-03-13 21:57:55,825 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 25 selfloop transitions, 1 changer transitions 0/292 dead transitions. [2025-03-13 21:57:55,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 292 transitions, 681 flow [2025-03-13 21:57:55,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:55,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 964 transitions. [2025-03-13 21:57:55,827 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.900093370681606 [2025-03-13 21:57:55,827 INFO L175 Difference]: Start difference. First operand has 304 places, 297 transitions, 639 flow. Second operand 3 states and 964 transitions. [2025-03-13 21:57:55,827 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 292 transitions, 681 flow [2025-03-13 21:57:55,828 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 292 transitions, 680 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:55,830 INFO L231 Difference]: Finished difference. Result has 300 places, 292 transitions, 630 flow [2025-03-13 21:57:55,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=292, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=300, PETRI_TRANSITIONS=292} [2025-03-13 21:57:55,831 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -41 predicate places. [2025-03-13 21:57:55,831 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 292 transitions, 630 flow [2025-03-13 21:57:55,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 312.0) internal successors, (936), 3 states have internal predecessors, (936), 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-03-13 21:57:55,831 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:55,832 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:55,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 21:57:55,832 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:55,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:55,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1441613829, now seen corresponding path program 1 times [2025-03-13 21:57:55,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:55,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033298923] [2025-03-13 21:57:55,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:55,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:55,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 71 statements into 1 equivalence classes. [2025-03-13 21:57:55,857 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 71 of 71 statements. [2025-03-13 21:57:55,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:55,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:56,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:56,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:56,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033298923] [2025-03-13 21:57:56,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033298923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:56,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:56,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 21:57:56,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626936309] [2025-03-13 21:57:56,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:56,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 21:57:56,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:56,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 21:57:56,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 21:57:56,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 357 [2025-03-13 21:57:56,357 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 292 transitions, 630 flow. Second operand has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-03-13 21:57:56,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:56,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 357 [2025-03-13 21:57:56,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:57,531 INFO L124 PetriNetUnfolderBase]: 2566/14629 cut-off events. [2025-03-13 21:57:57,532 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2025-03-13 21:57:57,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19408 conditions, 14629 events. 2566/14629 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 339. Compared 177724 event pairs, 1956 based on Foata normal form. 0/13230 useless extension candidates. Maximal degree in co-relation 19401. Up to 3973 conditions per place. [2025-03-13 21:57:57,604 INFO L140 encePairwiseOnDemand]: 350/357 looper letters, 59 selfloop transitions, 6 changer transitions 0/307 dead transitions. [2025-03-13 21:57:57,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 307 transitions, 790 flow [2025-03-13 21:57:57,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 21:57:57,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 21:57:57,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1818 transitions. [2025-03-13 21:57:57,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8487394957983193 [2025-03-13 21:57:57,607 INFO L175 Difference]: Start difference. First operand has 300 places, 292 transitions, 630 flow. Second operand 6 states and 1818 transitions. [2025-03-13 21:57:57,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 307 transitions, 790 flow [2025-03-13 21:57:57,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 307 transitions, 789 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:57,612 INFO L231 Difference]: Finished difference. Result has 303 places, 291 transitions, 639 flow [2025-03-13 21:57:57,612 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=639, PETRI_PLACES=303, PETRI_TRANSITIONS=291} [2025-03-13 21:57:57,613 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-03-13 21:57:57,613 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 291 transitions, 639 flow [2025-03-13 21:57:57,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 293.6666666666667) internal successors, (1762), 6 states have internal predecessors, (1762), 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-03-13 21:57:57,613 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:57,614 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:57,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 21:57:57,614 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:57,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:57,614 INFO L85 PathProgramCache]: Analyzing trace with hash -1929711213, now seen corresponding path program 1 times [2025-03-13 21:57:57,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:57,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594372542] [2025-03-13 21:57:57,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:57,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:57,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-03-13 21:57:57,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-03-13 21:57:57,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:57,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:57,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:57,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:57,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594372542] [2025-03-13 21:57:57,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594372542] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:57,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:57,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 21:57:57,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030205676] [2025-03-13 21:57:57,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:57,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 21:57:57,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:57,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 21:57:57,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-13 21:57:57,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 357 [2025-03-13 21:57:57,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 291 transitions, 639 flow. Second operand has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 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-03-13 21:57:57,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:57,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 357 [2025-03-13 21:57:57,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:58,277 INFO L124 PetriNetUnfolderBase]: 610/4941 cut-off events. [2025-03-13 21:57:58,277 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2025-03-13 21:57:58,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6270 conditions, 4941 events. 610/4941 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 47207 event pairs, 437 based on Foata normal form. 36/4498 useless extension candidates. Maximal degree in co-relation 6263. Up to 673 conditions per place. [2025-03-13 21:57:58,295 INFO L140 encePairwiseOnDemand]: 344/357 looper letters, 58 selfloop transitions, 11 changer transitions 1/331 dead transitions. [2025-03-13 21:57:58,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 331 transitions, 883 flow [2025-03-13 21:57:58,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-13 21:57:58,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-03-13 21:57:58,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1320 transitions. [2025-03-13 21:57:58,296 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9243697478991597 [2025-03-13 21:57:58,297 INFO L175 Difference]: Start difference. First operand has 303 places, 291 transitions, 639 flow. Second operand 4 states and 1320 transitions. [2025-03-13 21:57:58,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 331 transitions, 883 flow [2025-03-13 21:57:58,298 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 301 places, 331 transitions, 871 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 21:57:58,300 INFO L231 Difference]: Finished difference. Result has 303 places, 300 transitions, 709 flow [2025-03-13 21:57:58,300 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=627, PETRI_DIFFERENCE_MINUEND_PLACES=298, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=291, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=280, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=709, PETRI_PLACES=303, PETRI_TRANSITIONS=300} [2025-03-13 21:57:58,301 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -38 predicate places. [2025-03-13 21:57:58,301 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 300 transitions, 709 flow [2025-03-13 21:57:58,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 313.5) internal successors, (1254), 4 states have internal predecessors, (1254), 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-03-13 21:57:58,301 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:58,301 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:58,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 21:57:58,302 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting funcAErr5ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:58,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:58,302 INFO L85 PathProgramCache]: Analyzing trace with hash -1451682649, now seen corresponding path program 1 times [2025-03-13 21:57:58,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:58,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320639424] [2025-03-13 21:57:58,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:58,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:58,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 81 statements into 1 equivalence classes. [2025-03-13 21:57:58,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 81 of 81 statements. [2025-03-13 21:57:58,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:58,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:58,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:58,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:58,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320639424] [2025-03-13 21:57:58,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320639424] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:58,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:58,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:58,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166592981] [2025-03-13 21:57:58,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:58,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:58,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:58,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:58,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:58,355 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 357 [2025-03-13 21:57:58,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 300 transitions, 709 flow. Second operand has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-03-13 21:57:58,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:58,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 357 [2025-03-13 21:57:58,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:58,596 INFO L124 PetriNetUnfolderBase]: 268/2934 cut-off events. [2025-03-13 21:57:58,596 INFO L125 PetriNetUnfolderBase]: For 414/669 co-relation queries the response was YES. [2025-03-13 21:57:58,608 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3897 conditions, 2934 events. 268/2934 cut-off events. For 414/669 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 24340 event pairs, 166 based on Foata normal form. 0/2662 useless extension candidates. Maximal degree in co-relation 3888. Up to 443 conditions per place. [2025-03-13 21:57:58,615 INFO L140 encePairwiseOnDemand]: 351/357 looper letters, 30 selfloop transitions, 5 changer transitions 0/312 dead transitions. [2025-03-13 21:57:58,615 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 312 transitions, 812 flow [2025-03-13 21:57:58,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:58,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:58,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-03-13 21:57:58,616 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.927170868347339 [2025-03-13 21:57:58,616 INFO L175 Difference]: Start difference. First operand has 303 places, 300 transitions, 709 flow. Second operand 3 states and 993 transitions. [2025-03-13 21:57:58,616 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 312 transitions, 812 flow [2025-03-13 21:57:58,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 312 transitions, 810 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:57:58,621 INFO L231 Difference]: Finished difference. Result has 306 places, 304 transitions, 745 flow [2025-03-13 21:57:58,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=707, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=300, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=745, PETRI_PLACES=306, PETRI_TRANSITIONS=304} [2025-03-13 21:57:58,621 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -35 predicate places. [2025-03-13 21:57:58,621 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 304 transitions, 745 flow [2025-03-13 21:57:58,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.6666666666667) internal successors, (962), 3 states have internal predecessors, (962), 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-03-13 21:57:58,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:58,622 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:58,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 21:57:58,622 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting funcAErr2ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:58,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:58,622 INFO L85 PathProgramCache]: Analyzing trace with hash 784468534, now seen corresponding path program 1 times [2025-03-13 21:57:58,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:58,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756951073] [2025-03-13 21:57:58,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:58,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:58,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 21:57:58,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 21:57:58,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:58,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:58,658 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:58,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:58,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756951073] [2025-03-13 21:57:58,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756951073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:58,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:58,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:58,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128149700] [2025-03-13 21:57:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:58,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:58,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:58,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:58,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:58,669 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 357 [2025-03-13 21:57:58,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 304 transitions, 745 flow. Second operand has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-03-13 21:57:58,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:58,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 357 [2025-03-13 21:57:58,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:57:59,083 INFO L124 PetriNetUnfolderBase]: 355/4187 cut-off events. [2025-03-13 21:57:59,083 INFO L125 PetriNetUnfolderBase]: For 684/1252 co-relation queries the response was YES. [2025-03-13 21:57:59,099 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5686 conditions, 4187 events. 355/4187 cut-off events. For 684/1252 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 40636 event pairs, 93 based on Foata normal form. 2/3860 useless extension candidates. Maximal degree in co-relation 5676. Up to 507 conditions per place. [2025-03-13 21:57:59,106 INFO L140 encePairwiseOnDemand]: 348/357 looper letters, 36 selfloop transitions, 8 changer transitions 0/321 dead transitions. [2025-03-13 21:57:59,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 321 transitions, 888 flow [2025-03-13 21:57:59,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:57:59,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:57:59,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 995 transitions. [2025-03-13 21:57:59,107 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9290382819794585 [2025-03-13 21:57:59,108 INFO L175 Difference]: Start difference. First operand has 306 places, 304 transitions, 745 flow. Second operand 3 states and 995 transitions. [2025-03-13 21:57:59,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 321 transitions, 888 flow [2025-03-13 21:57:59,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 321 transitions, 874 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 21:57:59,112 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 805 flow [2025-03-13 21:57:59,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=357, PETRI_DIFFERENCE_MINUEND_FLOW=733, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=295, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=805, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2025-03-13 21:57:59,112 INFO L279 CegarLoopForPetriNet]: 341 programPoint places, -34 predicate places. [2025-03-13 21:57:59,112 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 805 flow [2025-03-13 21:57:59,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 319.3333333333333) internal successors, (958), 3 states have internal predecessors, (958), 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-03-13 21:57:59,113 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:59,113 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 21:57:59,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 21:57:59,113 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 57 more)] === [2025-03-13 21:57:59,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:59,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2066345107, now seen corresponding path program 1 times [2025-03-13 21:57:59,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:59,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146577058] [2025-03-13 21:57:59,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:59,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:59,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-13 21:57:59,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-13 21:57:59,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:59,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:57:59,132 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 21:57:59,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-13 21:57:59,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-13 21:57:59,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:59,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 21:57:59,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 21:57:59,165 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 21:57:59,166 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (60 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (59 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (58 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (57 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (56 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (55 of 61 remaining) [2025-03-13 21:57:59,167 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (54 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (53 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (52 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE (51 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE (50 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE (49 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE (48 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (47 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE (46 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE (45 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE (44 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE (43 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE (42 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE (41 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (40 of 61 remaining) [2025-03-13 21:57:59,168 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (39 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (38 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (37 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (36 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (35 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (34 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (32 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (30 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (29 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (28 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (27 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (25 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (24 of 61 remaining) [2025-03-13 21:57:59,169 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (23 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (22 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (21 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (20 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (19 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (18 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (17 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (16 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr6ASSERT_VIOLATIONDATA_RACE (15 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr5ASSERT_VIOLATIONDATA_RACE (14 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr4ASSERT_VIOLATIONDATA_RACE (13 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr3ASSERT_VIOLATIONDATA_RACE (12 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr2ASSERT_VIOLATIONDATA_RACE (11 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr1ASSERT_VIOLATIONDATA_RACE (10 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcAErr0ASSERT_VIOLATIONDATA_RACE (9 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr8ASSERT_VIOLATIONDATA_RACE (8 of 61 remaining) [2025-03-13 21:57:59,170 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr7ASSERT_VIOLATIONDATA_RACE (7 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr6ASSERT_VIOLATIONDATA_RACE (6 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr5ASSERT_VIOLATIONDATA_RACE (5 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr4ASSERT_VIOLATIONDATA_RACE (4 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr3ASSERT_VIOLATIONDATA_RACE (3 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr2ASSERT_VIOLATIONDATA_RACE (2 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr1ASSERT_VIOLATIONDATA_RACE (1 of 61 remaining) [2025-03-13 21:57:59,171 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location funcBErr0ASSERT_VIOLATIONDATA_RACE (0 of 61 remaining) [2025-03-13 21:57:59,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 21:57:59,171 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:57:59,173 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 21:57:59,173 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 21:57:59,202 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-03-13 21:57:59,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 439 places, 458 transitions, 960 flow [2025-03-13 21:57:59,394 INFO L124 PetriNetUnfolderBase]: 163/1958 cut-off events. [2025-03-13 21:57:59,395 INFO L125 PetriNetUnfolderBase]: For 72/74 co-relation queries the response was YES. [2025-03-13 21:57:59,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2047 conditions, 1958 events. 163/1958 cut-off events. For 72/74 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 12304 event pairs, 1 based on Foata normal form. 0/1599 useless extension candidates. Maximal degree in co-relation 1163. Up to 32 conditions per place. [2025-03-13 21:57:59,407 INFO L82 GeneralOperation]: Start removeDead. Operand has 439 places, 458 transitions, 960 flow [2025-03-13 21:57:59,414 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 439 places, 458 transitions, 960 flow [2025-03-13 21:57:59,415 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 21:57:59,415 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@675f27f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 21:57:59,415 INFO L334 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2025-03-13 21:57:59,416 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 21:57:59,416 INFO L124 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-03-13 21:57:59,416 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 21:57:59,416 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:57:59,417 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] [2025-03-13 21:57:59,417 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-13 21:57:59,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:57:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 932020433, now seen corresponding path program 1 times [2025-03-13 21:57:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:57:59,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36697781] [2025-03-13 21:57:59,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:57:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:57:59,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-03-13 21:57:59,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-03-13 21:57:59,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:57:59,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:57:59,428 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:57:59,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:57:59,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36697781] [2025-03-13 21:57:59,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36697781] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:57:59,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:57:59,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:57:59,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190233100] [2025-03-13 21:57:59,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:57:59,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:57:59,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:57:59,429 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:57:59,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:57:59,441 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 397 out of 458 [2025-03-13 21:57:59,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 458 transitions, 960 flow. Second operand has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-03-13 21:57:59,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:57:59,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 397 of 458 [2025-03-13 21:57:59,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:09,804 INFO L124 PetriNetUnfolderBase]: 18400/85864 cut-off events. [2025-03-13 21:58:09,805 INFO L125 PetriNetUnfolderBase]: For 7767/7767 co-relation queries the response was YES. [2025-03-13 21:58:10,448 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113081 conditions, 85864 events. 18400/85864 cut-off events. For 7767/7767 co-relation queries the response was YES. Maximal size of possible extension queue 1659. Compared 1311671 event pairs, 16524 based on Foata normal form. 9795/81880 useless extension candidates. Maximal degree in co-relation 87518. Up to 24187 conditions per place. [2025-03-13 21:58:11,042 INFO L140 encePairwiseOnDemand]: 437/458 looper letters, 38 selfloop transitions, 1 changer transitions 8/434 dead transitions. [2025-03-13 21:58:11,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 433 places, 434 transitions, 990 flow [2025-03-13 21:58:11,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:11,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:11,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1250 transitions. [2025-03-13 21:58:11,045 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9097525473071325 [2025-03-13 21:58:11,045 INFO L175 Difference]: Start difference. First operand has 439 places, 458 transitions, 960 flow. Second operand 3 states and 1250 transitions. [2025-03-13 21:58:11,045 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 433 places, 434 transitions, 990 flow [2025-03-13 21:58:11,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 433 places, 434 transitions, 990 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 21:58:11,062 INFO L231 Difference]: Finished difference. Result has 433 places, 426 transitions, 898 flow [2025-03-13 21:58:11,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=912, PETRI_DIFFERENCE_MINUEND_PLACES=431, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=898, PETRI_PLACES=433, PETRI_TRANSITIONS=426} [2025-03-13 21:58:11,063 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -6 predicate places. [2025-03-13 21:58:11,063 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 426 transitions, 898 flow [2025-03-13 21:58:11,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 397.6666666666667) internal successors, (1193), 3 states have internal predecessors, (1193), 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-03-13 21:58:11,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:11,063 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 21:58:11,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 21:58:11,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-13 21:58:11,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:11,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1172067343, now seen corresponding path program 1 times [2025-03-13 21:58:11,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:11,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829984156] [2025-03-13 21:58:11,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:11,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:11,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-13 21:58:11,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-13 21:58:11,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:11,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:11,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:11,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:11,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829984156] [2025-03-13 21:58:11,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829984156] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:11,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:11,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:11,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2075694825] [2025-03-13 21:58:11,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:11,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:11,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:11,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:11,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:11,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 407 out of 458 [2025-03-13 21:58:11,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 433 places, 426 transitions, 898 flow. Second operand has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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-03-13 21:58:11,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:11,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 407 of 458 [2025-03-13 21:58:11,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 21:58:24,669 INFO L124 PetriNetUnfolderBase]: 15480/93326 cut-off events. [2025-03-13 21:58:24,669 INFO L125 PetriNetUnfolderBase]: For 15606/17112 co-relation queries the response was YES. [2025-03-13 21:58:25,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120191 conditions, 93326 events. 15480/93326 cut-off events. For 15606/17112 co-relation queries the response was YES. Maximal size of possible extension queue 2196. Compared 1535470 event pairs, 13384 based on Foata normal form. 0/79189 useless extension candidates. Maximal degree in co-relation 60064. Up to 10394 conditions per place. [2025-03-13 21:58:26,256 INFO L140 encePairwiseOnDemand]: 456/458 looper letters, 61 selfloop transitions, 1 changer transitions 0/455 dead transitions. [2025-03-13 21:58:26,256 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 455 transitions, 1120 flow [2025-03-13 21:58:26,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 21:58:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 21:58:26,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2025-03-13 21:58:26,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9344978165938864 [2025-03-13 21:58:26,258 INFO L175 Difference]: Start difference. First operand has 433 places, 426 transitions, 898 flow. Second operand 3 states and 1284 transitions. [2025-03-13 21:58:26,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 455 transitions, 1120 flow [2025-03-13 21:58:26,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 425 places, 455 transitions, 1119 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 21:58:26,302 INFO L231 Difference]: Finished difference. Result has 425 places, 425 transitions, 897 flow [2025-03-13 21:58:26,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=458, PETRI_DIFFERENCE_MINUEND_FLOW=895, PETRI_DIFFERENCE_MINUEND_PLACES=423, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=425, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=424, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=897, PETRI_PLACES=425, PETRI_TRANSITIONS=425} [2025-03-13 21:58:26,302 INFO L279 CegarLoopForPetriNet]: 439 programPoint places, -14 predicate places. [2025-03-13 21:58:26,302 INFO L471 AbstractCegarLoop]: Abstraction has has 425 places, 425 transitions, 897 flow [2025-03-13 21:58:26,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 407.6666666666667) internal successors, (1223), 3 states have internal predecessors, (1223), 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-03-13 21:58:26,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 21:58:26,303 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] [2025-03-13 21:58:26,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 21:58:26,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [funcAErr6ASSERT_VIOLATIONDATA_RACE, funcAErr5ASSERT_VIOLATIONDATA_RACE, funcAErr4ASSERT_VIOLATIONDATA_RACE, funcAErr3ASSERT_VIOLATIONDATA_RACE (and 73 more)] === [2025-03-13 21:58:26,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 21:58:26,303 INFO L85 PathProgramCache]: Analyzing trace with hash -1974219031, now seen corresponding path program 1 times [2025-03-13 21:58:26,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 21:58:26,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127021537] [2025-03-13 21:58:26,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 21:58:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 21:58:26,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-13 21:58:26,308 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-13 21:58:26,308 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 21:58:26,308 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 21:58:26,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 21:58:26,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 21:58:26,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127021537] [2025-03-13 21:58:26,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127021537] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 21:58:26,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 21:58:26,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 21:58:26,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555244884] [2025-03-13 21:58:26,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 21:58:26,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 21:58:26,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 21:58:26,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 21:58:26,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 21:58:26,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 383 out of 458 [2025-03-13 21:58:26,345 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 425 places, 425 transitions, 897 flow. Second operand has 3 states, 3 states have (on average 383.6666666666667) internal successors, (1151), 3 states have internal predecessors, (1151), 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-03-13 21:58:26,345 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 21:58:26,345 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 383 of 458 [2025-03-13 21:58:26,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand