./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed 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/goblint-regression/28-race_reach_93-evilcollapse_racefree.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 dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:03:43,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:03:43,283 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:03:43,290 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:03:43,292 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:03:43,305 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:03:43,306 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:03:43,306 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:03:43,307 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:03:43,307 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:03:43,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:03:43,308 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:03:43,308 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:03:43,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:03:43,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:03:43,309 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:03:43,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:03:43,310 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 -> dad265ed8a17f32bb0a174302dfe188f9a15f60b81cc9c28a67851ab05270da2 [2025-03-08 22:03:43,552 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:03:43,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:03:43,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:03:43,563 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:03:43,563 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:03:43,565 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-03-08 22:03:44,679 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b397bbc22/0de26b2859e04c04822fe9c218160950/FLAG1fb95b643 [2025-03-08 22:03:44,999 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:03:45,002 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-03-08 22:03:45,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b397bbc22/0de26b2859e04c04822fe9c218160950/FLAG1fb95b643 [2025-03-08 22:03:45,038 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b397bbc22/0de26b2859e04c04822fe9c218160950 [2025-03-08 22:03:45,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:03:45,042 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:03:45,044 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:03:45,044 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:03:45,048 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:03:45,049 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,050 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e44cc30 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45, skipping insertion in model container [2025-03-08 22:03:45,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,085 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:03:45,387 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,388 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,388 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,389 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,415 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:03:45,440 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:03:45,487 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,488 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,488 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,489 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-08 22:03:45,506 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:03:45,544 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:03:45,545 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45 WrapperNode [2025-03-08 22:03:45,545 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:03:45,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:03:45,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:03:45,546 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:03:45,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,567 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,590 INFO L138 Inliner]: procedures = 281, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 412 [2025-03-08 22:03:45,591 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:03:45,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:03:45,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:03:45,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:03:45,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,597 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,602 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,602 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,617 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,619 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,627 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:03:45,631 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:03:45,631 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:03:45,631 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:03:45,632 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (1/1) ... [2025-03-08 22:03:45,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:03:45,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:45,673 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-08 22:03:45,676 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-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:03:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:03:45,694 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:03:45,694 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:03:45,696 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:03:45,802 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:03:45,804 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:03:46,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:03:46,226 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:03:46,323 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:03:46,323 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:03:46,356 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:03:46,356 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:03:46,357 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:46 BoogieIcfgContainer [2025-03-08 22:03:46,357 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:03:46,359 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:03:46,359 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:03:46,362 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:03:46,362 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:03:45" (1/3) ... [2025-03-08 22:03:46,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9d669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:46, skipping insertion in model container [2025-03-08 22:03:46,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:03:45" (2/3) ... [2025-03-08 22:03:46,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9d669d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:03:46, skipping insertion in model container [2025-03-08 22:03:46,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:03:46" (3/3) ... [2025-03-08 22:03:46,364 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2025-03-08 22:03:46,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:03:46,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_93-evilcollapse_racefree.i that has 2 procedures, 450 locations, 1 initial locations, 10 loop locations, and 21 error locations. [2025-03-08 22:03:46,376 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:03:46,461 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:03:46,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 472 transitions, 951 flow [2025-03-08 22:03:46,653 INFO L124 PetriNetUnfolderBase]: 22/502 cut-off events. [2025-03-08 22:03:46,656 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:03:46,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 507 conditions, 502 events. 22/502 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1155 event pairs, 0 based on Foata normal form. 0/454 useless extension candidates. Maximal degree in co-relation 322. Up to 4 conditions per place. [2025-03-08 22:03:46,663 INFO L82 GeneralOperation]: Start removeDead. Operand has 453 places, 472 transitions, 951 flow [2025-03-08 22:03:46,692 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 453 places, 472 transitions, 951 flow [2025-03-08 22:03:46,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:03:46,713 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;@51b7b8d4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:03:46,715 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-08 22:03:46,732 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:03:46,733 INFO L124 PetriNetUnfolderBase]: 0/124 cut-off events. [2025-03-08 22:03:46,733 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:03:46,733 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:46,734 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:46,734 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:46,739 INFO L85 PathProgramCache]: Analyzing trace with hash 603167492, now seen corresponding path program 1 times [2025-03-08 22:03:46,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:46,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123513260] [2025-03-08 22:03:46,744 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:46,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:46,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-08 22:03:46,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-08 22:03:46,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:46,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:47,642 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-08 22:03:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123513260] [2025-03-08 22:03:47,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123513260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:47,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:47,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:47,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365747349] [2025-03-08 22:03:47,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:47,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:47,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:47,673 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:47,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:48,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-08 22:03:48,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 453 places, 472 transitions, 951 flow. Second operand has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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-08 22:03:48,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:48,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-08 22:03:48,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:48,598 INFO L124 PetriNetUnfolderBase]: 320/1662 cut-off events. [2025-03-08 22:03:48,598 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-08 22:03:48,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2360 conditions, 1662 events. 320/1662 cut-off events. For 7/15 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 9998 event pairs, 288 based on Foata normal form. 79/1606 useless extension candidates. Maximal degree in co-relation 1963. Up to 682 conditions per place. [2025-03-08 22:03:48,613 INFO L140 encePairwiseOnDemand]: 445/472 looper letters, 88 selfloop transitions, 10 changer transitions 2/453 dead transitions. [2025-03-08 22:03:48,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 453 transitions, 1109 flow [2025-03-08 22:03:48,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:48,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:48,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-08 22:03:48,638 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-08 22:03:48,639 INFO L175 Difference]: Start difference. First operand has 453 places, 472 transitions, 951 flow. Second operand 6 states and 2251 transitions. [2025-03-08 22:03:48,640 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 453 transitions, 1109 flow [2025-03-08 22:03:48,647 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 453 transitions, 1109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:03:48,657 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 929 flow [2025-03-08 22:03:48,660 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=449, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=453, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=929, PETRI_PLACES=454, PETRI_TRANSITIONS=451} [2025-03-08 22:03:48,664 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-08 22:03:48,665 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 929 flow [2025-03-08 22:03:48,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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-08 22:03:48,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:48,667 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:03:48,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:03:48,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:48,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:48,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1805401345, now seen corresponding path program 1 times [2025-03-08 22:03:48,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:48,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839599314] [2025-03-08 22:03:48,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:48,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:48,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 22:03:48,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 22:03:48,706 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:48,706 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:49,114 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-08 22:03:49,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:49,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839599314] [2025-03-08 22:03:49,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839599314] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:49,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:49,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:49,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496749163] [2025-03-08 22:03:49,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:49,116 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:49,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:49,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:49,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:49,568 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-08 22:03:49,570 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 451 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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-08 22:03:49,570 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:49,570 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-08 22:03:49,570 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:49,891 INFO L124 PetriNetUnfolderBase]: 320/1658 cut-off events. [2025-03-08 22:03:49,891 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-08 22:03:49,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2367 conditions, 1658 events. 320/1658 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10036 event pairs, 288 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 2192. Up to 682 conditions per place. [2025-03-08 22:03:49,898 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 88 selfloop transitions, 10 changer transitions 0/449 dead transitions. [2025-03-08 22:03:49,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1121 flow [2025-03-08 22:03:49,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:49,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:49,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2236 transitions. [2025-03-08 22:03:49,903 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78954802259887 [2025-03-08 22:03:49,903 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 929 flow. Second operand 6 states and 2236 transitions. [2025-03-08 22:03:49,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1121 flow [2025-03-08 22:03:49,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 449 transitions, 1101 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:49,910 INFO L231 Difference]: Finished difference. Result has 450 places, 449 transitions, 925 flow [2025-03-08 22:03:49,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=450, PETRI_TRANSITIONS=449} [2025-03-08 22:03:49,913 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-08 22:03:49,913 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 449 transitions, 925 flow [2025-03-08 22:03:49,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.3333333333333) internal successors, (2144), 6 states have internal predecessors, (2144), 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-08 22:03:49,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:49,915 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, 1, 1, 1, 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-08 22:03:49,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:03:49,916 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:49,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:49,917 INFO L85 PathProgramCache]: Analyzing trace with hash 2046444812, now seen corresponding path program 1 times [2025-03-08 22:03:49,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:49,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685465554] [2025-03-08 22:03:49,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:49,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:49,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 22:03:49,940 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 22:03:49,941 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:49,941 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:50,020 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-08 22:03:50,021 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:50,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685465554] [2025-03-08 22:03:50,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685465554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:50,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:50,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:50,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031359453] [2025-03-08 22:03:50,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:50,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:50,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:50,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:50,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:50,036 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-08 22:03:50,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 449 transitions, 925 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:03:50,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:50,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-08 22:03:50,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:50,112 INFO L124 PetriNetUnfolderBase]: 16/627 cut-off events. [2025-03-08 22:03:50,112 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-08 22:03:50,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 688 conditions, 627 events. 16/627 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1824 event pairs, 8 based on Foata normal form. 1/585 useless extension candidates. Maximal degree in co-relation 465. Up to 34 conditions per place. [2025-03-08 22:03:50,115 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-08 22:03:50,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 961 flow [2025-03-08 22:03:50,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:50,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:50,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-08 22:03:50,117 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-08 22:03:50,117 INFO L175 Difference]: Start difference. First operand has 450 places, 449 transitions, 925 flow. Second operand 3 states and 1338 transitions. [2025-03-08 22:03:50,117 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 961 flow [2025-03-08 22:03:50,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 450 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:50,126 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 917 flow [2025-03-08 22:03:50,127 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=917, PETRI_PLACES=448, PETRI_TRANSITIONS=450} [2025-03-08 22:03:50,127 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-08 22:03:50,128 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 917 flow [2025-03-08 22:03:50,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:03:50,128 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:50,129 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:50,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:03:50,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:50,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:50,130 INFO L85 PathProgramCache]: Analyzing trace with hash -32389628, now seen corresponding path program 1 times [2025-03-08 22:03:50,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:50,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496248003] [2025-03-08 22:03:50,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:50,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:50,152 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 22:03:50,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 22:03:50,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:50,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:50,546 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-08 22:03:50,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:50,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496248003] [2025-03-08 22:03:50,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1496248003] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:50,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:50,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:50,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297352404] [2025-03-08 22:03:50,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:50,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:50,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:50,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:50,867 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-08 22:03:50,869 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 450 transitions, 917 flow. Second operand has 6 states, 6 states have (on average 357.6666666666667) internal successors, (2146), 6 states have internal predecessors, (2146), 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-08 22:03:50,869 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:50,869 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-08 22:03:50,869 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:51,067 INFO L124 PetriNetUnfolderBase]: 321/1780 cut-off events. [2025-03-08 22:03:51,067 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-08 22:03:51,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2533 conditions, 1780 events. 321/1780 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10589 event pairs, 288 based on Foata normal form. 0/1645 useless extension candidates. Maximal degree in co-relation 2261. Up to 730 conditions per place. [2025-03-08 22:03:51,074 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-08 22:03:51,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 449 transitions, 1115 flow [2025-03-08 22:03:51,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:51,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:51,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-08 22:03:51,078 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-08 22:03:51,078 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 917 flow. Second operand 6 states and 2231 transitions. [2025-03-08 22:03:51,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 449 transitions, 1115 flow [2025-03-08 22:03:51,080 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 449 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:51,084 INFO L231 Difference]: Finished difference. Result has 451 places, 449 transitions, 923 flow [2025-03-08 22:03:51,084 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=451, PETRI_TRANSITIONS=449} [2025-03-08 22:03:51,085 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-08 22:03:51,085 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 449 transitions, 923 flow [2025-03-08 22:03:51,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 357.6666666666667) internal successors, (2146), 6 states have internal predecessors, (2146), 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-08 22:03:51,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:51,086 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:51,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:03:51,087 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:51,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:51,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1384782310, now seen corresponding path program 1 times [2025-03-08 22:03:51,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:51,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668982799] [2025-03-08 22:03:51,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:51,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:51,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 22:03:51,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 22:03:51,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:51,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:51,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668982799] [2025-03-08 22:03:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668982799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:51,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:51,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:03:51,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033320804] [2025-03-08 22:03:51,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:51,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:03:51,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:51,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:03:51,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:03:51,181 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-08 22:03:51,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 449 transitions, 923 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:03:51,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:51,185 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-08 22:03:51,185 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:51,268 INFO L124 PetriNetUnfolderBase]: 16/813 cut-off events. [2025-03-08 22:03:51,268 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-08 22:03:51,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884 conditions, 813 events. 16/813 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1845 event pairs, 8 based on Foata normal form. 2/766 useless extension candidates. Maximal degree in co-relation 660. Up to 38 conditions per place. [2025-03-08 22:03:51,271 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-08 22:03:51,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 450 transitions, 959 flow [2025-03-08 22:03:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:03:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:03:51,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-08 22:03:51,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-08 22:03:51,277 INFO L175 Difference]: Start difference. First operand has 451 places, 449 transitions, 923 flow. Second operand 3 states and 1338 transitions. [2025-03-08 22:03:51,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 450 transitions, 959 flow [2025-03-08 22:03:51,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 450 transitions, 949 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:51,282 INFO L231 Difference]: Finished difference. Result has 449 places, 450 transitions, 925 flow [2025-03-08 22:03:51,283 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=447, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=925, PETRI_PLACES=449, PETRI_TRANSITIONS=450} [2025-03-08 22:03:51,284 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-08 22:03:51,284 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 450 transitions, 925 flow [2025-03-08 22:03:51,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:03:51,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:51,285 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:51,285 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:03:51,285 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:51,285 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:51,286 INFO L85 PathProgramCache]: Analyzing trace with hash 85501322, now seen corresponding path program 1 times [2025-03-08 22:03:51,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:51,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857646449] [2025-03-08 22:03:51,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:51,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:51,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-08 22:03:51,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-08 22:03:51,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:51,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:51,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:03:51,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:51,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857646449] [2025-03-08 22:03:51,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857646449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:51,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:51,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:51,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662795374] [2025-03-08 22:03:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:51,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:51,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:51,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:51,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:52,207 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-08 22:03:52,210 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 450 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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-08 22:03:52,210 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:52,210 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-08 22:03:52,210 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:52,435 INFO L124 PetriNetUnfolderBase]: 84/1123 cut-off events. [2025-03-08 22:03:52,436 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-08 22:03:52,437 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1476 conditions, 1123 events. 84/1123 cut-off events. For 10/14 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 3773 event pairs, 64 based on Foata normal form. 0/1037 useless extension candidates. Maximal degree in co-relation 937. Up to 311 conditions per place. [2025-03-08 22:03:52,439 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-08 22:03:52,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 449 transitions, 1057 flow [2025-03-08 22:03:52,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:52,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:52,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-08 22:03:52,443 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-08 22:03:52,443 INFO L175 Difference]: Start difference. First operand has 449 places, 450 transitions, 925 flow. Second operand 6 states and 2396 transitions. [2025-03-08 22:03:52,443 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 449 transitions, 1057 flow [2025-03-08 22:03:52,446 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:52,449 INFO L231 Difference]: Finished difference. Result has 452 places, 449 transitions, 931 flow [2025-03-08 22:03:52,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=921, PETRI_DIFFERENCE_MINUEND_PLACES=447, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=449, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=444, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=931, PETRI_PLACES=452, PETRI_TRANSITIONS=449} [2025-03-08 22:03:52,450 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -1 predicate places. [2025-03-08 22:03:52,450 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 449 transitions, 931 flow [2025-03-08 22:03:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 392.5) internal successors, (2355), 6 states have internal predecessors, (2355), 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-08 22:03:52,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:52,451 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:52,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:03:52,451 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:52,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:52,452 INFO L85 PathProgramCache]: Analyzing trace with hash -2013175932, now seen corresponding path program 1 times [2025-03-08 22:03:52,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:52,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181465871] [2025-03-08 22:03:52,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:52,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:52,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-08 22:03:52,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-08 22:03:52,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:52,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:52,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:03:52,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:52,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181465871] [2025-03-08 22:03:52,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181465871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:52,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:52,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:52,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109694479] [2025-03-08 22:03:52,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:52,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:52,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:52,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:52,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:53,284 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-08 22:03:53,286 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 449 transitions, 931 flow. Second operand has 6 states, 6 states have (on average 360.3333333333333) internal successors, (2162), 6 states have internal predecessors, (2162), 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-08 22:03:53,286 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:53,286 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-08 22:03:53,286 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:53,603 INFO L124 PetriNetUnfolderBase]: 321/1960 cut-off events. [2025-03-08 22:03:53,603 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:53,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2817 conditions, 1960 events. 321/1960 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10693 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2304. Up to 796 conditions per place. [2025-03-08 22:03:53,610 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-08 22:03:53,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 448 transitions, 1129 flow [2025-03-08 22:03:53,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:53,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:53,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-08 22:03:53,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-08 22:03:53,614 INFO L175 Difference]: Start difference. First operand has 452 places, 449 transitions, 931 flow. Second operand 6 states and 2231 transitions. [2025-03-08 22:03:53,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 448 transitions, 1129 flow [2025-03-08 22:03:53,617 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 448 transitions, 1119 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:53,620 INFO L231 Difference]: Finished difference. Result has 451 places, 448 transitions, 929 flow [2025-03-08 22:03:53,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=919, PETRI_DIFFERENCE_MINUEND_PLACES=446, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=448, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=443, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=929, PETRI_PLACES=451, PETRI_TRANSITIONS=448} [2025-03-08 22:03:53,621 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-08 22:03:53,621 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 448 transitions, 929 flow [2025-03-08 22:03:53,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 360.3333333333333) internal successors, (2162), 6 states have internal predecessors, (2162), 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-08 22:03:53,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:53,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:03:53,623 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:53,623 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:53,623 INFO L85 PathProgramCache]: Analyzing trace with hash 1298391239, now seen corresponding path program 1 times [2025-03-08 22:03:53,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:53,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705827963] [2025-03-08 22:03:53,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:53,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:53,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-08 22:03:53,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-08 22:03:53,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:53,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:54,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:03:54,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:54,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705827963] [2025-03-08 22:03:54,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705827963] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:54,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:54,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:54,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126132305] [2025-03-08 22:03:54,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:54,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:54,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:54,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:54,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:54,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-08 22:03:54,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 451 places, 448 transitions, 929 flow. Second operand has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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-08 22:03:54,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:54,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-08 22:03:54,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:54,647 INFO L124 PetriNetUnfolderBase]: 321/1956 cut-off events. [2025-03-08 22:03:54,647 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:54,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2797 conditions, 1956 events. 321/1956 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10702 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2320. Up to 780 conditions per place. [2025-03-08 22:03:54,654 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-08 22:03:54,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 447 transitions, 1119 flow [2025-03-08 22:03:54,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:54,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:54,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-08 22:03:54,658 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-08 22:03:54,658 INFO L175 Difference]: Start difference. First operand has 451 places, 448 transitions, 929 flow. Second operand 6 states and 2251 transitions. [2025-03-08 22:03:54,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 447 transitions, 1119 flow [2025-03-08 22:03:54,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 447 transitions, 1109 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:54,663 INFO L231 Difference]: Finished difference. Result has 450 places, 447 transitions, 927 flow [2025-03-08 22:03:54,664 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=917, PETRI_DIFFERENCE_MINUEND_PLACES=445, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=447, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=927, PETRI_PLACES=450, PETRI_TRANSITIONS=447} [2025-03-08 22:03:54,664 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-08 22:03:54,664 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 447 transitions, 927 flow [2025-03-08 22:03:54,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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-08 22:03:54,665 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:54,666 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:54,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:03:54,666 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:54,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:54,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1090269248, now seen corresponding path program 1 times [2025-03-08 22:03:54,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:54,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187226161] [2025-03-08 22:03:54,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:54,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:54,686 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 22:03:54,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 22:03:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:55,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 22:03:55,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:55,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187226161] [2025-03-08 22:03:55,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187226161] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:55,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:55,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:55,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411409740] [2025-03-08 22:03:55,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:55,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:55,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:55,070 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:55,070 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:55,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-08 22:03:55,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 450 places, 447 transitions, 927 flow. Second operand has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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-08 22:03:55,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:55,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-08 22:03:55,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:55,746 INFO L124 PetriNetUnfolderBase]: 321/1952 cut-off events. [2025-03-08 22:03:55,746 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-08 22:03:55,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2793 conditions, 1952 events. 321/1952 cut-off events. For 15/23 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10641 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2335. Up to 780 conditions per place. [2025-03-08 22:03:55,753 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-08 22:03:55,754 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 446 transitions, 1117 flow [2025-03-08 22:03:55,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:55,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:55,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-08 22:03:55,757 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-08 22:03:55,757 INFO L175 Difference]: Start difference. First operand has 450 places, 447 transitions, 927 flow. Second operand 6 states and 2251 transitions. [2025-03-08 22:03:55,757 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 446 transitions, 1117 flow [2025-03-08 22:03:55,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 446 transitions, 1107 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:55,762 INFO L231 Difference]: Finished difference. Result has 449 places, 446 transitions, 925 flow [2025-03-08 22:03:55,763 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=444, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=446, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=441, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=925, PETRI_PLACES=449, PETRI_TRANSITIONS=446} [2025-03-08 22:03:55,764 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-08 22:03:55,764 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 446 transitions, 925 flow [2025-03-08 22:03:55,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 365.0) internal successors, (2190), 6 states have internal predecessors, (2190), 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-08 22:03:55,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:55,765 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:55,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:03:55,765 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:55,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:55,766 INFO L85 PathProgramCache]: Analyzing trace with hash -282901329, now seen corresponding path program 1 times [2025-03-08 22:03:55,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621700362] [2025-03-08 22:03:55,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:55,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-08 22:03:55,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-08 22:03:55,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:55,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:56,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 22:03:56,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:56,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621700362] [2025-03-08 22:03:56,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621700362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:56,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:56,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:56,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047417024] [2025-03-08 22:03:56,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:56,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:56,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:56,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:56,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:56,496 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-08 22:03:56,498 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 446 transitions, 925 flow. Second operand has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 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-08 22:03:56,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:56,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-08 22:03:56,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:56,802 INFO L124 PetriNetUnfolderBase]: 321/1948 cut-off events. [2025-03-08 22:03:56,802 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-08 22:03:56,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2809 conditions, 1948 events. 321/1948 cut-off events. For 19/27 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 10649 event pairs, 288 based on Foata normal form. 0/1825 useless extension candidates. Maximal degree in co-relation 2348. Up to 800 conditions per place. [2025-03-08 22:03:56,808 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 96 selfloop transitions, 5 changer transitions 0/445 dead transitions. [2025-03-08 22:03:56,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 445 transitions, 1125 flow [2025-03-08 22:03:56,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:56,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:56,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2226 transitions. [2025-03-08 22:03:56,812 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860169491525424 [2025-03-08 22:03:56,812 INFO L175 Difference]: Start difference. First operand has 449 places, 446 transitions, 925 flow. Second operand 6 states and 2226 transitions. [2025-03-08 22:03:56,812 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 445 transitions, 1125 flow [2025-03-08 22:03:56,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 445 transitions, 1115 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:56,818 INFO L231 Difference]: Finished difference. Result has 448 places, 445 transitions, 923 flow [2025-03-08 22:03:56,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=440, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=923, PETRI_PLACES=448, PETRI_TRANSITIONS=445} [2025-03-08 22:03:56,820 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-08 22:03:56,820 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 445 transitions, 923 flow [2025-03-08 22:03:56,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 361.5) internal successors, (2169), 6 states have internal predecessors, (2169), 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-08 22:03:56,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:56,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:56,821 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:03:56,822 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:56,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:56,822 INFO L85 PathProgramCache]: Analyzing trace with hash -763286831, now seen corresponding path program 1 times [2025-03-08 22:03:56,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:56,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447129965] [2025-03-08 22:03:56,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:56,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:56,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 22:03:56,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 22:03:56,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:56,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:03:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447129965] [2025-03-08 22:03:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447129965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:56,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1179921347] [2025-03-08 22:03:56,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:56,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:56,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:56,967 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:03:56,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 22:03:57,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-08 22:03:57,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-08 22:03:57,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:57,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:57,144 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 22:03:57,150 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:03:57,287 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:03:57,288 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:03:57,412 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-08 22:03:57,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1179921347] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:03:57,417 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:03:57,417 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-08 22:03:57,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909903506] [2025-03-08 22:03:57,417 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:03:57,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 22:03:57,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:57,418 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 22:03:57,418 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-08 22:03:57,440 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-08 22:03:57,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 445 transitions, 923 flow. Second operand has 10 states, 10 states have (on average 438.8) internal successors, (4388), 10 states have internal predecessors, (4388), 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-08 22:03:57,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:57,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-08 22:03:57,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:57,614 INFO L124 PetriNetUnfolderBase]: 16/977 cut-off events. [2025-03-08 22:03:57,614 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-08 22:03:57,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1091 conditions, 977 events. 16/977 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1216 event pairs, 8 based on Foata normal form. 4/952 useless extension candidates. Maximal degree in co-relation 866. Up to 38 conditions per place. [2025-03-08 22:03:57,617 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 19 selfloop transitions, 9 changer transitions 0/453 dead transitions. [2025-03-08 22:03:57,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 453 transitions, 997 flow [2025-03-08 22:03:57,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 22:03:57,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-08 22:03:57,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3963 transitions. [2025-03-08 22:03:57,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.932909604519774 [2025-03-08 22:03:57,622 INFO L175 Difference]: Start difference. First operand has 448 places, 445 transitions, 923 flow. Second operand 9 states and 3963 transitions. [2025-03-08 22:03:57,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 453 transitions, 997 flow [2025-03-08 22:03:57,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 453 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:03:57,628 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 963 flow [2025-03-08 22:03:57,628 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=913, PETRI_DIFFERENCE_MINUEND_PLACES=443, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=439, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=963, PETRI_PLACES=454, PETRI_TRANSITIONS=451} [2025-03-08 22:03:57,628 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-08 22:03:57,629 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 963 flow [2025-03-08 22:03:57,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 438.8) internal successors, (4388), 10 states have internal predecessors, (4388), 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-08 22:03:57,630 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:57,630 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:57,639 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 22:03:57,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 22:03:57,831 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:57,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:57,832 INFO L85 PathProgramCache]: Analyzing trace with hash 46327807, now seen corresponding path program 2 times [2025-03-08 22:03:57,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:57,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106474546] [2025-03-08 22:03:57,832 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:03:57,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:57,891 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-03-08 22:03:57,895 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 418 statements. [2025-03-08 22:03:57,895 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:03:57,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:58,083 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-03-08 22:03:58,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:58,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106474546] [2025-03-08 22:03:58,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106474546] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:03:58,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:03:58,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:03:58,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658069237] [2025-03-08 22:03:58,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:03:58,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:03:58,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:03:58,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:03:58,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:03:59,004 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-08 22:03:59,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 454 places, 451 transitions, 963 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 22:03:59,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:03:59,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-08 22:03:59,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:03:59,154 INFO L124 PetriNetUnfolderBase]: 84/1290 cut-off events. [2025-03-08 22:03:59,154 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-08 22:03:59,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1714 conditions, 1290 events. 84/1290 cut-off events. For 18/22 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3090 event pairs, 64 based on Foata normal form. 0/1217 useless extension candidates. Maximal degree in co-relation 1059. Up to 355 conditions per place. [2025-03-08 22:03:59,157 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-08 22:03:59,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1095 flow [2025-03-08 22:03:59,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:03:59,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:03:59,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-08 22:03:59,161 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-08 22:03:59,161 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 963 flow. Second operand 6 states and 2396 transitions. [2025-03-08 22:03:59,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1095 flow [2025-03-08 22:03:59,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 450 transitions, 1089 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-08 22:03:59,167 INFO L231 Difference]: Finished difference. Result has 457 places, 450 transitions, 965 flow [2025-03-08 22:03:59,168 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=445, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=965, PETRI_PLACES=457, PETRI_TRANSITIONS=450} [2025-03-08 22:03:59,168 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 4 predicate places. [2025-03-08 22:03:59,168 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 450 transitions, 965 flow [2025-03-08 22:03:59,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 22:03:59,169 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:03:59,170 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:03:59,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:03:59,170 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:03:59,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:03:59,171 INFO L85 PathProgramCache]: Analyzing trace with hash -573082179, now seen corresponding path program 1 times [2025-03-08 22:03:59,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:03:59,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454851354] [2025-03-08 22:03:59,171 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:59,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:03:59,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-08 22:03:59,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-08 22:03:59,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:59,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:59,459 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 525 trivial. 0 not checked. [2025-03-08 22:03:59,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:03:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454851354] [2025-03-08 22:03:59,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454851354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:03:59,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524159874] [2025-03-08 22:03:59,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:03:59,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:03:59,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:03:59,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:03:59,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 22:03:59,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-08 22:03:59,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-08 22:03:59,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:03:59,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:03:59,766 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 22:03:59,776 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 22:04:00,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:00,378 INFO L134 CoverageAnalysis]: Checked inductivity of 526 backedges. 1 proven. 441 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-08 22:04:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1524159874] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:00,378 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:00,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-08 22:04:00,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139472620] [2025-03-08 22:04:00,379 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:00,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 22:04:00,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:00,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 22:04:00,382 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-08 22:04:00,464 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 472 [2025-03-08 22:04:00,469 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 450 transitions, 965 flow. Second operand has 19 states, 19 states have (on average 433.5263157894737) internal successors, (8237), 19 states have internal predecessors, (8237), 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-08 22:04:00,469 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:00,469 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 472 [2025-03-08 22:04:00,469 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:01,446 INFO L124 PetriNetUnfolderBase]: 17/2356 cut-off events. [2025-03-08 22:04:01,446 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-08 22:04:01,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2652 conditions, 2356 events. 17/2356 cut-off events. For 81/82 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1216 event pairs, 8 based on Foata normal form. 13/2341 useless extension candidates. Maximal degree in co-relation 2424. Up to 40 conditions per place. [2025-03-08 22:04:01,450 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 51 selfloop transitions, 68 changer transitions 0/536 dead transitions. [2025-03-08 22:04:01,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 536 transitions, 1613 flow [2025-03-08 22:04:01,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-08 22:04:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-08 22:04:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 27285 transitions. [2025-03-08 22:04:01,469 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175746569814366 [2025-03-08 22:04:01,470 INFO L175 Difference]: Start difference. First operand has 457 places, 450 transitions, 965 flow. Second operand 63 states and 27285 transitions. [2025-03-08 22:04:01,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 536 transitions, 1613 flow [2025-03-08 22:04:01,473 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 536 transitions, 1603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:01,477 INFO L231 Difference]: Finished difference. Result has 530 places, 512 transitions, 1475 flow [2025-03-08 22:04:01,477 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=955, PETRI_DIFFERENCE_MINUEND_PLACES=452, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=450, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=434, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1475, PETRI_PLACES=530, PETRI_TRANSITIONS=512} [2025-03-08 22:04:01,478 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 77 predicate places. [2025-03-08 22:04:01,479 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 512 transitions, 1475 flow [2025-03-08 22:04:01,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 433.5263157894737) internal successors, (8237), 19 states have internal predecessors, (8237), 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-08 22:04:01,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:01,483 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:01,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-08 22:04:01,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 22:04:01,683 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:01,685 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:01,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1491457430, now seen corresponding path program 2 times [2025-03-08 22:04:01,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:01,686 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941421264] [2025-03-08 22:04:01,686 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:01,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:01,871 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1437 statements into 2 equivalence classes. [2025-03-08 22:04:01,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 1437 statements. [2025-03-08 22:04:01,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:01,876 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:02,045 INFO L134 CoverageAnalysis]: Checked inductivity of 13737 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13737 trivial. 0 not checked. [2025-03-08 22:04:02,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:02,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941421264] [2025-03-08 22:04:02,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941421264] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:02,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:02,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:02,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688632077] [2025-03-08 22:04:02,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:02,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:02,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:02,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:02,048 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:02,830 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-08 22:04:02,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 530 places, 512 transitions, 1475 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 22:04:02,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:02,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-08 22:04:02,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:03,467 INFO L124 PetriNetUnfolderBase]: 85/2669 cut-off events. [2025-03-08 22:04:03,468 INFO L125 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-03-08 22:04:03,469 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3799 conditions, 2669 events. 85/2669 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 3092 event pairs, 64 based on Foata normal form. 0/2597 useless extension candidates. Maximal degree in co-relation 3107. Up to 783 conditions per place. [2025-03-08 22:04:03,472 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/511 dead transitions. [2025-03-08 22:04:03,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 511 transitions, 1607 flow [2025-03-08 22:04:03,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:03,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:03,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-08 22:04:03,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-08 22:04:03,474 INFO L175 Difference]: Start difference. First operand has 530 places, 512 transitions, 1475 flow. Second operand 6 states and 2396 transitions. [2025-03-08 22:04:03,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 511 transitions, 1607 flow [2025-03-08 22:04:03,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 511 transitions, 1531 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-08 22:04:03,484 INFO L231 Difference]: Finished difference. Result has 527 places, 511 transitions, 1407 flow [2025-03-08 22:04:03,484 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=506, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1407, PETRI_PLACES=527, PETRI_TRANSITIONS=511} [2025-03-08 22:04:03,484 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 74 predicate places. [2025-03-08 22:04:03,484 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 511 transitions, 1407 flow [2025-03-08 22:04:03,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-08 22:04:03,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:03,486 INFO L206 CegarLoopForPetriNet]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:03,486 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 22:04:03,486 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:03,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:03,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1232129805, now seen corresponding path program 1 times [2025-03-08 22:04:03,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:03,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762911918] [2025-03-08 22:04:03,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:03,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:03,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-08 22:04:03,747 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-08 22:04:03,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:03,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:06,151 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-08 22:04:06,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762911918] [2025-03-08 22:04:06,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762911918] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:06,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [657335500] [2025-03-08 22:04:06,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:06,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:06,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:06,154 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:04:06,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 22:04:06,640 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-08 22:04:07,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-08 22:04:07,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:07,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:07,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 5710 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-08 22:04:07,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-08 22:04:07,665 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:08,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13849 backedges. 7250 proven. 3073 refuted. 0 times theorem prover too weak. 3526 trivial. 0 not checked. [2025-03-08 22:04:08,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [657335500] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:08,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:08,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-08 22:04:08,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314863750] [2025-03-08 22:04:08,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:08,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-08 22:04:08,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:08,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-08 22:04:08,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 22:04:08,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-08 22:04:08,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 527 places, 511 transitions, 1407 flow. Second operand has 34 states, 34 states have (on average 439.11764705882354) internal successors, (14930), 34 states have internal predecessors, (14930), 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-08 22:04:08,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:08,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-08 22:04:08,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:10,188 INFO L124 PetriNetUnfolderBase]: 17/4515 cut-off events. [2025-03-08 22:04:10,188 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-08 22:04:10,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5311 conditions, 4515 events. 17/4515 cut-off events. For 3212/3213 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 1212 event pairs, 8 based on Foata normal form. 24/4512 useless extension candidates. Maximal degree in co-relation 5269. Up to 78 conditions per place. [2025-03-08 22:04:10,196 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 51 selfloop transitions, 135 changer transitions 0/612 dead transitions. [2025-03-08 22:04:10,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 612 transitions, 2543 flow [2025-03-08 22:04:10,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-08 22:04:10,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-08 22:04:10,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19749 transitions. [2025-03-08 22:04:10,203 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9298022598870056 [2025-03-08 22:04:10,203 INFO L175 Difference]: Start difference. First operand has 527 places, 511 transitions, 1407 flow. Second operand 45 states and 19749 transitions. [2025-03-08 22:04:10,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 612 transitions, 2543 flow [2025-03-08 22:04:10,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 612 transitions, 2533 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:04:10,214 INFO L231 Difference]: Finished difference. Result has 575 places, 586 transitions, 2271 flow [2025-03-08 22:04:10,214 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=1397, PETRI_DIFFERENCE_MINUEND_PLACES=522, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=511, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2271, PETRI_PLACES=575, PETRI_TRANSITIONS=586} [2025-03-08 22:04:10,215 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 122 predicate places. [2025-03-08 22:04:10,215 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 586 transitions, 2271 flow [2025-03-08 22:04:10,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 439.11764705882354) internal successors, (14930), 34 states have internal predecessors, (14930), 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-08 22:04:10,217 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:10,218 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:10,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 22:04:10,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:10,419 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:10,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:10,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1826167309, now seen corresponding path program 2 times [2025-03-08 22:04:10,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:10,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453979223] [2025-03-08 22:04:10,424 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:10,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:10,701 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2896 statements into 2 equivalence classes. [2025-03-08 22:04:10,704 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 138 of 2896 statements. [2025-03-08 22:04:10,705 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 22:04:10,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:10,918 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-08 22:04:10,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:10,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453979223] [2025-03-08 22:04:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453979223] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320348885] [2025-03-08 22:04:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:04:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:10,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:04:10,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:04:11,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 472 [2025-03-08 22:04:11,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 575 places, 586 transitions, 2271 flow. Second operand has 6 states, 6 states have (on average 360.8333333333333) internal successors, (2165), 6 states have internal predecessors, (2165), 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-08 22:04:11,318 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:11,318 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 472 [2025-03-08 22:04:11,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:14,864 INFO L124 PetriNetUnfolderBase]: 741/7068 cut-off events. [2025-03-08 22:04:14,864 INFO L125 PetriNetUnfolderBase]: For 1238/1252 co-relation queries the response was YES. [2025-03-08 22:04:14,872 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10831 conditions, 7068 events. 741/7068 cut-off events. For 1238/1252 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 22599 event pairs, 323 based on Foata normal form. 4/6822 useless extension candidates. Maximal degree in co-relation 6574. Up to 2693 conditions per place. [2025-03-08 22:04:14,881 INFO L140 encePairwiseOnDemand]: 437/472 looper letters, 135 selfloop transitions, 118 changer transitions 0/735 dead transitions. [2025-03-08 22:04:14,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 735 transitions, 3075 flow [2025-03-08 22:04:14,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:14,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2366 transitions. [2025-03-08 22:04:14,884 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83545197740113 [2025-03-08 22:04:14,885 INFO L175 Difference]: Start difference. First operand has 575 places, 586 transitions, 2271 flow. Second operand 6 states and 2366 transitions. [2025-03-08 22:04:14,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 735 transitions, 3075 flow [2025-03-08 22:04:14,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 735 transitions, 2967 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-08 22:04:14,902 INFO L231 Difference]: Finished difference. Result has 567 places, 703 transitions, 2937 flow [2025-03-08 22:04:14,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2163, PETRI_DIFFERENCE_MINUEND_PLACES=557, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=586, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=552, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2937, PETRI_PLACES=567, PETRI_TRANSITIONS=703} [2025-03-08 22:04:14,903 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 114 predicate places. [2025-03-08 22:04:14,903 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 703 transitions, 2937 flow [2025-03-08 22:04:14,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 360.8333333333333) internal successors, (2165), 6 states have internal predecessors, (2165), 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-08 22:04:14,903 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:14,904 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:14,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 22:04:14,904 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:14,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:14,910 INFO L85 PathProgramCache]: Analyzing trace with hash -915891560, now seen corresponding path program 1 times [2025-03-08 22:04:14,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:14,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223455505] [2025-03-08 22:04:14,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:14,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:15,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2896 statements into 1 equivalence classes. [2025-03-08 22:04:15,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2896 of 2896 statements. [2025-03-08 22:04:15,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:15,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:17,965 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-08 22:04:17,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:17,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223455505] [2025-03-08 22:04:17,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223455505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:17,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:17,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:04:17,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005693502] [2025-03-08 22:04:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:17,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:04:17,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:17,967 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:04:17,967 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:04:17,986 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-08 22:04:17,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 567 places, 703 transitions, 2937 flow. Second operand has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:04:17,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:17,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-08 22:04:17,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:20,172 INFO L124 PetriNetUnfolderBase]: 230/5691 cut-off events. [2025-03-08 22:04:20,172 INFO L125 PetriNetUnfolderBase]: For 1392/1434 co-relation queries the response was YES. [2025-03-08 22:04:20,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7390 conditions, 5691 events. 230/5691 cut-off events. For 1392/1434 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 11052 event pairs, 24 based on Foata normal form. 2/5565 useless extension candidates. Maximal degree in co-relation 5024. Up to 340 conditions per place. [2025-03-08 22:04:20,182 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-08 22:04:20,182 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 711 transitions, 3003 flow [2025-03-08 22:04:20,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:04:20,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:04:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2025-03-08 22:04:20,183 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498587570621468 [2025-03-08 22:04:20,184 INFO L175 Difference]: Start difference. First operand has 567 places, 703 transitions, 2937 flow. Second operand 3 states and 1345 transitions. [2025-03-08 22:04:20,184 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 711 transitions, 3003 flow [2025-03-08 22:04:20,195 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 711 transitions, 3003 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:04:20,200 INFO L231 Difference]: Finished difference. Result has 570 places, 703 transitions, 2948 flow [2025-03-08 22:04:20,201 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2937, PETRI_DIFFERENCE_MINUEND_PLACES=567, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2948, PETRI_PLACES=570, PETRI_TRANSITIONS=703} [2025-03-08 22:04:20,201 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 117 predicate places. [2025-03-08 22:04:20,201 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 703 transitions, 2948 flow [2025-03-08 22:04:20,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 441.3333333333333) internal successors, (1324), 3 states have internal predecessors, (1324), 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-08 22:04:20,201 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:20,202 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:20,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 22:04:20,202 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:20,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:20,208 INFO L85 PathProgramCache]: Analyzing trace with hash -244534679, now seen corresponding path program 1 times [2025-03-08 22:04:20,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:20,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012537167] [2025-03-08 22:04:20,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:20,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:20,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2910 statements into 1 equivalence classes. [2025-03-08 22:04:20,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2910 of 2910 statements. [2025-03-08 22:04:20,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:20,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:23,482 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 64681 trivial. 0 not checked. [2025-03-08 22:04:23,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:23,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012537167] [2025-03-08 22:04:23,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012537167] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:04:23,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:04:23,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:04:23,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122845945] [2025-03-08 22:04:23,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:04:23,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:04:23,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:23,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:04:23,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:04:23,504 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 472 [2025-03-08 22:04:23,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 570 places, 703 transitions, 2948 flow. Second operand has 5 states, 5 states have (on average 439.6) internal successors, (2198), 5 states have internal predecessors, (2198), 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-08 22:04:23,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:23,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 472 [2025-03-08 22:04:23,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:26,267 INFO L124 PetriNetUnfolderBase]: 304/5780 cut-off events. [2025-03-08 22:04:26,267 INFO L125 PetriNetUnfolderBase]: For 1410/1436 co-relation queries the response was YES. [2025-03-08 22:04:26,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7665 conditions, 5780 events. 304/5780 cut-off events. For 1410/1436 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10621 event pairs, 0 based on Foata normal form. 9/5685 useless extension candidates. Maximal degree in co-relation 5025. Up to 369 conditions per place. [2025-03-08 22:04:26,287 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 34 selfloop transitions, 5 changer transitions 0/704 dead transitions. [2025-03-08 22:04:26,287 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 704 transitions, 3023 flow [2025-03-08 22:04:26,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:04:26,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:04:26,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2667 transitions. [2025-03-08 22:04:26,290 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9417372881355932 [2025-03-08 22:04:26,290 INFO L175 Difference]: Start difference. First operand has 570 places, 703 transitions, 2948 flow. Second operand 6 states and 2667 transitions. [2025-03-08 22:04:26,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 704 transitions, 3023 flow [2025-03-08 22:04:26,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 704 transitions, 3014 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-08 22:04:26,309 INFO L231 Difference]: Finished difference. Result has 550 places, 680 transitions, 2898 flow [2025-03-08 22:04:26,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2888, PETRI_DIFFERENCE_MINUEND_PLACES=545, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=675, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2898, PETRI_PLACES=550, PETRI_TRANSITIONS=680} [2025-03-08 22:04:26,310 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 97 predicate places. [2025-03-08 22:04:26,310 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 680 transitions, 2898 flow [2025-03-08 22:04:26,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 439.6) internal successors, (2198), 5 states have internal predecessors, (2198), 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-08 22:04:26,311 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:26,311 INFO L206 CegarLoopForPetriNet]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:26,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 22:04:26,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:26,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:26,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1439383810, now seen corresponding path program 1 times [2025-03-08 22:04:26,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:26,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022664348] [2025-03-08 22:04:26,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:26,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:26,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-08 22:04:26,949 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-08 22:04:26,949 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:26,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:36,734 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-08 22:04:36,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:04:36,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022664348] [2025-03-08 22:04:36,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022664348] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:04:36,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143135077] [2025-03-08 22:04:36,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:04:36,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:36,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:04:36,737 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:04:36,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 22:04:37,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-08 22:04:38,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-08 22:04:38,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:04:38,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:04:38,899 INFO L256 TraceCheckSpWp]: Trace formula consists of 11659 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-08 22:04:38,929 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 22:04:39,870 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-08 22:04:39,871 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 22:04:41,310 INFO L134 CoverageAnalysis]: Checked inductivity of 64681 backedges. 33026 proven. 15345 refuted. 0 times theorem prover too weak. 16310 trivial. 0 not checked. [2025-03-08 22:04:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143135077] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 22:04:41,310 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 22:04:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-08 22:04:41,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996884988] [2025-03-08 22:04:41,311 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 22:04:41,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-08 22:04:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:04:41,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-08 22:04:41,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-08 22:04:41,374 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-08 22:04:41,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 550 places, 680 transitions, 2898 flow. Second operand has 63 states, 63 states have (on average 439.1111111111111) internal successors, (27664), 63 states have internal predecessors, (27664), 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-08 22:04:41,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:04:41,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-08 22:04:41,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:04:50,183 INFO L124 PetriNetUnfolderBase]: 198/9518 cut-off events. [2025-03-08 22:04:50,183 INFO L125 PetriNetUnfolderBase]: For 13554/13601 co-relation queries the response was YES. [2025-03-08 22:04:50,193 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12289 conditions, 9518 events. 198/9518 cut-off events. For 13554/13601 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 8814 event pairs, 0 based on Foata normal form. 45/9477 useless extension candidates. Maximal degree in co-relation 10211. Up to 345 conditions per place. [2025-03-08 22:04:50,201 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 94 selfloop transitions, 270 changer transitions 0/886 dead transitions. [2025-03-08 22:04:50,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 886 transitions, 5812 flow [2025-03-08 22:04:50,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-08 22:04:50,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-08 22:04:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 39479 transitions. [2025-03-08 22:04:50,539 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293549905838041 [2025-03-08 22:04:50,539 INFO L175 Difference]: Start difference. First operand has 550 places, 680 transitions, 2898 flow. Second operand 90 states and 39479 transitions. [2025-03-08 22:04:50,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 886 transitions, 5812 flow [2025-03-08 22:04:50,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 886 transitions, 5803 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-08 22:04:50,562 INFO L231 Difference]: Finished difference. Result has 651 places, 818 transitions, 4881 flow [2025-03-08 22:04:50,562 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=2889, PETRI_DIFFERENCE_MINUEND_PLACES=546, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=680, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=539, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4881, PETRI_PLACES=651, PETRI_TRANSITIONS=818} [2025-03-08 22:04:50,563 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 198 predicate places. [2025-03-08 22:04:50,563 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 818 transitions, 4881 flow [2025-03-08 22:04:50,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 439.1111111111111) internal successors, (27664), 63 states have internal predecessors, (27664), 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-08 22:04:50,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:04:50,569 INFO L206 CegarLoopForPetriNet]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 60, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 22:04:50,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 22:04:50,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:04:50,769 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 26 more)] === [2025-03-08 22:04:50,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:04:50,779 INFO L85 PathProgramCache]: Analyzing trace with hash -598823842, now seen corresponding path program 2 times [2025-03-08 22:04:50,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:04:50,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279248906] [2025-03-08 22:04:50,780 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:04:50,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:04:51,264 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes. [2025-03-08 22:04:51,787 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5611 of 5611 statements. [2025-03-08 22:04:51,788 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 22:04:51,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:05:03,385 INFO L134 CoverageAnalysis]: Checked inductivity of 260731 backedges. 480 proven. 131491 refuted. 0 times theorem prover too weak. 128760 trivial. 0 not checked. [2025-03-08 22:05:03,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:05:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279248906] [2025-03-08 22:05:03,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279248906] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 22:05:03,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691024780] [2025-03-08 22:05:03,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 22:05:03,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 22:05:03,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:05:03,388 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 22:05:03,390 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 22:05:05,807 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes.