./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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/09-regions_23-evilcollapse_rc.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 edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:37:28,331 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:37:28,388 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:37:28,391 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:37:28,392 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:37:28,412 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:37:28,413 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:37:28,413 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:37:28,414 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:37:28,414 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:37:28,414 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:37:28,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:37:28,415 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:37:28,416 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:28,416 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:37:28,416 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:37:28,416 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 -> edbdacd2fc511db63719a3e7d2bd257b6310a833f5bcfcddcb6829e714260082 [2025-03-14 01:37:28,657 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:37:28,664 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:37:28,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:37:28,667 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:37:28,667 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:37:28,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-03-14 01:37:29,772 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a258b24e0/d8261d3d8cd24d9c9a27207ba8a9bbea/FLAG055b7cef2 [2025-03-14 01:37:30,018 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:37:30,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-03-14 01:37:30,032 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a258b24e0/d8261d3d8cd24d9c9a27207ba8a9bbea/FLAG055b7cef2 [2025-03-14 01:37:30,043 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a258b24e0/d8261d3d8cd24d9c9a27207ba8a9bbea [2025-03-14 01:37:30,045 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:37:30,046 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:37:30,048 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:30,048 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:37:30,051 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:37:30,053 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,054 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5a3bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30, skipping insertion in model container [2025-03-14 01:37:30,055 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:37:30,395 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,397 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,397 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,398 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:30,448 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:37:30,477 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,477 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,478 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,482 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-14 01:37:30,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:37:30,534 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:37:30,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30 WrapperNode [2025-03-14 01:37:30,536 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:37:30,536 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:30,536 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:37:30,536 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:37:30,541 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,585 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-03-14 01:37:30,586 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:37:30,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:37:30,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:37:30,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:37:30,591 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,596 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,596 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,620 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,624 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,627 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:37:30,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:37:30,628 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:37:30,628 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:37:30,629 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (1/1) ... [2025-03-14 01:37:30,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:37:30,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:30,658 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-14 01:37:30,660 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-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-14 01:37:30,676 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:37:30,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:37:30,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:37:30,677 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:37:30,796 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:37:30,798 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:37:31,263 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:37:31,264 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:37:31,264 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:37:31,291 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:37:31,291 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:31 BoogieIcfgContainer [2025-03-14 01:37:31,291 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:37:31,293 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:37:31,293 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:37:31,298 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:37:31,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:37:30" (1/3) ... [2025-03-14 01:37:31,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddb7823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:31, skipping insertion in model container [2025-03-14 01:37:31,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:37:30" (2/3) ... [2025-03-14 01:37:31,299 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ddb7823 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:37:31, skipping insertion in model container [2025-03-14 01:37:31,299 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:37:31" (3/3) ... [2025-03-14 01:37:31,300 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-03-14 01:37:31,312 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:37:31,313 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_23-evilcollapse_rc.i that has 2 procedures, 372 locations, 1 initial locations, 4 loop locations, and 18 error locations. [2025-03-14 01:37:31,313 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:37:31,404 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:37:31,441 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 447 transitions, 902 flow [2025-03-14 01:37:31,567 INFO L124 PetriNetUnfolderBase]: 10/445 cut-off events. [2025-03-14 01:37:31,569 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:31,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 452 conditions, 445 events. 10/445 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 666 event pairs, 0 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 372. Up to 2 conditions per place. [2025-03-14 01:37:31,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 447 transitions, 902 flow [2025-03-14 01:37:31,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 445 transitions, 896 flow [2025-03-14 01:37:31,592 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:37:31,601 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;@589cf52a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:37:31,601 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-14 01:37:31,618 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:37:31,620 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-14 01:37:31,620 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:31,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:31,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:31,621 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:31,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:31,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1292152077, now seen corresponding path program 1 times [2025-03-14 01:37:31,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771827282] [2025-03-14 01:37:31,631 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:31,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:37:31,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:37:31,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:31,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:32,461 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-14 01:37:32,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:32,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771827282] [2025-03-14 01:37:32,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771827282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:32,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:32,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:32,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621823178] [2025-03-14 01:37:32,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:32,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:32,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:32,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:32,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:32,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-14 01:37:32,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 445 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-14 01:37:32,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:32,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-14 01:37:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:33,410 INFO L124 PetriNetUnfolderBase]: 449/1917 cut-off events. [2025-03-14 01:37:33,411 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-14 01:37:33,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2832 conditions, 1917 events. 449/1917 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10989 event pairs, 342 based on Foata normal form. 36/1740 useless extension candidates. Maximal degree in co-relation 2472. Up to 862 conditions per place. [2025-03-14 01:37:33,422 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 88 selfloop transitions, 10 changer transitions 2/439 dead transitions. [2025-03-14 01:37:33,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1080 flow [2025-03-14 01:37:33,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:33,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2162 transitions. [2025-03-14 01:37:33,440 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061148396718867 [2025-03-14 01:37:33,442 INFO L175 Difference]: Start difference. First operand has 442 places, 445 transitions, 896 flow. Second operand 6 states and 2162 transitions. [2025-03-14 01:37:33,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1080 flow [2025-03-14 01:37:33,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:37:33,456 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 898 flow [2025-03-14 01:37:33,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=438, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=439, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-03-14 01:37:33,462 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-14 01:37:33,463 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 898 flow [2025-03-14 01:37:33,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-14 01:37:33,465 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:33,466 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] [2025-03-14 01:37:33,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:37:33,466 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:33,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:33,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1451285049, now seen corresponding path program 1 times [2025-03-14 01:37:33,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:33,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067040578] [2025-03-14 01:37:33,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:33,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:33,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-14 01:37:33,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-14 01:37:33,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:33,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:33,819 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-14 01:37:33,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:33,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067040578] [2025-03-14 01:37:33,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067040578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:33,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:33,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:33,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679428502] [2025-03-14 01:37:33,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:33,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:33,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:33,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:33,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:34,243 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-14 01:37:34,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-14 01:37:34,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-14 01:37:34,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,470 INFO L124 PetriNetUnfolderBase]: 449/1913 cut-off events. [2025-03-14 01:37:34,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:34,476 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2837 conditions, 1913 events. 449/1913 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 10900 event pairs, 342 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2663. Up to 862 conditions per place. [2025-03-14 01:37:34,483 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 88 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-14 01:37:34,484 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 435 transitions, 1090 flow [2025-03-14 01:37:34,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:34,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:34,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2158 transitions. [2025-03-14 01:37:34,488 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046234153616704 [2025-03-14 01:37:34,488 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 898 flow. Second operand 6 states and 2158 transitions. [2025-03-14 01:37:34,488 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 435 transitions, 1090 flow [2025-03-14 01:37:34,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:34,495 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 894 flow [2025-03-14 01:37:34,496 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=439, PETRI_TRANSITIONS=435} [2025-03-14 01:37:34,496 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-14 01:37:34,496 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 894 flow [2025-03-14 01:37:34,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.3333333333333) internal successors, (2066), 6 states have internal predecessors, (2066), 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-14 01:37:34,498 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:34,498 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] [2025-03-14 01:37:34,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:37:34,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:34,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:34,500 INFO L85 PathProgramCache]: Analyzing trace with hash 556577461, now seen corresponding path program 1 times [2025-03-14 01:37:34,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:34,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122658131] [2025-03-14 01:37:34,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:34,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:34,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-14 01:37:34,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-14 01:37:34,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:34,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:34,581 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-14 01:37:34,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:34,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122658131] [2025-03-14 01:37:34,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122658131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:34,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:34,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:34,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251396741] [2025-03-14 01:37:34,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:34,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:34,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:34,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:34,583 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:34,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-14 01:37:34,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 435 transitions, 894 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-14 01:37:34,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:34,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-14 01:37:34,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:34,670 INFO L124 PetriNetUnfolderBase]: 29/737 cut-off events. [2025-03-14 01:37:34,670 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:34,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 813 conditions, 737 events. 29/737 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2144 event pairs, 18 based on Foata normal form. 1/682 useless extension candidates. Maximal degree in co-relation 510. Up to 45 conditions per place. [2025-03-14 01:37:34,674 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-14 01:37:34,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 922 flow [2025-03-14 01:37:34,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:34,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:34,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-14 01:37:34,676 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-14 01:37:34,677 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 894 flow. Second operand 3 states and 1307 transitions. [2025-03-14 01:37:34,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 922 flow [2025-03-14 01:37:34,679 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 436 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:34,684 INFO L231 Difference]: Finished difference. Result has 437 places, 436 transitions, 886 flow [2025-03-14 01:37:34,685 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=874, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=886, PETRI_PLACES=437, PETRI_TRANSITIONS=436} [2025-03-14 01:37:34,685 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-14 01:37:34,686 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 436 transitions, 886 flow [2025-03-14 01:37:34,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-14 01:37:34,686 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:34,687 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] [2025-03-14 01:37:34,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:37:34,687 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:34,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:34,688 INFO L85 PathProgramCache]: Analyzing trace with hash -1525146210, now seen corresponding path program 1 times [2025-03-14 01:37:34,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:34,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321766198] [2025-03-14 01:37:34,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:34,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:34,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-14 01:37:34,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-14 01:37:34,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:34,709 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,103 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:35,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:35,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321766198] [2025-03-14 01:37:35,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321766198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:35,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:35,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:35,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383328588] [2025-03-14 01:37:35,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:35,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:35,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:35,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:35,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:35,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-14 01:37:35,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 436 transitions, 886 flow. Second operand has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 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-14 01:37:35,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:35,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-14 01:37:35,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:35,739 INFO L124 PetriNetUnfolderBase]: 450/2035 cut-off events. [2025-03-14 01:37:35,739 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:37:35,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3003 conditions, 2035 events. 450/2035 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11346 event pairs, 342 based on Foata normal form. 0/1822 useless extension candidates. Maximal degree in co-relation 2746. Up to 910 conditions per place. [2025-03-14 01:37:35,750 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-14 01:37:35,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 435 transitions, 1084 flow [2025-03-14 01:37:35,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:35,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:35,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-14 01:37:35,755 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-14 01:37:35,755 INFO L175 Difference]: Start difference. First operand has 437 places, 436 transitions, 886 flow. Second operand 6 states and 2153 transitions. [2025-03-14 01:37:35,755 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 435 transitions, 1084 flow [2025-03-14 01:37:35,757 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 435 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:35,761 INFO L231 Difference]: Finished difference. Result has 440 places, 435 transitions, 892 flow [2025-03-14 01:37:35,762 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=440, PETRI_TRANSITIONS=435} [2025-03-14 01:37:35,763 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-14 01:37:35,763 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 435 transitions, 892 flow [2025-03-14 01:37:35,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 344.6666666666667) internal successors, (2068), 6 states have internal predecessors, (2068), 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-14 01:37:35,764 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:35,764 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] [2025-03-14 01:37:35,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:37:35,764 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:35,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:35,765 INFO L85 PathProgramCache]: Analyzing trace with hash 475602129, now seen corresponding path program 1 times [2025-03-14 01:37:35,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:35,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631875865] [2025-03-14 01:37:35,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:35,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-14 01:37:35,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-14 01:37:35,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:35,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:35,843 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-14 01:37:35,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:35,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631875865] [2025-03-14 01:37:35,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631875865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:35,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:35,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:37:35,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924069756] [2025-03-14 01:37:35,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:35,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:37:35,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:35,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:37:35,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:37:35,854 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-14 01:37:35,856 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 435 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-14 01:37:35,856 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:35,856 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-14 01:37:35,856 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:35,947 INFO L124 PetriNetUnfolderBase]: 29/923 cut-off events. [2025-03-14 01:37:35,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:35,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1009 conditions, 923 events. 29/923 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2448 event pairs, 18 based on Foata normal form. 2/863 useless extension candidates. Maximal degree in co-relation 588. Up to 49 conditions per place. [2025-03-14 01:37:35,953 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-14 01:37:35,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 436 transitions, 920 flow [2025-03-14 01:37:35,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:37:35,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:37:35,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-14 01:37:35,956 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-14 01:37:35,956 INFO L175 Difference]: Start difference. First operand has 440 places, 435 transitions, 892 flow. Second operand 3 states and 1307 transitions. [2025-03-14 01:37:35,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 436 transitions, 920 flow [2025-03-14 01:37:35,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 436 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:35,968 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 894 flow [2025-03-14 01:37:35,969 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=433, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=436} [2025-03-14 01:37:35,970 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-14 01:37:35,970 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 894 flow [2025-03-14 01:37:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 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-14 01:37:35,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:35,972 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] [2025-03-14 01:37:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:37:35,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 637441325, now seen corresponding path program 1 times [2025-03-14 01:37:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031005404] [2025-03-14 01:37:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:35,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-14 01:37:36,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-14 01:37:36,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:36,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:36,503 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-14 01:37:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031005404] [2025-03-14 01:37:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031005404] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:36,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247246908] [2025-03-14 01:37:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:36,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:36,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:37,021 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-14 01:37:37,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 436 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-14 01:37:37,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:37,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-14 01:37:37,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:37,202 INFO L124 PetriNetUnfolderBase]: 75/1235 cut-off events. [2025-03-14 01:37:37,203 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:37,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1556 conditions, 1235 events. 75/1235 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4478 event pairs, 42 based on Foata normal form. 0/1138 useless extension candidates. Maximal degree in co-relation 1032. Up to 267 conditions per place. [2025-03-14 01:37:37,209 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-14 01:37:37,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 1018 flow [2025-03-14 01:37:37,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:37,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:37,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-14 01:37:37,213 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-14 01:37:37,214 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 894 flow. Second operand 6 states and 2338 transitions. [2025-03-14 01:37:37,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 1018 flow [2025-03-14 01:37:37,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 435 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:37,220 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 900 flow [2025-03-14 01:37:37,221 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=441, PETRI_TRANSITIONS=435} [2025-03-14 01:37:37,223 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2025-03-14 01:37:37,223 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 900 flow [2025-03-14 01:37:37,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 383.5) internal successors, (2301), 6 states have internal predecessors, (2301), 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-14 01:37:37,224 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:37,225 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] [2025-03-14 01:37:37,225 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:37:37,225 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:37,225 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -645751327, now seen corresponding path program 1 times [2025-03-14 01:37:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:37,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767893657] [2025-03-14 01:37:37,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:37,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:37,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-14 01:37:37,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-14 01:37:37,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:37,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:37,723 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-14 01:37:37,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:37,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767893657] [2025-03-14 01:37:37,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767893657] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:37,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:37,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:37,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129742952] [2025-03-14 01:37:37,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:37,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:37,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:37,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:37,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:38,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-14 01:37:38,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 441 places, 435 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 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-14 01:37:38,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:38,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-14 01:37:38,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:38,359 INFO L124 PetriNetUnfolderBase]: 450/2215 cut-off events. [2025-03-14 01:37:38,360 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:38,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3287 conditions, 2215 events. 450/2215 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12049 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2789. Up to 976 conditions per place. [2025-03-14 01:37:38,371 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/434 dead transitions. [2025-03-14 01:37:38,371 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 434 transitions, 1098 flow [2025-03-14 01:37:38,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:38,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:38,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-14 01:37:38,375 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-14 01:37:38,375 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 900 flow. Second operand 6 states and 2153 transitions. [2025-03-14 01:37:38,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 434 transitions, 1098 flow [2025-03-14 01:37:38,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 434 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:38,381 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 898 flow [2025-03-14 01:37:38,381 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=888, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=434, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=898, PETRI_PLACES=440, PETRI_TRANSITIONS=434} [2025-03-14 01:37:38,383 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-14 01:37:38,383 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 898 flow [2025-03-14 01:37:38,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 347.3333333333333) internal successors, (2084), 6 states have internal predecessors, (2084), 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-14 01:37:38,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:38,385 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] [2025-03-14 01:37:38,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:37:38,385 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:38,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:38,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1184388287, now seen corresponding path program 1 times [2025-03-14 01:37:38,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:38,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940476962] [2025-03-14 01:37:38,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:38,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:38,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-14 01:37:38,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-14 01:37:38,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:38,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:38,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-14 01:37:38,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:38,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940476962] [2025-03-14 01:37:38,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940476962] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:38,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:38,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:38,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285130187] [2025-03-14 01:37:38,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:38,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:38,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:38,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:38,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:39,192 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-14 01:37:39,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 440 places, 434 transitions, 898 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-14 01:37:39,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:39,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-14 01:37:39,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:39,430 INFO L124 PetriNetUnfolderBase]: 450/2211 cut-off events. [2025-03-14 01:37:39,430 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:39,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3267 conditions, 2211 events. 450/2211 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12070 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2805. Up to 960 conditions per place. [2025-03-14 01:37:39,441 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-03-14 01:37:39,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 433 transitions, 1088 flow [2025-03-14 01:37:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:39,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:39,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-14 01:37:39,445 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-14 01:37:39,445 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 898 flow. Second operand 6 states and 2173 transitions. [2025-03-14 01:37:39,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 433 transitions, 1088 flow [2025-03-14 01:37:39,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 433 transitions, 1078 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:39,451 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 896 flow [2025-03-14 01:37:39,452 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=433, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=428, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=439, PETRI_TRANSITIONS=433} [2025-03-14 01:37:39,454 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-14 01:37:39,454 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 896 flow [2025-03-14 01:37:39,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-14 01:37:39,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:39,456 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] [2025-03-14 01:37:39,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:37:39,456 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:39,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 157923113, now seen corresponding path program 1 times [2025-03-14 01:37:39,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:39,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144040555] [2025-03-14 01:37:39,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:39,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:39,482 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-14 01:37:39,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-14 01:37:39,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:39,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:39,822 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-14 01:37:39,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:39,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144040555] [2025-03-14 01:37:39,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144040555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:39,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:39,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:39,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814903781] [2025-03-14 01:37:39,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:39,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:39,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:39,824 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:39,824 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:40,142 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-14 01:37:40,144 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 433 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-14 01:37:40,144 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:40,144 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-14 01:37:40,144 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:40,394 INFO L124 PetriNetUnfolderBase]: 450/2207 cut-off events. [2025-03-14 01:37:40,395 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:37:40,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3263 conditions, 2207 events. 450/2207 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12003 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2820. Up to 960 conditions per place. [2025-03-14 01:37:40,405 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/432 dead transitions. [2025-03-14 01:37:40,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 432 transitions, 1086 flow [2025-03-14 01:37:40,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:40,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:40,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-14 01:37:40,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-14 01:37:40,410 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 896 flow. Second operand 6 states and 2173 transitions. [2025-03-14 01:37:40,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 432 transitions, 1086 flow [2025-03-14 01:37:40,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 432 transitions, 1076 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:40,416 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 894 flow [2025-03-14 01:37:40,416 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=884, PETRI_DIFFERENCE_MINUEND_PLACES=433, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=894, PETRI_PLACES=438, PETRI_TRANSITIONS=432} [2025-03-14 01:37:40,417 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-14 01:37:40,417 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 894 flow [2025-03-14 01:37:40,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 352.0) internal successors, (2112), 6 states have internal predecessors, (2112), 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-14 01:37:40,418 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:40,418 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] [2025-03-14 01:37:40,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:37:40,419 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:40,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:40,419 INFO L85 PathProgramCache]: Analyzing trace with hash -56164290, now seen corresponding path program 1 times [2025-03-14 01:37:40,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:40,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109757181] [2025-03-14 01:37:40,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:40,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:40,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-14 01:37:40,458 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-14 01:37:40,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:40,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:40,825 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-14 01:37:40,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:40,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109757181] [2025-03-14 01:37:40,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [109757181] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:40,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:40,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:40,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192467923] [2025-03-14 01:37:40,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:40,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:40,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:40,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:40,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:41,279 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-14 01:37:41,281 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 438 places, 432 transitions, 894 flow. Second operand has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 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-14 01:37:41,281 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:41,281 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-14 01:37:41,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:41,502 INFO L124 PetriNetUnfolderBase]: 450/2203 cut-off events. [2025-03-14 01:37:41,502 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-14 01:37:41,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3279 conditions, 2203 events. 450/2203 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 12031 event pairs, 342 based on Foata normal form. 0/2002 useless extension candidates. Maximal degree in co-relation 2833. Up to 980 conditions per place. [2025-03-14 01:37:41,510 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/431 dead transitions. [2025-03-14 01:37:41,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 431 transitions, 1094 flow [2025-03-14 01:37:41,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:41,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:41,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-14 01:37:41,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-14 01:37:41,514 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 894 flow. Second operand 6 states and 2148 transitions. [2025-03-14 01:37:41,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 431 transitions, 1094 flow [2025-03-14 01:37:41,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:41,520 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 892 flow [2025-03-14 01:37:41,521 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=426, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=437, PETRI_TRANSITIONS=431} [2025-03-14 01:37:41,521 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-14 01:37:41,521 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 892 flow [2025-03-14 01:37:41,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 348.5) internal successors, (2091), 6 states have internal predecessors, (2091), 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-14 01:37:41,522 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:41,522 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] [2025-03-14 01:37:41,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:37:41,522 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:41,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:41,523 INFO L85 PathProgramCache]: Analyzing trace with hash -273165573, now seen corresponding path program 1 times [2025-03-14 01:37:41,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:41,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419434649] [2025-03-14 01:37:41,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:41,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:41,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-14 01:37:41,554 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-14 01:37:41,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:41,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:41,675 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:41,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419434649] [2025-03-14 01:37:41,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419434649] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:41,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403243378] [2025-03-14 01:37:41,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:41,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:41,677 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:41,679 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-14 01:37:41,681 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-14 01:37:41,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-14 01:37:41,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-14 01:37:41,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:41,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:41,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-14 01:37:41,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:42,021 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:42,143 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-14 01:37:42,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403243378] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:42,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:42,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-14 01:37:42,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436432963] [2025-03-14 01:37:42,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:42,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-14 01:37:42,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:42,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-14 01:37:42,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-14 01:37:42,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-14 01:37:42,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 431 transitions, 892 flow. Second operand has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 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-14 01:37:42,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:42,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-14 01:37:42,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:42,323 INFO L124 PetriNetUnfolderBase]: 29/1087 cut-off events. [2025-03-14 01:37:42,323 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-14 01:37:42,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1216 conditions, 1087 events. 29/1087 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1988 event pairs, 18 based on Foata normal form. 4/1049 useless extension candidates. Maximal degree in co-relation 581. Up to 49 conditions per place. [2025-03-14 01:37:42,326 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 15 selfloop transitions, 9 changer transitions 0/439 dead transitions. [2025-03-14 01:37:42,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 958 flow [2025-03-14 01:37:42,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-14 01:37:42,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-14 01:37:42,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3878 transitions. [2025-03-14 01:37:42,332 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639572458364405 [2025-03-14 01:37:42,332 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 892 flow. Second operand 9 states and 3878 transitions. [2025-03-14 01:37:42,332 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 958 flow [2025-03-14 01:37:42,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:42,337 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 932 flow [2025-03-14 01:37:42,337 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=432, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=431, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=932, PETRI_PLACES=443, PETRI_TRANSITIONS=437} [2025-03-14 01:37:42,338 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-14 01:37:42,338 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 932 flow [2025-03-14 01:37:42,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 429.8) internal successors, (4298), 10 states have internal predecessors, (4298), 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-14 01:37:42,339 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:42,340 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] [2025-03-14 01:37:42,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:37:42,540 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-14 01:37:42,541 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:42,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1694650929, now seen corresponding path program 2 times [2025-03-14 01:37:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:42,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281285130] [2025-03-14 01:37:42,542 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:42,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:42,605 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-03-14 01:37:42,609 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 403 statements. [2025-03-14 01:37:42,609 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:42,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:42,792 INFO L134 CoverageAnalysis]: Checked inductivity of 463 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 463 trivial. 0 not checked. [2025-03-14 01:37:42,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:42,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281285130] [2025-03-14 01:37:42,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281285130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:42,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:42,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:42,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436959223] [2025-03-14 01:37:42,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:42,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:42,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:42,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:42,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:43,701 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 447 [2025-03-14 01:37:43,702 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 443 places, 437 transitions, 932 flow. Second operand has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 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-14 01:37:43,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:43,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 447 [2025-03-14 01:37:43,703 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:43,886 INFO L124 PetriNetUnfolderBase]: 75/1401 cut-off events. [2025-03-14 01:37:43,886 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-14 01:37:43,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1801 conditions, 1401 events. 75/1401 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 4018 event pairs, 42 based on Foata normal form. 0/1318 useless extension candidates. Maximal degree in co-relation 1161. Up to 314 conditions per place. [2025-03-14 01:37:43,892 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 61 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-14 01:37:43,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 435 transitions, 1070 flow [2025-03-14 01:37:43,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:43,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:43,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-03-14 01:37:43,897 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854958985831469 [2025-03-14 01:37:43,897 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 932 flow. Second operand 6 states and 2293 transitions. [2025-03-14 01:37:43,897 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 435 transitions, 1070 flow [2025-03-14 01:37:43,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 435 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-14 01:37:43,902 INFO L231 Difference]: Finished difference. Result has 445 places, 435 transitions, 942 flow [2025-03-14 01:37:43,903 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=445, PETRI_TRANSITIONS=435} [2025-03-14 01:37:43,903 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2025-03-14 01:37:43,903 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 435 transitions, 942 flow [2025-03-14 01:37:43,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 377.3333333333333) internal successors, (2264), 6 states have internal predecessors, (2264), 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-14 01:37:43,904 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:43,905 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, 1, 1, 1, 1, 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-14 01:37:43,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:37:43,905 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:43,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:43,906 INFO L85 PathProgramCache]: Analyzing trace with hash 1531654921, now seen corresponding path program 1 times [2025-03-14 01:37:43,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:43,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556521506] [2025-03-14 01:37:43,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:43,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:43,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-14 01:37:43,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-14 01:37:43,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:43,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 597 trivial. 0 not checked. [2025-03-14 01:37:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556521506] [2025-03-14 01:37:44,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556521506] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1767000345] [2025-03-14 01:37:44,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:44,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:44,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:44,206 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-14 01:37:44,207 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-14 01:37:44,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-14 01:37:44,510 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-14 01:37:44,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:44,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:44,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-14 01:37:44,528 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:44,838 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-14 01:37:44,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:45,170 INFO L134 CoverageAnalysis]: Checked inductivity of 598 backedges. 1 proven. 489 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2025-03-14 01:37:45,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1767000345] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:45,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:45,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-14 01:37:45,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633070648] [2025-03-14 01:37:45,171 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:45,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-14 01:37:45,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:45,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-14 01:37:45,174 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-14 01:37:45,244 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 447 [2025-03-14 01:37:45,248 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 445 places, 435 transitions, 942 flow. Second operand has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 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-14 01:37:45,248 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:45,248 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 447 [2025-03-14 01:37:45,248 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:46,307 INFO L124 PetriNetUnfolderBase]: 30/2465 cut-off events. [2025-03-14 01:37:46,307 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-14 01:37:46,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2465 events. 30/2465 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1975 event pairs, 18 based on Foata normal form. 13/2438 useless extension candidates. Maximal degree in co-relation 2329. Up to 51 conditions per place. [2025-03-14 01:37:46,310 INFO L140 encePairwiseOnDemand]: 436/447 looper letters, 47 selfloop transitions, 68 changer transitions 0/521 dead transitions. [2025-03-14 01:37:46,310 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 521 transitions, 1582 flow [2025-03-14 01:37:46,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-14 01:37:46,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-14 01:37:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 26714 transitions. [2025-03-14 01:37:46,333 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486168815027876 [2025-03-14 01:37:46,334 INFO L175 Difference]: Start difference. First operand has 445 places, 435 transitions, 942 flow. Second operand 63 states and 26714 transitions. [2025-03-14 01:37:46,334 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 521 transitions, 1582 flow [2025-03-14 01:37:46,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 521 transitions, 1562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:46,342 INFO L231 Difference]: Finished difference. Result has 518 places, 497 transitions, 1442 flow [2025-03-14 01:37:46,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=922, PETRI_DIFFERENCE_MINUEND_PLACES=440, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=435, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=419, PETRI_DIFFERENCE_SUBTRAHEND_STATES=63, PETRI_FLOW=1442, PETRI_PLACES=518, PETRI_TRANSITIONS=497} [2025-03-14 01:37:46,343 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 76 predicate places. [2025-03-14 01:37:46,343 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 497 transitions, 1442 flow [2025-03-14 01:37:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 424.5263157894737) internal successors, (8066), 19 states have internal predecessors, (8066), 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-14 01:37:46,347 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:46,347 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:46,356 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:37:46,553 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-14 01:37:46,553 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:46,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:46,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1056443811, now seen corresponding path program 2 times [2025-03-14 01:37:46,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:46,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778509975] [2025-03-14 01:37:46,555 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:46,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:46,726 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1465 statements into 2 equivalence classes. [2025-03-14 01:37:46,732 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 147 of 1465 statements. [2025-03-14 01:37:46,732 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:46,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:46,930 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15305 trivial. 0 not checked. [2025-03-14 01:37:46,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:46,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778509975] [2025-03-14 01:37:46,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778509975] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:46,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:46,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:46,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006310136] [2025-03-14 01:37:46,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:46,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:46,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:46,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:46,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:47,391 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-14 01:37:47,393 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 518 places, 497 transitions, 1442 flow. Second operand has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 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-14 01:37:47,393 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:47,393 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-14 01:37:47,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:48,271 INFO L124 PetriNetUnfolderBase]: 188/3246 cut-off events. [2025-03-14 01:37:48,271 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-14 01:37:48,276 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4504 conditions, 3246 events. 188/3246 cut-off events. For 432/432 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 8048 event pairs, 126 based on Foata normal form. 0/3087 useless extension candidates. Maximal degree in co-relation 2458. Up to 899 conditions per place. [2025-03-14 01:37:48,280 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/496 dead transitions. [2025-03-14 01:37:48,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 496 transitions, 1566 flow [2025-03-14 01:37:48,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:37:48,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:37:48,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-14 01:37:48,283 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-14 01:37:48,283 INFO L175 Difference]: Start difference. First operand has 518 places, 497 transitions, 1442 flow. Second operand 6 states and 2338 transitions. [2025-03-14 01:37:48,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 496 transitions, 1566 flow [2025-03-14 01:37:48,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 496 transitions, 1490 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-14 01:37:48,292 INFO L231 Difference]: Finished difference. Result has 515 places, 496 transitions, 1374 flow [2025-03-14 01:37:48,293 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=491, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1374, PETRI_PLACES=515, PETRI_TRANSITIONS=496} [2025-03-14 01:37:48,293 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 73 predicate places. [2025-03-14 01:37:48,293 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1374 flow [2025-03-14 01:37:48,294 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 386.3333333333333) internal successors, (2318), 6 states have internal predecessors, (2318), 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-14 01:37:48,294 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:48,295 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:48,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:37:48,295 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:48,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:48,297 INFO L85 PathProgramCache]: Analyzing trace with hash 277532280, now seen corresponding path program 1 times [2025-03-14 01:37:48,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:48,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668203551] [2025-03-14 01:37:48,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:48,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:48,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-14 01:37:48,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-14 01:37:48,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:48,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:50,710 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:50,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668203551] [2025-03-14 01:37:50,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668203551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:50,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1830960810] [2025-03-14 01:37:50,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:37:50,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:50,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:50,713 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-14 01:37:50,714 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-14 01:37:51,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-14 01:37:51,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-14 01:37:51,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:37:51,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:51,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 5753 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-14 01:37:51,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:52,248 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:52,249 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:52,914 INFO L134 CoverageAnalysis]: Checked inductivity of 15305 backedges. 7978 proven. 3409 refuted. 0 times theorem prover too weak. 3918 trivial. 0 not checked. [2025-03-14 01:37:52,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1830960810] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:37:52,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:37:52,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-14 01:37:52,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134363307] [2025-03-14 01:37:52,915 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:37:52,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-14 01:37:52,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:52,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-14 01:37:52,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-14 01:37:52,950 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-14 01:37:52,956 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 515 places, 496 transitions, 1374 flow. Second operand has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 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-14 01:37:52,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:52,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-14 01:37:52,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:54,638 INFO L124 PetriNetUnfolderBase]: 30/4624 cut-off events. [2025-03-14 01:37:54,638 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-03-14 01:37:54,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5435 conditions, 4624 events. 30/4624 cut-off events. For 3207/3207 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1976 event pairs, 18 based on Foata normal form. 24/4609 useless extension candidates. Maximal degree in co-relation 5016. Up to 78 conditions per place. [2025-03-14 01:37:54,645 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 47 selfloop transitions, 135 changer transitions 0/597 dead transitions. [2025-03-14 01:37:54,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 597 transitions, 2502 flow [2025-03-14 01:37:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-14 01:37:54,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-14 01:37:54,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19340 transitions. [2025-03-14 01:37:54,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614715386527467 [2025-03-14 01:37:54,655 INFO L175 Difference]: Start difference. First operand has 515 places, 496 transitions, 1374 flow. Second operand 45 states and 19340 transitions. [2025-03-14 01:37:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 597 transitions, 2502 flow [2025-03-14 01:37:54,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 597 transitions, 2492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:37:54,666 INFO L231 Difference]: Finished difference. Result has 563 places, 571 transitions, 2238 flow [2025-03-14 01:37:54,667 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=1364, PETRI_DIFFERENCE_MINUEND_PLACES=510, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=496, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=66, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=427, PETRI_DIFFERENCE_SUBTRAHEND_STATES=45, PETRI_FLOW=2238, PETRI_PLACES=563, PETRI_TRANSITIONS=571} [2025-03-14 01:37:54,667 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 121 predicate places. [2025-03-14 01:37:54,667 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 571 transitions, 2238 flow [2025-03-14 01:37:54,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 430.11764705882354) internal successors, (14624), 34 states have internal predecessors, (14624), 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-14 01:37:54,670 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:54,671 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, 1, 1] [2025-03-14 01:37:54,690 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-14 01:37:54,871 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-14 01:37:54,871 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:37:54,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:54,876 INFO L85 PathProgramCache]: Analyzing trace with hash -255393672, now seen corresponding path program 2 times [2025-03-14 01:37:54,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:54,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540944928] [2025-03-14 01:37:54,876 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:54,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:55,282 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2912 statements into 2 equivalence classes. [2025-03-14 01:37:55,287 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 2912 statements. [2025-03-14 01:37:55,287 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:37:55,287 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:55,492 INFO L134 CoverageAnalysis]: Checked inductivity of 71641 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 71641 trivial. 0 not checked. [2025-03-14 01:37:55,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:55,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540944928] [2025-03-14 01:37:55,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540944928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:37:55,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:37:55,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:37:55,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381234935] [2025-03-14 01:37:55,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:37:55,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:37:55,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:37:55,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:37:55,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:37:55,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-14 01:37:55,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 563 places, 571 transitions, 2238 flow. Second operand has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-14 01:37:55,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:37:55,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-14 01:37:55,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:00,065 INFO L124 PetriNetUnfolderBase]: 1238/7754 cut-off events. [2025-03-14 01:38:00,065 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-14 01:38:00,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12021 conditions, 7754 events. 1238/7754 cut-off events. For 1218/1218 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 28126 event pairs, 1026 based on Foata normal form. 0/7369 useless extension candidates. Maximal degree in co-relation 7662. Up to 3430 conditions per place. [2025-03-14 01:38:00,084 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/570 dead transitions. [2025-03-14 01:38:00,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 570 transitions, 2438 flow [2025-03-14 01:38:00,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:00,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:00,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-14 01:38:00,086 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-14 01:38:00,086 INFO L175 Difference]: Start difference. First operand has 563 places, 571 transitions, 2238 flow. Second operand 6 states and 2148 transitions. [2025-03-14 01:38:00,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 570 transitions, 2438 flow [2025-03-14 01:38:00,097 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 570 transitions, 2330 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-14 01:38:00,101 INFO L231 Difference]: Finished difference. Result has 549 places, 570 transitions, 2138 flow [2025-03-14 01:38:00,102 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=565, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2138, PETRI_PLACES=549, PETRI_TRANSITIONS=570} [2025-03-14 01:38:00,102 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 107 predicate places. [2025-03-14 01:38:00,102 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 570 transitions, 2138 flow [2025-03-14 01:38:00,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.1666666666667) internal successors, (2107), 6 states have internal predecessors, (2107), 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-14 01:38:00,103 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:00,104 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, 1, 1, 1, 1, 1, 1, 1, 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-14 01:38:00,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:38:00,104 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:38:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1030857171, now seen corresponding path program 1 times [2025-03-14 01:38:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233483154] [2025-03-14 01:38:00,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:00,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-14 01:38:00,703 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-14 01:38:00,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:00,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:10,971 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-14 01:38:10,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233483154] [2025-03-14 01:38:10,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233483154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:10,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073487675] [2025-03-14 01:38:10,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:10,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:10,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:10,973 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-14 01:38:10,975 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-14 01:38:11,930 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-14 01:38:12,890 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-14 01:38:12,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:12,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:12,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 11716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-14 01:38:12,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:38:14,049 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-14 01:38:14,049 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:38:15,695 INFO L134 CoverageAnalysis]: Checked inductivity of 72182 backedges. 36776 proven. 17025 refuted. 0 times theorem prover too weak. 18381 trivial. 0 not checked. [2025-03-14 01:38:15,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073487675] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:38:15,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:38:15,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-14 01:38:15,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553343715] [2025-03-14 01:38:15,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:38:15,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-14 01:38:15,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:15,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-14 01:38:15,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-14 01:38:15,792 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-14 01:38:15,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 549 places, 570 transitions, 2138 flow. Second operand has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 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-14 01:38:15,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:15,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-14 01:38:15,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:21,748 INFO L124 PetriNetUnfolderBase]: 30/8673 cut-off events. [2025-03-14 01:38:21,748 INFO L125 PetriNetUnfolderBase]: For 13371/13371 co-relation queries the response was YES. [2025-03-14 01:38:21,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10603 conditions, 8673 events. 30/8673 cut-off events. For 13371/13371 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1964 event pairs, 18 based on Foata normal form. 45/8680 useless extension candidates. Maximal degree in co-relation 10183. Up to 168 conditions per place. [2025-03-14 01:38:21,761 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 92 selfloop transitions, 270 changer transitions 0/776 dead transitions. [2025-03-14 01:38:21,761 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 776 transitions, 5048 flow [2025-03-14 01:38:21,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-14 01:38:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-14 01:38:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 38667 transitions. [2025-03-14 01:38:21,774 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611483967188665 [2025-03-14 01:38:21,775 INFO L175 Difference]: Start difference. First operand has 549 places, 570 transitions, 2138 flow. Second operand 90 states and 38667 transitions. [2025-03-14 01:38:21,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 776 transitions, 5048 flow [2025-03-14 01:38:21,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 776 transitions, 5038 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:38:21,799 INFO L231 Difference]: Finished difference. Result has 649 places, 708 transitions, 4120 flow [2025-03-14 01:38:21,800 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=2128, PETRI_DIFFERENCE_MINUEND_PLACES=544, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=429, PETRI_DIFFERENCE_SUBTRAHEND_STATES=90, PETRI_FLOW=4120, PETRI_PLACES=649, PETRI_TRANSITIONS=708} [2025-03-14 01:38:21,800 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 207 predicate places. [2025-03-14 01:38:21,800 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 708 transitions, 4120 flow [2025-03-14 01:38:21,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 430.12698412698415) internal successors, (27098), 63 states have internal predecessors, (27098), 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-14 01:38:21,804 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:21,805 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:38:21,835 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-14 01:38:22,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:38:22,006 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:38:22,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:22,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1092205587, now seen corresponding path program 2 times [2025-03-14 01:38:22,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:22,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661175291] [2025-03-14 01:38:22,016 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:38:22,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:22,630 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5641 statements into 2 equivalence classes. [2025-03-14 01:38:22,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 5641 statements. [2025-03-14 01:38:22,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-14 01:38:22,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:22,867 INFO L134 CoverageAnalysis]: Checked inductivity of 290132 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290132 trivial. 0 not checked. [2025-03-14 01:38:22,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:22,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661175291] [2025-03-14 01:38:22,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661175291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:38:22,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:38:22,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:38:22,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008587783] [2025-03-14 01:38:22,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:38:22,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:38:22,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:38:22,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:38:22,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:38:23,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 447 [2025-03-14 01:38:23,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 649 places, 708 transitions, 4120 flow. Second operand has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 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-14 01:38:23,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:38:23,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 447 [2025-03-14 01:38:23,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:38:31,372 INFO L124 PetriNetUnfolderBase]: 200/9574 cut-off events. [2025-03-14 01:38:31,372 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-03-14 01:38:31,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14432 conditions, 9574 events. 200/9574 cut-off events. For 3537/3537 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 8952 event pairs, 54 based on Foata normal form. 0/9432 useless extension candidates. Maximal degree in co-relation 8410. Up to 2812 conditions per place. [2025-03-14 01:38:31,404 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 75 selfloop transitions, 23 changer transitions 0/743 dead transitions. [2025-03-14 01:38:31,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 743 transitions, 4394 flow [2025-03-14 01:38:31,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:38:31,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:38:31,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2379 transitions. [2025-03-14 01:38:31,407 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870246085011185 [2025-03-14 01:38:31,407 INFO L175 Difference]: Start difference. First operand has 649 places, 708 transitions, 4120 flow. Second operand 6 states and 2379 transitions. [2025-03-14 01:38:31,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 743 transitions, 4394 flow [2025-03-14 01:38:31,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 743 transitions, 4040 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-14 01:38:31,439 INFO L231 Difference]: Finished difference. Result has 617 places, 730 transitions, 3924 flow [2025-03-14 01:38:31,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=447, PETRI_DIFFERENCE_MINUEND_FLOW=3766, PETRI_DIFFERENCE_MINUEND_PLACES=607, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=708, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3924, PETRI_PLACES=617, PETRI_TRANSITIONS=730} [2025-03-14 01:38:31,441 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 175 predicate places. [2025-03-14 01:38:31,441 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 730 transitions, 3924 flow [2025-03-14 01:38:31,442 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 388.1666666666667) internal successors, (2329), 6 states have internal predecessors, (2329), 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-14 01:38:31,442 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:38:31,444 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 01:38:31,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-14 01:38:31,444 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting fErr3ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-14 01:38:31,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:38:31,459 INFO L85 PathProgramCache]: Analyzing trace with hash 975219702, now seen corresponding path program 1 times [2025-03-14 01:38:31,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:38:31,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535407444] [2025-03-14 01:38:31,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:31,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:38:32,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-03-14 01:38:32,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-03-14 01:38:32,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:38:32,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:38:44,860 INFO L134 CoverageAnalysis]: Checked inductivity of 290674 backedges. 1620 proven. 145891 refuted. 0 times theorem prover too weak. 143163 trivial. 0 not checked. [2025-03-14 01:38:44,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:38:44,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535407444] [2025-03-14 01:38:44,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535407444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:38:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099500302] [2025-03-14 01:38:44,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:38:44,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:38:44,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:38:44,873 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-14 01:38:44,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-14 01:38:47,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes.