./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/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-?-f8ab0bd-m [2025-03-13 22:21:54,318 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:21:54,390 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:21:54,397 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:21:54,398 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:21:54,420 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:21:54,421 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:21:54,421 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:21:54,421 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:21:54,421 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:21:54,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:21:54,421 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:21:54,421 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:21:54,421 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:21:54,422 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:21:54,422 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:54,423 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:21:54,423 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:21:54,423 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-13 22:21:54,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:21:54,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:21:54,651 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:21:54,651 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:21:54,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:21:54,652 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-13 22:21:55,798 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158d8cd06/f2d0e8765aac43f9a41ad14c93b8d1fc/FLAG58a1d2973 [2025-03-13 22:21:56,145 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:21:56,146 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_93-evilcollapse_racefree.i [2025-03-13 22:21:56,159 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158d8cd06/f2d0e8765aac43f9a41ad14c93b8d1fc/FLAG58a1d2973 [2025-03-13 22:21:56,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/158d8cd06/f2d0e8765aac43f9a41ad14c93b8d1fc [2025-03-13 22:21:56,182 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:21:56,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:21:56,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:56,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:21:56,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:21:56,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@109460b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56, skipping insertion in model container [2025-03-13 22:21:56,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,227 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:21:56,516 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,517 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,519 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,520 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,555 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:56,578 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:21:56,617 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,621 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,621 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,622 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:21:56,636 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:21:56,676 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:21:56,677 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56 WrapperNode [2025-03-13 22:21:56,677 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:21:56,678 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:56,678 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:21:56,678 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:21:56,682 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,694 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,726 INFO L138 Inliner]: procedures = 281, calls = 126, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 412 [2025-03-13 22:21:56,726 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:21:56,727 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:21:56,727 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:21:56,727 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:21:56,733 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,733 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,738 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,753 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,758 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,760 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,764 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:21:56,765 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:21:56,765 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:21:56,765 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:21:56,766 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (1/1) ... [2025-03-13 22:21:56,771 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:21:56,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:21:56,801 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:21:56,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:21:56,822 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:21:56,822 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:21:56,822 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:21:56,823 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:21:56,945 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:21:56,947 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:21:57,433 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L1082: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-13 22:21:57,434 INFO L1326 $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-13 22:21:57,531 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:21:57,532 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:21:57,532 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:21:57,564 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:21:57,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:57 BoogieIcfgContainer [2025-03-13 22:21:57,565 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:21:57,569 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:21:57,569 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:21:57,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:21:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:21:56" (1/3) ... [2025-03-13 22:21:57,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1866fd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:57, skipping insertion in model container [2025-03-13 22:21:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:21:56" (2/3) ... [2025-03-13 22:21:57,576 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1866fd7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:21:57, skipping insertion in model container [2025-03-13 22:21:57,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:21:57" (3/3) ... [2025-03-13 22:21:57,577 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_93-evilcollapse_racefree.i [2025-03-13 22:21:57,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:21:57,589 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-13 22:21:57,589 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:21:57,670 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:21:57,709 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 453 places, 472 transitions, 951 flow [2025-03-13 22:21:57,891 INFO L124 PetriNetUnfolderBase]: 22/502 cut-off events. [2025-03-13 22:21:57,894 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:21:57,898 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-13 22:21:57,899 INFO L82 GeneralOperation]: Start removeDead. Operand has 453 places, 472 transitions, 951 flow [2025-03-13 22:21:57,905 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 453 places, 472 transitions, 951 flow [2025-03-13 22:21:57,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:21:57,927 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;@31b87db7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:21:57,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2025-03-13 22:21:57,957 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:21:57,957 INFO L124 PetriNetUnfolderBase]: 0/124 cut-off events. [2025-03-13 22:21:57,957 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:21:57,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:57,958 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-13 22:21:57,958 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-13 22:21:57,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:57,965 INFO L85 PathProgramCache]: Analyzing trace with hash 603167492, now seen corresponding path program 1 times [2025-03-13 22:21:57,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:57,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612754141] [2025-03-13 22:21:57,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:58,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-13 22:21:58,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-13 22:21:58,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:58,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:21:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:21:58,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:21:58,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612754141] [2025-03-13 22:21:58,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612754141] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:21:58,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:21:58,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:21:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1285513829] [2025-03-13 22:21:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:21:58,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:21:58,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:21:58,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:21:58,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:21:59,458 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-13 22:21:59,467 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-13 22:21:59,468 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:21:59,468 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-13 22:21:59,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:21:59,888 INFO L124 PetriNetUnfolderBase]: 320/1662 cut-off events. [2025-03-13 22:21:59,888 INFO L125 PetriNetUnfolderBase]: For 7/15 co-relation queries the response was YES. [2025-03-13 22:21:59,895 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-13 22:21:59,902 INFO L140 encePairwiseOnDemand]: 445/472 looper letters, 88 selfloop transitions, 10 changer transitions 2/453 dead transitions. [2025-03-13 22:21:59,904 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 453 transitions, 1109 flow [2025-03-13 22:21:59,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:21:59,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:21:59,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-13 22:21:59,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-13 22:21:59,930 INFO L175 Difference]: Start difference. First operand has 453 places, 472 transitions, 951 flow. Second operand 6 states and 2251 transitions. [2025-03-13 22:21:59,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 453 transitions, 1109 flow [2025-03-13 22:21:59,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 454 places, 453 transitions, 1109 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:21:59,947 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 929 flow [2025-03-13 22:21:59,950 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-13 22:21:59,953 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-13 22:21:59,954 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 929 flow [2025-03-13 22:21:59,956 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-13 22:21:59,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:21:59,956 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-13 22:21:59,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:21:59,956 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-13 22:21:59,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:21:59,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1805401345, now seen corresponding path program 1 times [2025-03-13 22:21:59,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:21:59,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995925679] [2025-03-13 22:21:59,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:21:59,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:21:59,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-13 22:21:59,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-13 22:21:59,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:21:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:00,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:00,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:00,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995925679] [2025-03-13 22:22:00,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995925679] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:00,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:00,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41955379] [2025-03-13 22:22:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:00,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:00,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:00,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:00,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:00,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 356 out of 472 [2025-03-13 22:22:00,872 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-13 22:22:00,873 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:00,873 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 356 of 472 [2025-03-13 22:22:00,873 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:01,127 INFO L124 PetriNetUnfolderBase]: 320/1658 cut-off events. [2025-03-13 22:22:01,127 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-13 22:22:01,129 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-13 22:22:01,133 INFO L140 encePairwiseOnDemand]: 460/472 looper letters, 88 selfloop transitions, 10 changer transitions 0/449 dead transitions. [2025-03-13 22:22:01,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 449 transitions, 1121 flow [2025-03-13 22:22:01,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:01,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:01,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2236 transitions. [2025-03-13 22:22:01,138 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.78954802259887 [2025-03-13 22:22:01,139 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 929 flow. Second operand 6 states and 2236 transitions. [2025-03-13 22:22:01,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 449 transitions, 1121 flow [2025-03-13 22:22:01,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 449 transitions, 1101 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:01,146 INFO L231 Difference]: Finished difference. Result has 450 places, 449 transitions, 925 flow [2025-03-13 22:22:01,147 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-13 22:22:01,148 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-13 22:22:01,149 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 449 transitions, 925 flow [2025-03-13 22:22:01,150 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-13 22:22:01,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:01,151 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-13 22:22:01,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:22:01,152 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-13 22:22:01,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 2046444812, now seen corresponding path program 1 times [2025-03-13 22:22:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:01,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342506599] [2025-03-13 22:22:01,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:01,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:01,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-13 22:22:01,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-13 22:22:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:01,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:01,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:01,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342506599] [2025-03-13 22:22:01,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342506599] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:01,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:01,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:22:01,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8948189] [2025-03-13 22:22:01,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:01,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:01,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:01,262 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:01,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:01,277 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-13 22:22:01,279 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-13 22:22:01,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:01,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-13 22:22:01,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:01,347 INFO L124 PetriNetUnfolderBase]: 16/627 cut-off events. [2025-03-13 22:22:01,347 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:22:01,348 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-13 22:22:01,349 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-13 22:22:01,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 450 transitions, 961 flow [2025-03-13 22:22:01,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:01,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:01,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-13 22:22:01,352 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-13 22:22:01,352 INFO L175 Difference]: Start difference. First operand has 450 places, 449 transitions, 925 flow. Second operand 3 states and 1338 transitions. [2025-03-13 22:22:01,352 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 450 transitions, 961 flow [2025-03-13 22:22:01,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 447 places, 450 transitions, 941 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:01,360 INFO L231 Difference]: Finished difference. Result has 448 places, 450 transitions, 917 flow [2025-03-13 22:22:01,360 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-13 22:22:01,361 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-13 22:22:01,361 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 450 transitions, 917 flow [2025-03-13 22:22:01,362 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-13 22:22:01,362 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:01,362 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-13 22:22:01,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:22:01,362 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-13 22:22:01,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:01,363 INFO L85 PathProgramCache]: Analyzing trace with hash -32389628, now seen corresponding path program 1 times [2025-03-13 22:22:01,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:01,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050275249] [2025-03-13 22:22:01,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:01,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:01,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-13 22:22:01,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-13 22:22:01,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:01,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:01,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:01,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:01,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050275249] [2025-03-13 22:22:01,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050275249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:01,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:01,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:01,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709851248] [2025-03-13 22:22:01,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:01,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:01,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:01,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:01,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:02,103 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-13 22:22:02,106 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-13 22:22:02,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:02,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-13 22:22:02,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:02,318 INFO L124 PetriNetUnfolderBase]: 321/1780 cut-off events. [2025-03-13 22:22:02,318 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-03-13 22:22:02,321 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-13 22:22:02,325 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-13 22:22:02,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 452 places, 449 transitions, 1115 flow [2025-03-13 22:22:02,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:02,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:02,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-13 22:22:02,330 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-13 22:22:02,330 INFO L175 Difference]: Start difference. First operand has 448 places, 450 transitions, 917 flow. Second operand 6 states and 2231 transitions. [2025-03-13 22:22:02,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 452 places, 449 transitions, 1115 flow [2025-03-13 22:22:02,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 449 transitions, 1113 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:02,336 INFO L231 Difference]: Finished difference. Result has 451 places, 449 transitions, 923 flow [2025-03-13 22:22:02,337 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-13 22:22:02,337 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-13 22:22:02,337 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 449 transitions, 923 flow [2025-03-13 22:22:02,339 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-13 22:22:02,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:02,339 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-13 22:22:02,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:22:02,339 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-13 22:22:02,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:02,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1384782310, now seen corresponding path program 1 times [2025-03-13 22:22:02,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:02,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113516885] [2025-03-13 22:22:02,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:02,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:02,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-13 22:22:02,358 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-13 22:22:02,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:02,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:02,402 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-13 22:22:02,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:02,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113516885] [2025-03-13 22:22:02,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113516885] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:02,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:02,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:22:02,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364803528] [2025-03-13 22:22:02,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:02,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:02,404 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:02,416 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-13 22:22:02,417 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-13 22:22:02,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:02,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-13 22:22:02,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:02,497 INFO L124 PetriNetUnfolderBase]: 16/813 cut-off events. [2025-03-13 22:22:02,497 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:22:02,499 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-13 22:22:02,500 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 15 selfloop transitions, 2 changer transitions 0/450 dead transitions. [2025-03-13 22:22:02,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 450 transitions, 959 flow [2025-03-13 22:22:02,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:02,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:02,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1338 transitions. [2025-03-13 22:22:02,505 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9449152542372882 [2025-03-13 22:22:02,505 INFO L175 Difference]: Start difference. First operand has 451 places, 449 transitions, 923 flow. Second operand 3 states and 1338 transitions. [2025-03-13 22:22:02,505 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 450 transitions, 959 flow [2025-03-13 22:22:02,508 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 450 transitions, 949 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:02,513 INFO L231 Difference]: Finished difference. Result has 449 places, 450 transitions, 925 flow [2025-03-13 22:22:02,514 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-13 22:22:02,515 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-13 22:22:02,516 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 450 transitions, 925 flow [2025-03-13 22:22:02,517 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-13 22:22:02,517 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:02,517 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-13 22:22:02,517 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:22:02,517 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-13 22:22:02,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:02,518 INFO L85 PathProgramCache]: Analyzing trace with hash 85501322, now seen corresponding path program 1 times [2025-03-13 22:22:02,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:02,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082597750] [2025-03-13 22:22:02,518 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:02,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:02,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-13 22:22:02,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-13 22:22:02,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:02,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:03,011 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:22:03,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:03,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082597750] [2025-03-13 22:22:03,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082597750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:03,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:03,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:03,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594783434] [2025-03-13 22:22:03,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:03,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:03,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:03,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:03,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:03,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-13 22:22:03,502 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-13 22:22:03,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:03,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-13 22:22:03,502 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:03,710 INFO L124 PetriNetUnfolderBase]: 84/1123 cut-off events. [2025-03-13 22:22:03,711 INFO L125 PetriNetUnfolderBase]: For 10/14 co-relation queries the response was YES. [2025-03-13 22:22:03,712 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-13 22:22:03,715 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/449 dead transitions. [2025-03-13 22:22:03,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 449 transitions, 1057 flow [2025-03-13 22:22:03,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:03,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:03,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-13 22:22:03,719 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-13 22:22:03,719 INFO L175 Difference]: Start difference. First operand has 449 places, 450 transitions, 925 flow. Second operand 6 states and 2396 transitions. [2025-03-13 22:22:03,719 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 449 transitions, 1057 flow [2025-03-13 22:22:03,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 452 places, 449 transitions, 1055 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:03,725 INFO L231 Difference]: Finished difference. Result has 452 places, 449 transitions, 931 flow [2025-03-13 22:22:03,726 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-13 22:22:03,726 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -1 predicate places. [2025-03-13 22:22:03,726 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 449 transitions, 931 flow [2025-03-13 22:22:03,727 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-13 22:22:03,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:03,728 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-13 22:22:03,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:22:03,728 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-13 22:22:03,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:03,729 INFO L85 PathProgramCache]: Analyzing trace with hash -2013175932, now seen corresponding path program 1 times [2025-03-13 22:22:03,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:03,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266070694] [2025-03-13 22:22:03,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:03,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:03,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 179 statements into 1 equivalence classes. [2025-03-13 22:22:03,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 179 of 179 statements. [2025-03-13 22:22:03,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:03,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:04,168 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-13 22:22:04,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:04,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266070694] [2025-03-13 22:22:04,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266070694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:04,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:04,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:04,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120213778] [2025-03-13 22:22:04,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:04,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:04,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:04,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:04,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:04,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 355 out of 472 [2025-03-13 22:22:04,528 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-13 22:22:04,528 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:04,528 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 355 of 472 [2025-03-13 22:22:04,528 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:04,877 INFO L124 PetriNetUnfolderBase]: 321/1960 cut-off events. [2025-03-13 22:22:04,877 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:22:04,880 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-13 22:22:04,884 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 95 selfloop transitions, 5 changer transitions 0/448 dead transitions. [2025-03-13 22:22:04,884 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 448 transitions, 1129 flow [2025-03-13 22:22:04,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:04,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:04,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2231 transitions. [2025-03-13 22:22:04,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7877824858757062 [2025-03-13 22:22:04,888 INFO L175 Difference]: Start difference. First operand has 452 places, 449 transitions, 931 flow. Second operand 6 states and 2231 transitions. [2025-03-13 22:22:04,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 448 transitions, 1129 flow [2025-03-13 22:22:04,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 448 transitions, 1119 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:04,893 INFO L231 Difference]: Finished difference. Result has 451 places, 448 transitions, 929 flow [2025-03-13 22:22:04,894 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-13 22:22:04,894 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -2 predicate places. [2025-03-13 22:22:04,895 INFO L471 AbstractCegarLoop]: Abstraction has has 451 places, 448 transitions, 929 flow [2025-03-13 22:22:04,896 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-13 22:22:04,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:04,896 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-13 22:22:04,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:22:04,896 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-13 22:22:04,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:04,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1298391239, now seen corresponding path program 1 times [2025-03-13 22:22:04,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:04,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [633412746] [2025-03-13 22:22:04,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:04,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:04,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-03-13 22:22:04,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-03-13 22:22:04,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:04,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:05,302 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-13 22:22:05,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:05,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [633412746] [2025-03-13 22:22:05,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [633412746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:05,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:05,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:05,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384401368] [2025-03-13 22:22:05,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:05,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:05,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:05,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:05,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:05,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-13 22:22:05,639 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-13 22:22:05,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:05,639 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-13 22:22:05,639 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:06,015 INFO L124 PetriNetUnfolderBase]: 321/1956 cut-off events. [2025-03-13 22:22:06,015 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:22:06,018 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-13 22:22:06,022 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/447 dead transitions. [2025-03-13 22:22:06,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 455 places, 447 transitions, 1119 flow [2025-03-13 22:22:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-13 22:22:06,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-13 22:22:06,026 INFO L175 Difference]: Start difference. First operand has 451 places, 448 transitions, 929 flow. Second operand 6 states and 2251 transitions. [2025-03-13 22:22:06,026 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 455 places, 447 transitions, 1119 flow [2025-03-13 22:22:06,030 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 450 places, 447 transitions, 1109 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:06,033 INFO L231 Difference]: Finished difference. Result has 450 places, 447 transitions, 927 flow [2025-03-13 22:22:06,034 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-13 22:22:06,036 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -3 predicate places. [2025-03-13 22:22:06,036 INFO L471 AbstractCegarLoop]: Abstraction has has 450 places, 447 transitions, 927 flow [2025-03-13 22:22:06,037 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-13 22:22:06,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:06,037 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-13 22:22:06,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:22:06,038 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-13 22:22:06,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:06,039 INFO L85 PathProgramCache]: Analyzing trace with hash -1090269248, now seen corresponding path program 1 times [2025-03-13 22:22:06,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:06,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622490224] [2025-03-13 22:22:06,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:06,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:06,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-13 22:22:06,069 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-13 22:22:06,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:06,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:06,437 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-13 22:22:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622490224] [2025-03-13 22:22:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622490224] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402999893] [2025-03-13 22:22:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:06,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:06,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:06,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:06,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:06,791 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 359 out of 472 [2025-03-13 22:22:06,793 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-13 22:22:06,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:06,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 359 of 472 [2025-03-13 22:22:06,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:07,177 INFO L124 PetriNetUnfolderBase]: 321/1952 cut-off events. [2025-03-13 22:22:07,177 INFO L125 PetriNetUnfolderBase]: For 15/23 co-relation queries the response was YES. [2025-03-13 22:22:07,179 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-13 22:22:07,187 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 91 selfloop transitions, 5 changer transitions 0/446 dead transitions. [2025-03-13 22:22:07,187 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 454 places, 446 transitions, 1117 flow [2025-03-13 22:22:07,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:07,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2251 transitions. [2025-03-13 22:22:07,193 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7948446327683616 [2025-03-13 22:22:07,193 INFO L175 Difference]: Start difference. First operand has 450 places, 447 transitions, 927 flow. Second operand 6 states and 2251 transitions. [2025-03-13 22:22:07,193 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 454 places, 446 transitions, 1117 flow [2025-03-13 22:22:07,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 449 places, 446 transitions, 1107 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:07,200 INFO L231 Difference]: Finished difference. Result has 449 places, 446 transitions, 925 flow [2025-03-13 22:22:07,201 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-13 22:22:07,203 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -4 predicate places. [2025-03-13 22:22:07,203 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 446 transitions, 925 flow [2025-03-13 22:22:07,204 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-13 22:22:07,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:07,205 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-13 22:22:07,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:22:07,205 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-13 22:22:07,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:07,206 INFO L85 PathProgramCache]: Analyzing trace with hash -282901329, now seen corresponding path program 1 times [2025-03-13 22:22:07,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:07,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179060948] [2025-03-13 22:22:07,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:07,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:07,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-13 22:22:07,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-13 22:22:07,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:07,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:07,787 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-13 22:22:07,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:07,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179060948] [2025-03-13 22:22:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179060948] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203029408] [2025-03-13 22:22:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:07,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:07,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:07,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:08,171 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 354 out of 472 [2025-03-13 22:22:08,174 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-13 22:22:08,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:08,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 354 of 472 [2025-03-13 22:22:08,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:08,628 INFO L124 PetriNetUnfolderBase]: 321/1948 cut-off events. [2025-03-13 22:22:08,628 INFO L125 PetriNetUnfolderBase]: For 19/27 co-relation queries the response was YES. [2025-03-13 22:22:08,632 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-13 22:22:08,639 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 96 selfloop transitions, 5 changer transitions 0/445 dead transitions. [2025-03-13 22:22:08,639 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 445 transitions, 1125 flow [2025-03-13 22:22:08,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:08,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2226 transitions. [2025-03-13 22:22:08,645 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7860169491525424 [2025-03-13 22:22:08,645 INFO L175 Difference]: Start difference. First operand has 449 places, 446 transitions, 925 flow. Second operand 6 states and 2226 transitions. [2025-03-13 22:22:08,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 445 transitions, 1125 flow [2025-03-13 22:22:08,648 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 448 places, 445 transitions, 1115 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:08,653 INFO L231 Difference]: Finished difference. Result has 448 places, 445 transitions, 923 flow [2025-03-13 22:22:08,654 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-13 22:22:08,655 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, -5 predicate places. [2025-03-13 22:22:08,655 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 445 transitions, 923 flow [2025-03-13 22:22:08,656 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-13 22:22:08,656 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:08,656 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-13 22:22:08,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:22:08,657 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-13 22:22:08,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:08,658 INFO L85 PathProgramCache]: Analyzing trace with hash -763286831, now seen corresponding path program 1 times [2025-03-13 22:22:08,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:08,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606925611] [2025-03-13 22:22:08,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:08,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:08,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-13 22:22:08,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-13 22:22:08,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:08,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:08,813 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-13 22:22:08,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606925611] [2025-03-13 22:22:08,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606925611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:08,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84592893] [2025-03-13 22:22:08,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:08,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:08,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:08,817 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-13 22:22:08,818 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-13 22:22:08,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-13 22:22:09,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-13 22:22:09,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:09,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:09,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:22:09,016 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:09,179 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-13 22:22:09,180 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:09,302 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-13 22:22:09,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84592893] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:09,307 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:09,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:22:09,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673932966] [2025-03-13 22:22:09,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:09,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:22:09,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:09,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:22:09,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:22:09,329 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-13 22:22:09,332 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-13 22:22:09,332 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:09,332 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-13 22:22:09,332 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:09,502 INFO L124 PetriNetUnfolderBase]: 16/977 cut-off events. [2025-03-13 22:22:09,503 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-03-13 22:22:09,504 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-13 22:22:09,506 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 19 selfloop transitions, 9 changer transitions 0/453 dead transitions. [2025-03-13 22:22:09,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 456 places, 453 transitions, 997 flow [2025-03-13 22:22:09,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:22:09,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:22:09,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3963 transitions. [2025-03-13 22:22:09,512 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.932909604519774 [2025-03-13 22:22:09,513 INFO L175 Difference]: Start difference. First operand has 448 places, 445 transitions, 923 flow. Second operand 9 states and 3963 transitions. [2025-03-13 22:22:09,513 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 456 places, 453 transitions, 997 flow [2025-03-13 22:22:09,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 451 places, 453 transitions, 987 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:09,520 INFO L231 Difference]: Finished difference. Result has 454 places, 451 transitions, 963 flow [2025-03-13 22:22:09,520 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-13 22:22:09,521 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 1 predicate places. [2025-03-13 22:22:09,521 INFO L471 AbstractCegarLoop]: Abstraction has has 454 places, 451 transitions, 963 flow [2025-03-13 22:22:09,522 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-13 22:22:09,523 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:09,523 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-13 22:22:09,531 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-13 22:22:09,727 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-13 22:22:09,727 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-13 22:22:09,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:09,728 INFO L85 PathProgramCache]: Analyzing trace with hash 46327807, now seen corresponding path program 2 times [2025-03-13 22:22:09,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:09,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208727439] [2025-03-13 22:22:09,728 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:09,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:09,796 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 418 statements into 2 equivalence classes. [2025-03-13 22:22:09,801 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 418 statements. [2025-03-13 22:22:09,801 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:09,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:10,054 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-13 22:22:10,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:10,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208727439] [2025-03-13 22:22:10,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208727439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499183513] [2025-03-13 22:22:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:10,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:10,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:10,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:10,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-13 22:22:10,970 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-13 22:22:10,970 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:10,970 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-13 22:22:10,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:11,140 INFO L124 PetriNetUnfolderBase]: 84/1290 cut-off events. [2025-03-13 22:22:11,140 INFO L125 PetriNetUnfolderBase]: For 18/22 co-relation queries the response was YES. [2025-03-13 22:22:11,142 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-13 22:22:11,144 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/450 dead transitions. [2025-03-13 22:22:11,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 458 places, 450 transitions, 1095 flow [2025-03-13 22:22:11,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:11,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:11,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-13 22:22:11,149 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-13 22:22:11,149 INFO L175 Difference]: Start difference. First operand has 454 places, 451 transitions, 963 flow. Second operand 6 states and 2396 transitions. [2025-03-13 22:22:11,149 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 458 places, 450 transitions, 1095 flow [2025-03-13 22:22:11,151 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 457 places, 450 transitions, 1089 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:22:11,155 INFO L231 Difference]: Finished difference. Result has 457 places, 450 transitions, 965 flow [2025-03-13 22:22:11,156 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-13 22:22:11,156 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 4 predicate places. [2025-03-13 22:22:11,156 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 450 transitions, 965 flow [2025-03-13 22:22:11,157 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-13 22:22:11,157 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:11,157 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-13 22:22:11,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:22:11,158 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-13 22:22:11,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:11,159 INFO L85 PathProgramCache]: Analyzing trace with hash -573082179, now seen corresponding path program 1 times [2025-03-13 22:22:11,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:11,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [288264896] [2025-03-13 22:22:11,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:11,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:11,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-13 22:22:11,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-13 22:22:11,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:11,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:11,446 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-13 22:22:11,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [288264896] [2025-03-13 22:22:11,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [288264896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:11,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1972560914] [2025-03-13 22:22:11,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:11,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:11,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:11,449 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-13 22:22:11,450 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-13 22:22:11,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-13 22:22:11,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-13 22:22:11,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:11,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:11,747 INFO L256 TraceCheckSpWp]: Trace formula consists of 1487 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:22:11,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:12,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-13 22:22:12,086 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:12,451 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-13 22:22:12,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1972560914] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:12,451 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:12,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-13 22:22:12,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053678005] [2025-03-13 22:22:12,452 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:12,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 22:22:12,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:12,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 22:22:12,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-13 22:22:12,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 472 [2025-03-13 22:22:12,550 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-13 22:22:12,550 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:12,550 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 472 [2025-03-13 22:22:12,550 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:13,632 INFO L124 PetriNetUnfolderBase]: 17/2356 cut-off events. [2025-03-13 22:22:13,632 INFO L125 PetriNetUnfolderBase]: For 81/82 co-relation queries the response was YES. [2025-03-13 22:22:13,633 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-13 22:22:13,636 INFO L140 encePairwiseOnDemand]: 461/472 looper letters, 51 selfloop transitions, 68 changer transitions 0/536 dead transitions. [2025-03-13 22:22:13,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 519 places, 536 transitions, 1613 flow [2025-03-13 22:22:13,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-13 22:22:13,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-13 22:22:13,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 27285 transitions. [2025-03-13 22:22:13,657 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175746569814366 [2025-03-13 22:22:13,657 INFO L175 Difference]: Start difference. First operand has 457 places, 450 transitions, 965 flow. Second operand 63 states and 27285 transitions. [2025-03-13 22:22:13,657 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 519 places, 536 transitions, 1613 flow [2025-03-13 22:22:13,660 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 514 places, 536 transitions, 1603 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:13,663 INFO L231 Difference]: Finished difference. Result has 530 places, 512 transitions, 1475 flow [2025-03-13 22:22:13,664 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-13 22:22:13,664 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 77 predicate places. [2025-03-13 22:22:13,664 INFO L471 AbstractCegarLoop]: Abstraction has has 530 places, 512 transitions, 1475 flow [2025-03-13 22:22:13,666 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-13 22:22:13,667 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:13,667 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-13 22:22:13,677 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:22:13,867 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-13 22:22:13,868 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-13 22:22:13,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:13,870 INFO L85 PathProgramCache]: Analyzing trace with hash -1491457430, now seen corresponding path program 2 times [2025-03-13 22:22:13,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:13,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743333048] [2025-03-13 22:22:13,870 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:13,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:14,044 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1437 statements into 2 equivalence classes. [2025-03-13 22:22:14,048 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 1437 statements. [2025-03-13 22:22:14,048 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:14,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:14,215 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-13 22:22:14,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:14,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743333048] [2025-03-13 22:22:14,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743333048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:14,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:14,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:14,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846181879] [2025-03-13 22:22:14,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:14,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:14,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:14,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:14,217 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:14,999 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 472 [2025-03-13 22:22:15,001 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-13 22:22:15,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:15,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 472 [2025-03-13 22:22:15,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:15,785 INFO L124 PetriNetUnfolderBase]: 85/2669 cut-off events. [2025-03-13 22:22:15,785 INFO L125 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-03-13 22:22:15,787 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-13 22:22:15,791 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 62 selfloop transitions, 5 changer transitions 0/511 dead transitions. [2025-03-13 22:22:15,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 511 transitions, 1607 flow [2025-03-13 22:22:15,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:15,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:15,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2396 transitions. [2025-03-13 22:22:15,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.846045197740113 [2025-03-13 22:22:15,793 INFO L175 Difference]: Start difference. First operand has 530 places, 512 transitions, 1475 flow. Second operand 6 states and 2396 transitions. [2025-03-13 22:22:15,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 511 transitions, 1607 flow [2025-03-13 22:22:15,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 527 places, 511 transitions, 1531 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-13 22:22:15,804 INFO L231 Difference]: Finished difference. Result has 527 places, 511 transitions, 1407 flow [2025-03-13 22:22:15,805 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-13 22:22:15,806 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 74 predicate places. [2025-03-13 22:22:15,806 INFO L471 AbstractCegarLoop]: Abstraction has has 527 places, 511 transitions, 1407 flow [2025-03-13 22:22:15,807 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-13 22:22:15,807 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:15,808 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-13 22:22:15,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:22:15,808 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-13 22:22:15,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:15,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1232129805, now seen corresponding path program 1 times [2025-03-13 22:22:15,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:15,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262813771] [2025-03-13 22:22:15,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:15,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:15,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-13 22:22:16,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-13 22:22:16,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:16,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:18,714 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-13 22:22:18,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262813771] [2025-03-13 22:22:18,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262813771] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:18,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18647003] [2025-03-13 22:22:18,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:18,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:18,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:18,717 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-13 22:22:18,719 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-13 22:22:19,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1456 statements into 1 equivalence classes. [2025-03-13 22:22:19,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1456 of 1456 statements. [2025-03-13 22:22:19,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:19,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:19,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 5710 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:22:19,760 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:20,272 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-13 22:22:20,272 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:20,964 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-13 22:22:20,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18647003] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:20,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:20,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 22:22:20,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146450475] [2025-03-13 22:22:20,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:20,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:22:20,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:20,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:22:20,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 22:22:20,998 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-13 22:22:21,009 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-13 22:22:21,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:21,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-13 22:22:21,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:22,907 INFO L124 PetriNetUnfolderBase]: 17/4515 cut-off events. [2025-03-13 22:22:22,908 INFO L125 PetriNetUnfolderBase]: For 3212/3213 co-relation queries the response was YES. [2025-03-13 22:22:22,912 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-13 22:22:22,917 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 51 selfloop transitions, 135 changer transitions 0/612 dead transitions. [2025-03-13 22:22:22,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 571 places, 612 transitions, 2543 flow [2025-03-13 22:22:22,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 22:22:22,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 22:22:22,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19749 transitions. [2025-03-13 22:22:22,924 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9298022598870056 [2025-03-13 22:22:22,924 INFO L175 Difference]: Start difference. First operand has 527 places, 511 transitions, 1407 flow. Second operand 45 states and 19749 transitions. [2025-03-13 22:22:22,924 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 571 places, 612 transitions, 2543 flow [2025-03-13 22:22:22,931 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 566 places, 612 transitions, 2533 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:22:22,935 INFO L231 Difference]: Finished difference. Result has 575 places, 586 transitions, 2271 flow [2025-03-13 22:22:22,936 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-13 22:22:22,936 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 122 predicate places. [2025-03-13 22:22:22,936 INFO L471 AbstractCegarLoop]: Abstraction has has 575 places, 586 transitions, 2271 flow [2025-03-13 22:22:22,939 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-13 22:22:22,939 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:22,940 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-13 22:22:22,957 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-13 22:22:23,140 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-13 22:22:23,141 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-13 22:22:23,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:23,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1826167309, now seen corresponding path program 2 times [2025-03-13 22:22:23,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:23,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567535331] [2025-03-13 22:22:23,146 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:22:23,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:23,444 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2896 statements into 2 equivalence classes. [2025-03-13 22:22:23,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 138 of 2896 statements. [2025-03-13 22:22:23,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:22:23,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:23,631 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-13 22:22:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:23,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567535331] [2025-03-13 22:22:23,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567535331] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:23,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:23,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008963932] [2025-03-13 22:22:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:23,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:22:23,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:23,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:22:23,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:22:24,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 352 out of 472 [2025-03-13 22:22:24,013 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-13 22:22:24,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:24,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 352 of 472 [2025-03-13 22:22:24,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:27,636 INFO L124 PetriNetUnfolderBase]: 741/7068 cut-off events. [2025-03-13 22:22:27,636 INFO L125 PetriNetUnfolderBase]: For 1238/1252 co-relation queries the response was YES. [2025-03-13 22:22:27,650 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-13 22:22:27,658 INFO L140 encePairwiseOnDemand]: 437/472 looper letters, 135 selfloop transitions, 118 changer transitions 0/735 dead transitions. [2025-03-13 22:22:27,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 580 places, 735 transitions, 3075 flow [2025-03-13 22:22:27,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:27,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:27,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2366 transitions. [2025-03-13 22:22:27,662 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.83545197740113 [2025-03-13 22:22:27,662 INFO L175 Difference]: Start difference. First operand has 575 places, 586 transitions, 2271 flow. Second operand 6 states and 2366 transitions. [2025-03-13 22:22:27,662 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 580 places, 735 transitions, 3075 flow [2025-03-13 22:22:27,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 562 places, 735 transitions, 2967 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-13 22:22:27,678 INFO L231 Difference]: Finished difference. Result has 567 places, 703 transitions, 2937 flow [2025-03-13 22:22:27,678 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-13 22:22:27,679 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 114 predicate places. [2025-03-13 22:22:27,679 INFO L471 AbstractCegarLoop]: Abstraction has has 567 places, 703 transitions, 2937 flow [2025-03-13 22:22:27,679 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-13 22:22:27,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:27,680 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-13 22:22:27,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:22:27,680 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-13 22:22:27,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:27,686 INFO L85 PathProgramCache]: Analyzing trace with hash -915891560, now seen corresponding path program 1 times [2025-03-13 22:22:27,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:27,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446224612] [2025-03-13 22:22:27,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:27,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:27,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2896 statements into 1 equivalence classes. [2025-03-13 22:22:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2896 of 2896 statements. [2025-03-13 22:22:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:28,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:30,237 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-13 22:22:30,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:30,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446224612] [2025-03-13 22:22:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446224612] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:30,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:30,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:22:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588063405] [2025-03-13 22:22:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:30,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:22:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:30,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:22:30,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:22:30,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 440 out of 472 [2025-03-13 22:22:30,259 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-13 22:22:30,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:30,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 440 of 472 [2025-03-13 22:22:30,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:33,086 INFO L124 PetriNetUnfolderBase]: 230/5691 cut-off events. [2025-03-13 22:22:33,086 INFO L125 PetriNetUnfolderBase]: For 1392/1434 co-relation queries the response was YES. [2025-03-13 22:22:33,095 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-13 22:22:33,100 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 22 selfloop transitions, 3 changer transitions 0/711 dead transitions. [2025-03-13 22:22:33,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 569 places, 711 transitions, 3003 flow [2025-03-13 22:22:33,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:22:33,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:22:33,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1345 transitions. [2025-03-13 22:22:33,101 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9498587570621468 [2025-03-13 22:22:33,101 INFO L175 Difference]: Start difference. First operand has 567 places, 703 transitions, 2937 flow. Second operand 3 states and 1345 transitions. [2025-03-13 22:22:33,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 569 places, 711 transitions, 3003 flow [2025-03-13 22:22:33,111 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 569 places, 711 transitions, 3003 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:22:33,117 INFO L231 Difference]: Finished difference. Result has 570 places, 703 transitions, 2948 flow [2025-03-13 22:22:33,117 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-13 22:22:33,118 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 117 predicate places. [2025-03-13 22:22:33,118 INFO L471 AbstractCegarLoop]: Abstraction has has 570 places, 703 transitions, 2948 flow [2025-03-13 22:22:33,118 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-13 22:22:33,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:33,119 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-13 22:22:33,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-13 22:22:33,119 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-13 22:22:33,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:33,126 INFO L85 PathProgramCache]: Analyzing trace with hash -244534679, now seen corresponding path program 1 times [2025-03-13 22:22:33,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:33,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244024192] [2025-03-13 22:22:33,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:33,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:33,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2910 statements into 1 equivalence classes. [2025-03-13 22:22:33,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2910 of 2910 statements. [2025-03-13 22:22:33,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:33,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:36,279 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-13 22:22:36,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:36,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244024192] [2025-03-13 22:22:36,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244024192] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:22:36,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:22:36,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:22:36,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212402531] [2025-03-13 22:22:36,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:22:36,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:22:36,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:36,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:22:36,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:22:36,306 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 438 out of 472 [2025-03-13 22:22:36,307 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-13 22:22:36,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:36,307 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 438 of 472 [2025-03-13 22:22:36,307 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:22:38,559 INFO L124 PetriNetUnfolderBase]: 304/5780 cut-off events. [2025-03-13 22:22:38,559 INFO L125 PetriNetUnfolderBase]: For 1410/1436 co-relation queries the response was YES. [2025-03-13 22:22:38,572 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-13 22:22:38,580 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 34 selfloop transitions, 5 changer transitions 0/704 dead transitions. [2025-03-13 22:22:38,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 553 places, 704 transitions, 3023 flow [2025-03-13 22:22:38,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:22:38,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:22:38,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2667 transitions. [2025-03-13 22:22:38,582 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9417372881355932 [2025-03-13 22:22:38,582 INFO L175 Difference]: Start difference. First operand has 570 places, 703 transitions, 2948 flow. Second operand 6 states and 2667 transitions. [2025-03-13 22:22:38,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 553 places, 704 transitions, 3023 flow [2025-03-13 22:22:38,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 550 places, 704 transitions, 3014 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-03-13 22:22:38,600 INFO L231 Difference]: Finished difference. Result has 550 places, 680 transitions, 2898 flow [2025-03-13 22:22:38,601 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-13 22:22:38,601 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 97 predicate places. [2025-03-13 22:22:38,601 INFO L471 AbstractCegarLoop]: Abstraction has has 550 places, 680 transitions, 2898 flow [2025-03-13 22:22:38,602 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-13 22:22:38,602 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:22:38,602 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-13 22:22:38,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:22:38,603 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-13 22:22:38,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:22:38,609 INFO L85 PathProgramCache]: Analyzing trace with hash -1439383810, now seen corresponding path program 1 times [2025-03-13 22:22:38,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:22:38,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546498037] [2025-03-13 22:22:38,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:38,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:22:38,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-13 22:22:39,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-13 22:22:39,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:39,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:48,777 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-13 22:22:48,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:22:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546498037] [2025-03-13 22:22:48,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546498037] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:22:48,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331721725] [2025-03-13 22:22:48,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:22:48,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:22:48,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:22:48,780 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-13 22:22:48,783 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-13 22:22:50,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2911 statements into 1 equivalence classes. [2025-03-13 22:22:51,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2911 of 2911 statements. [2025-03-13 22:22:51,018 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:22:51,018 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:22:51,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 11659 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 22:22:51,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:22:52,058 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-13 22:22:52,059 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:22:53,566 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-13 22:22:53,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331721725] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:22:53,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:22:53,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-13 22:22:53,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182304901] [2025-03-13 22:22:53,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:22:53,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-13 22:22:53,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:22:53,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-13 22:22:53,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-13 22:22:53,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 437 out of 472 [2025-03-13 22:22:53,677 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-13 22:22:53,677 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:22:53,677 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 437 of 472 [2025-03-13 22:22:53,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:23:01,015 INFO L124 PetriNetUnfolderBase]: 198/9518 cut-off events. [2025-03-13 22:23:01,015 INFO L125 PetriNetUnfolderBase]: For 13554/13601 co-relation queries the response was YES. [2025-03-13 22:23:01,030 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-13 22:23:01,038 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 94 selfloop transitions, 270 changer transitions 0/886 dead transitions. [2025-03-13 22:23:01,038 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 639 places, 886 transitions, 5812 flow [2025-03-13 22:23:01,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-13 22:23:01,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-13 22:23:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 39479 transitions. [2025-03-13 22:23:01,060 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9293549905838041 [2025-03-13 22:23:01,060 INFO L175 Difference]: Start difference. First operand has 550 places, 680 transitions, 2898 flow. Second operand 90 states and 39479 transitions. [2025-03-13 22:23:01,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 639 places, 886 transitions, 5812 flow [2025-03-13 22:23:01,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 635 places, 886 transitions, 5803 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-03-13 22:23:01,082 INFO L231 Difference]: Finished difference. Result has 651 places, 818 transitions, 4881 flow [2025-03-13 22:23:01,083 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-13 22:23:01,083 INFO L279 CegarLoopForPetriNet]: 453 programPoint places, 198 predicate places. [2025-03-13 22:23:01,083 INFO L471 AbstractCegarLoop]: Abstraction has has 651 places, 818 transitions, 4881 flow [2025-03-13 22:23:01,088 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-13 22:23:01,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:23:01,090 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-13 22:23:01,123 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-13 22:23:01,290 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-13 22:23:01,290 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-13 22:23:01,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:23:01,301 INFO L85 PathProgramCache]: Analyzing trace with hash -598823842, now seen corresponding path program 2 times [2025-03-13 22:23:01,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:23:01,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856942909] [2025-03-13 22:23:01,301 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:23:01,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:23:01,899 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5611 statements into 2 equivalence classes. [2025-03-13 22:23:02,427 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 5611 of 5611 statements. [2025-03-13 22:23:02,427 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-13 22:23:02,427 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:23:14,737 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-13 22:23:14,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:23:14,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856942909] [2025-03-13 22:23:14,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1856942909] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:23:14,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82601965] [2025-03-13 22:23:14,739 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:23:14,740 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:23:14,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:23:14,742 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-13 22:23:14,743 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process