./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 f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/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-?-f8ab0bd-m [2025-03-13 22:17:46,668 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:17:46,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:17:46,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:17:46,731 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:17:46,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:17:46,755 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:17:46,755 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:17:46,755 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:17:46,756 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:17:46,756 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:17:46,756 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:17:46,756 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:17:46,756 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:17:46,756 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:17:46,758 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:17:46,759 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:46,759 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:17:46,759 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:17:46,759 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-13 22:17:46,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:17:46,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:17:46,974 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:17:46,975 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:17:46,975 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:17:46,976 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-13 22:17:48,095 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527b327c2/9298f6e0be9f4a63ab9840058c8d2d72/FLAG928ac1e68 [2025-03-13 22:17:48,416 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:17:48,418 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-03-13 22:17:48,433 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527b327c2/9298f6e0be9f4a63ab9840058c8d2d72/FLAG928ac1e68 [2025-03-13 22:17:48,666 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/527b327c2/9298f6e0be9f4a63ab9840058c8d2d72 [2025-03-13 22:17:48,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:17:48,670 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:17:48,671 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:48,671 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:17:48,675 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:17:48,675 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:48" (1/1) ... [2025-03-13 22:17:48,676 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5679508e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:48, skipping insertion in model container [2025-03-13 22:17:48,676 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:48" (1/1) ... [2025-03-13 22:17:48,710 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:17:49,015 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,020 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,021 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,021 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,036 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:49,063 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:17:49,090 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,091 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,091 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,092 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-13 22:17:49,098 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:49,145 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:17:49,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49 WrapperNode [2025-03-13 22:17:49,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:49,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:49,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:17:49,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:17:49,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,163 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,187 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-03-13 22:17:49,187 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:49,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:17:49,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:17:49,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:17:49,193 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,193 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,198 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,198 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,231 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:17:49,231 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:17:49,231 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:17:49,232 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:17:49,232 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (1/1) ... [2025-03-13 22:17:49,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:49,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:49,258 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:17:49,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:17:49,277 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-13 22:17:49,277 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-13 22:17:49,277 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:17:49,277 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:17:49,278 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:17:49,278 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:17:49,279 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:17:49,391 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:17:49,393 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:17:49,926 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:17:49,928 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:17:49,928 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:17:49,956 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:17:49,957 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:49 BoogieIcfgContainer [2025-03-13 22:17:49,958 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:17:49,959 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:17:49,959 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:17:49,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:17:49,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:17:48" (1/3) ... [2025-03-13 22:17:49,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe172e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:49, skipping insertion in model container [2025-03-13 22:17:49,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:49" (2/3) ... [2025-03-13 22:17:49,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fe172e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:49, skipping insertion in model container [2025-03-13 22:17:49,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:49" (3/3) ... [2025-03-13 22:17:49,965 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-03-13 22:17:49,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:17:49,979 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-13 22:17:49,980 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:17:50,067 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:17:50,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 447 transitions, 902 flow [2025-03-13 22:17:50,223 INFO L124 PetriNetUnfolderBase]: 10/445 cut-off events. [2025-03-13 22:17:50,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:50,235 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-13 22:17:50,236 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 447 transitions, 902 flow [2025-03-13 22:17:50,242 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 445 transitions, 896 flow [2025-03-13 22:17:50,251 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:17:50,262 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;@538cc222, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:17:50,262 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-13 22:17:50,282 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:17:50,283 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-13 22:17:50,283 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:50,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:50,284 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:50,284 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-13 22:17:50,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:50,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1292152077, now seen corresponding path program 1 times [2025-03-13 22:17:50,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:50,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497852532] [2025-03-13 22:17:50,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:50,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:50,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-13 22:17:50,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-13 22:17:50,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:50,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:51,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:51,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:51,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497852532] [2025-03-13 22:17:51,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497852532] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:51,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:51,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:51,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031888492] [2025-03-13 22:17:51,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:51,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:51,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:51,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:51,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-13 22:17:51,562 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-13 22:17:51,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:51,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-13 22:17:51,564 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:52,053 INFO L124 PetriNetUnfolderBase]: 449/1917 cut-off events. [2025-03-13 22:17:52,054 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-13 22:17:52,057 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-13 22:17:52,063 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 88 selfloop transitions, 10 changer transitions 2/439 dead transitions. [2025-03-13 22:17:52,063 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1080 flow [2025-03-13 22:17:52,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:52,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:52,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2162 transitions. [2025-03-13 22:17:52,084 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061148396718867 [2025-03-13 22:17:52,085 INFO L175 Difference]: Start difference. First operand has 442 places, 445 transitions, 896 flow. Second operand 6 states and 2162 transitions. [2025-03-13 22:17:52,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1080 flow [2025-03-13 22:17:52,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:17:52,095 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 898 flow [2025-03-13 22:17:52,097 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-13 22:17:52,099 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-13 22:17:52,099 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 898 flow [2025-03-13 22:17:52,100 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-13 22:17:52,100 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:52,100 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-13 22:17:52,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:17:52,101 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-13 22:17:52,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:52,102 INFO L85 PathProgramCache]: Analyzing trace with hash -1451285049, now seen corresponding path program 1 times [2025-03-13 22:17:52,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:52,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510870435] [2025-03-13 22:17:52,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:52,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:52,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-13 22:17:52,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-13 22:17:52,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:52,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:52,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:52,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:52,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510870435] [2025-03-13 22:17:52,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510870435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:52,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:52,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:52,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605635299] [2025-03-13 22:17:52,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:52,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:52,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:52,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:52,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:52,897 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-13 22:17:52,900 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-13 22:17:52,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:52,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-13 22:17:52,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:53,129 INFO L124 PetriNetUnfolderBase]: 449/1913 cut-off events. [2025-03-13 22:17:53,130 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:53,133 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-13 22:17:53,137 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 88 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-13 22:17:53,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 435 transitions, 1090 flow [2025-03-13 22:17:53,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:53,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2158 transitions. [2025-03-13 22:17:53,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046234153616704 [2025-03-13 22:17:53,141 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 898 flow. Second operand 6 states and 2158 transitions. [2025-03-13 22:17:53,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 435 transitions, 1090 flow [2025-03-13 22:17:53,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:53,146 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 894 flow [2025-03-13 22:17:53,147 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-13 22:17:53,147 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-13 22:17:53,147 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 894 flow [2025-03-13 22:17:53,148 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-13 22:17:53,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:53,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:53,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:17:53,152 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-13 22:17:53,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 556577461, now seen corresponding path program 1 times [2025-03-13 22:17:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:53,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208305428] [2025-03-13 22:17:53,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:53,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:17:53,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:17:53,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:53,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:53,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:53,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:53,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208305428] [2025-03-13 22:17:53,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208305428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:53,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:53,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:53,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831857595] [2025-03-13 22:17:53,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:53,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:53,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:53,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:53,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:53,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-13 22:17:53,264 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-13 22:17:53,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:53,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-13 22:17:53,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:53,329 INFO L124 PetriNetUnfolderBase]: 29/737 cut-off events. [2025-03-13 22:17:53,330 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:53,332 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-13 22:17:53,334 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-13 22:17:53,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 922 flow [2025-03-13 22:17:53,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:53,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:53,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-13 22:17:53,337 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-13 22:17:53,337 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 894 flow. Second operand 3 states and 1307 transitions. [2025-03-13 22:17:53,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 922 flow [2025-03-13 22:17:53,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 436 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:53,345 INFO L231 Difference]: Finished difference. Result has 437 places, 436 transitions, 886 flow [2025-03-13 22:17:53,345 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-13 22:17:53,347 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-13 22:17:53,347 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 436 transitions, 886 flow [2025-03-13 22:17:53,348 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-13 22:17:53,348 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:53,348 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-13 22:17:53,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:17:53,349 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-13 22:17:53,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:53,349 INFO L85 PathProgramCache]: Analyzing trace with hash -1525146210, now seen corresponding path program 1 times [2025-03-13 22:17:53,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:53,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667257844] [2025-03-13 22:17:53,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:53,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:53,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-13 22:17:53,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-13 22:17:53,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:53,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:53,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:53,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:53,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667257844] [2025-03-13 22:17:53,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667257844] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:53,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:53,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:53,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837707451] [2025-03-13 22:17:53,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:53,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:53,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:53,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:53,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:54,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-13 22:17:54,167 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-13 22:17:54,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:54,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-13 22:17:54,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:54,461 INFO L124 PetriNetUnfolderBase]: 450/2035 cut-off events. [2025-03-13 22:17:54,462 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:54,465 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-13 22:17:54,470 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-13 22:17:54,470 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 435 transitions, 1084 flow [2025-03-13 22:17:54,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-13 22:17:54,474 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-13 22:17:54,474 INFO L175 Difference]: Start difference. First operand has 437 places, 436 transitions, 886 flow. Second operand 6 states and 2153 transitions. [2025-03-13 22:17:54,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 435 transitions, 1084 flow [2025-03-13 22:17:54,476 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 435 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:54,479 INFO L231 Difference]: Finished difference. Result has 440 places, 435 transitions, 892 flow [2025-03-13 22:17:54,480 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-13 22:17:54,481 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-13 22:17:54,481 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 435 transitions, 892 flow [2025-03-13 22:17:54,482 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-13 22:17:54,483 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:54,483 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-13 22:17:54,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:17:54,483 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-13 22:17:54,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash 475602129, now seen corresponding path program 1 times [2025-03-13 22:17:54,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:54,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1393096120] [2025-03-13 22:17:54,484 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:54,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:54,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-13 22:17:54,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-13 22:17:54,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:54,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:54,547 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:54,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:54,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1393096120] [2025-03-13 22:17:54,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1393096120] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:54,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:54,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:54,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141906459] [2025-03-13 22:17:54,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:54,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:54,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:54,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:54,559 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-13 22:17:54,561 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-13 22:17:54,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:54,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-13 22:17:54,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:54,647 INFO L124 PetriNetUnfolderBase]: 29/923 cut-off events. [2025-03-13 22:17:54,648 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:54,651 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-13 22:17:54,653 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-13 22:17:54,653 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 436 transitions, 920 flow [2025-03-13 22:17:54,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:54,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:54,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-13 22:17:54,655 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-13 22:17:54,655 INFO L175 Difference]: Start difference. First operand has 440 places, 435 transitions, 892 flow. Second operand 3 states and 1307 transitions. [2025-03-13 22:17:54,655 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 436 transitions, 920 flow [2025-03-13 22:17:54,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 436 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:54,662 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 894 flow [2025-03-13 22:17:54,662 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-13 22:17:54,663 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-13 22:17:54,663 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 894 flow [2025-03-13 22:17:54,664 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-13 22:17:54,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:54,664 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-13 22:17:54,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:17:54,664 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-13 22:17:54,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:54,665 INFO L85 PathProgramCache]: Analyzing trace with hash 637441325, now seen corresponding path program 1 times [2025-03-13 22:17:54,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:54,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89568573] [2025-03-13 22:17:54,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:54,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:54,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-13 22:17:54,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-13 22:17:54,697 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:54,697 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:55,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:55,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:55,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89568573] [2025-03-13 22:17:55,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89568573] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:55,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:55,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:55,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705840488] [2025-03-13 22:17:55,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:55,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:55,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:55,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:55,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:55,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-13 22:17:55,584 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-13 22:17:55,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:55,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-13 22:17:55,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:55,771 INFO L124 PetriNetUnfolderBase]: 75/1235 cut-off events. [2025-03-13 22:17:55,771 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:17:55,773 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-13 22:17:55,775 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-13 22:17:55,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 1018 flow [2025-03-13 22:17:55,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:55,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-13 22:17:55,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-13 22:17:55,779 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 894 flow. Second operand 6 states and 2338 transitions. [2025-03-13 22:17:55,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 1018 flow [2025-03-13 22:17:55,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 435 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:55,783 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 900 flow [2025-03-13 22:17:55,784 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-13 22:17:55,784 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2025-03-13 22:17:55,784 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 900 flow [2025-03-13 22:17:55,785 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-13 22:17:55,786 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:55,786 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-13 22:17:55,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:17:55,786 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-13 22:17:55,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:55,786 INFO L85 PathProgramCache]: Analyzing trace with hash -645751327, now seen corresponding path program 1 times [2025-03-13 22:17:55,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:55,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136071802] [2025-03-13 22:17:55,787 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:55,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:55,805 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-13 22:17:55,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-13 22:17:55,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:55,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:56,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:56,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:56,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136071802] [2025-03-13 22:17:56,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136071802] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:56,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:56,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:56,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583399793] [2025-03-13 22:17:56,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:56,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:56,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:56,176 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:56,176 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:56,493 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-13 22:17:56,495 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-13 22:17:56,496 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:56,496 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-13 22:17:56,496 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:56,824 INFO L124 PetriNetUnfolderBase]: 450/2215 cut-off events. [2025-03-13 22:17:56,824 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:17:56,828 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-13 22:17:56,834 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/434 dead transitions. [2025-03-13 22:17:56,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 434 transitions, 1098 flow [2025-03-13 22:17:56,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:56,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:56,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-13 22:17:56,839 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-13 22:17:56,839 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 900 flow. Second operand 6 states and 2153 transitions. [2025-03-13 22:17:56,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 434 transitions, 1098 flow [2025-03-13 22:17:56,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 434 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:56,844 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 898 flow [2025-03-13 22:17:56,845 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-13 22:17:56,846 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-13 22:17:56,846 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 898 flow [2025-03-13 22:17:56,848 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-13 22:17:56,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:56,848 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-13 22:17:56,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:17:56,848 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-13 22:17:56,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:56,849 INFO L85 PathProgramCache]: Analyzing trace with hash 1184388287, now seen corresponding path program 1 times [2025-03-13 22:17:56,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:56,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439349992] [2025-03-13 22:17:56,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:56,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:56,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-13 22:17:56,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-13 22:17:56,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:56,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:57,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:57,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:57,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439349992] [2025-03-13 22:17:57,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439349992] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:57,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:57,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:57,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748620866] [2025-03-13 22:17:57,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:57,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:57,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:57,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:57,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:57,597 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-13 22:17:57,599 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-13 22:17:57,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:57,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-13 22:17:57,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:57,814 INFO L124 PetriNetUnfolderBase]: 450/2211 cut-off events. [2025-03-13 22:17:57,814 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:17:57,818 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-13 22:17:57,824 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-03-13 22:17:57,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 433 transitions, 1088 flow [2025-03-13 22:17:57,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:57,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:57,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-13 22:17:57,828 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-13 22:17:57,828 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 898 flow. Second operand 6 states and 2173 transitions. [2025-03-13 22:17:57,828 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 433 transitions, 1088 flow [2025-03-13 22:17:57,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 433 transitions, 1078 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:57,834 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 896 flow [2025-03-13 22:17:57,835 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-13 22:17:57,836 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-13 22:17:57,837 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 896 flow [2025-03-13 22:17:57,838 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-13 22:17:57,838 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:57,838 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-13 22:17:57,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:17:57,838 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-13 22:17:57,839 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:57,839 INFO L85 PathProgramCache]: Analyzing trace with hash 157923113, now seen corresponding path program 1 times [2025-03-13 22:17:57,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:57,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397065750] [2025-03-13 22:17:57,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:57,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:57,865 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-13 22:17:57,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-13 22:17:57,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:57,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:58,176 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:17:58,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:58,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397065750] [2025-03-13 22:17:58,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397065750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:58,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:58,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:58,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916334129] [2025-03-13 22:17:58,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:58,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:58,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:58,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:58,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:58,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-13 22:17:58,489 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-13 22:17:58,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:58,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-13 22:17:58,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:58,725 INFO L124 PetriNetUnfolderBase]: 450/2207 cut-off events. [2025-03-13 22:17:58,725 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:58,729 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-13 22:17:58,734 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/432 dead transitions. [2025-03-13 22:17:58,734 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 432 transitions, 1086 flow [2025-03-13 22:17:58,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:58,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:58,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-13 22:17:58,740 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-13 22:17:58,740 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 896 flow. Second operand 6 states and 2173 transitions. [2025-03-13 22:17:58,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 432 transitions, 1086 flow [2025-03-13 22:17:58,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 432 transitions, 1076 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:58,747 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 894 flow [2025-03-13 22:17:58,747 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-13 22:17:58,748 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-13 22:17:58,748 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 894 flow [2025-03-13 22:17:58,750 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-13 22:17:58,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:58,750 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-13 22:17:58,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:17:58,750 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-13 22:17:58,751 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:58,751 INFO L85 PathProgramCache]: Analyzing trace with hash -56164290, now seen corresponding path program 1 times [2025-03-13 22:17:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685030271] [2025-03-13 22:17:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:58,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-13 22:17:58,788 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-13 22:17:58,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:58,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:59,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-13 22:17:59,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:59,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685030271] [2025-03-13 22:17:59,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685030271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:59,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:59,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:59,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741960840] [2025-03-13 22:17:59,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:59,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:59,177 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:59,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:59,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:59,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-13 22:17:59,628 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-13 22:17:59,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:59,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-13 22:17:59,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:59,828 INFO L124 PetriNetUnfolderBase]: 450/2203 cut-off events. [2025-03-13 22:17:59,828 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:17:59,832 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-13 22:17:59,837 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/431 dead transitions. [2025-03-13 22:17:59,837 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 431 transitions, 1094 flow [2025-03-13 22:17:59,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:59,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-13 22:17:59,841 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-13 22:17:59,841 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 894 flow. Second operand 6 states and 2148 transitions. [2025-03-13 22:17:59,841 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 431 transitions, 1094 flow [2025-03-13 22:17:59,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:59,846 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 892 flow [2025-03-13 22:17:59,847 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-13 22:17:59,847 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-13 22:17:59,847 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 892 flow [2025-03-13 22:17:59,848 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-13 22:17:59,848 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:59,848 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-13 22:17:59,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:17:59,849 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-13 22:17:59,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:59,849 INFO L85 PathProgramCache]: Analyzing trace with hash -273165573, now seen corresponding path program 1 times [2025-03-13 22:17:59,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:59,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597750376] [2025-03-13 22:17:59,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:59,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:59,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:17:59,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:17:59,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:59,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:59,967 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-13 22:17:59,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:59,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597750376] [2025-03-13 22:17:59,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597750376] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:59,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317999491] [2025-03-13 22:17:59,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:59,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:59,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:59,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:59,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-13 22:18:00,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:18:00,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:18:00,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:00,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:00,136 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:18:00,142 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:00,303 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-13 22:18:00,303 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:00,421 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-13 22:18:00,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317999491] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:00,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:00,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:18:00,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98180960] [2025-03-13 22:18:00,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:00,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:18:00,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:00,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:18:00,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:18:00,452 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-13 22:18:00,455 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-13 22:18:00,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:00,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-13 22:18:00,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:00,593 INFO L124 PetriNetUnfolderBase]: 29/1087 cut-off events. [2025-03-13 22:18:00,593 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-13 22:18:00,594 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-13 22:18:00,596 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 15 selfloop transitions, 9 changer transitions 0/439 dead transitions. [2025-03-13 22:18:00,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 958 flow [2025-03-13 22:18:00,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:18:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:18:00,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3878 transitions. [2025-03-13 22:18:00,601 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639572458364405 [2025-03-13 22:18:00,601 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 892 flow. Second operand 9 states and 3878 transitions. [2025-03-13 22:18:00,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 958 flow [2025-03-13 22:18:00,603 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:00,606 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 932 flow [2025-03-13 22:18:00,607 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-13 22:18:00,607 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-13 22:18:00,607 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 932 flow [2025-03-13 22:18:00,609 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-13 22:18:00,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:00,610 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-13 22:18:00,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:18:00,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-13 22:18:00,812 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-13 22:18:00,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:00,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1694650929, now seen corresponding path program 2 times [2025-03-13 22:18:00,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:00,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794314247] [2025-03-13 22:18:00,813 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:00,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:00,872 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-03-13 22:18:00,876 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 403 statements. [2025-03-13 22:18:00,876 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:00,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:01,023 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-13 22:18:01,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:01,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794314247] [2025-03-13 22:18:01,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794314247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:01,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:01,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:01,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561266911] [2025-03-13 22:18:01,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:01,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:01,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:01,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:01,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:01,798 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 447 [2025-03-13 22:18:01,800 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-13 22:18:01,800 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:01,800 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 447 [2025-03-13 22:18:01,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:01,961 INFO L124 PetriNetUnfolderBase]: 75/1401 cut-off events. [2025-03-13 22:18:01,961 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-13 22:18:01,964 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-13 22:18:01,966 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 61 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-13 22:18:01,966 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 435 transitions, 1070 flow [2025-03-13 22:18:01,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:01,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:01,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-03-13 22:18:01,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854958985831469 [2025-03-13 22:18:01,970 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 932 flow. Second operand 6 states and 2293 transitions. [2025-03-13 22:18:01,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 435 transitions, 1070 flow [2025-03-13 22:18:01,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 435 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:18:01,977 INFO L231 Difference]: Finished difference. Result has 445 places, 435 transitions, 942 flow [2025-03-13 22:18:01,978 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-13 22:18:01,980 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2025-03-13 22:18:01,980 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 435 transitions, 942 flow [2025-03-13 22:18:01,981 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-13 22:18:01,981 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:01,982 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-13 22:18:01,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:18:01,982 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-13 22:18:01,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:01,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1531654921, now seen corresponding path program 1 times [2025-03-13 22:18:01,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:01,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197824748] [2025-03-13 22:18:01,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:01,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:02,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-13 22:18:02,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-13 22:18:02,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:02,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:02,293 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-13 22:18:02,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197824748] [2025-03-13 22:18:02,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197824748] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:02,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629819428] [2025-03-13 22:18:02,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:02,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:02,296 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:18:02,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-13 22:18:02,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-13 22:18:02,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-13 22:18:02,625 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:02,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:02,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:18:02,643 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:02,932 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-13 22:18:02,932 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:03,252 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-13 22:18:03,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629819428] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:03,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:03,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-13 22:18:03,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806862056] [2025-03-13 22:18:03,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:03,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-13 22:18:03,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:03,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-13 22:18:03,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-13 22:18:03,327 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 447 [2025-03-13 22:18:03,333 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-13 22:18:03,333 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:03,333 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 447 [2025-03-13 22:18:03,333 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:04,380 INFO L124 PetriNetUnfolderBase]: 30/2465 cut-off events. [2025-03-13 22:18:04,381 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-13 22:18:04,382 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-13 22:18:04,384 INFO L140 encePairwiseOnDemand]: 436/447 looper letters, 47 selfloop transitions, 68 changer transitions 0/521 dead transitions. [2025-03-13 22:18:04,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 521 transitions, 1582 flow [2025-03-13 22:18:04,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-13 22:18:04,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-13 22:18:04,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 26714 transitions. [2025-03-13 22:18:04,404 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486168815027876 [2025-03-13 22:18:04,404 INFO L175 Difference]: Start difference. First operand has 445 places, 435 transitions, 942 flow. Second operand 63 states and 26714 transitions. [2025-03-13 22:18:04,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 521 transitions, 1582 flow [2025-03-13 22:18:04,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 521 transitions, 1562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:04,411 INFO L231 Difference]: Finished difference. Result has 518 places, 497 transitions, 1442 flow [2025-03-13 22:18:04,411 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-13 22:18:04,412 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 76 predicate places. [2025-03-13 22:18:04,412 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 497 transitions, 1442 flow [2025-03-13 22:18:04,414 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-13 22:18:04,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:04,414 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-13 22:18:04,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:18:04,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-13 22:18:04,619 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-13 22:18:04,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:04,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1056443811, now seen corresponding path program 2 times [2025-03-13 22:18:04,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:04,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713717678] [2025-03-13 22:18:04,621 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:04,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:04,800 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1465 statements into 2 equivalence classes. [2025-03-13 22:18:04,804 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 147 of 1465 statements. [2025-03-13 22:18:04,804 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:04,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:05,096 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-13 22:18:05,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:05,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713717678] [2025-03-13 22:18:05,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713717678] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:05,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:05,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602178076] [2025-03-13 22:18:05,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:05,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:05,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:05,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:05,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:05,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-13 22:18:05,547 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-13 22:18:05,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:05,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-13 22:18:05,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:06,296 INFO L124 PetriNetUnfolderBase]: 188/3246 cut-off events. [2025-03-13 22:18:06,297 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-13 22:18:06,301 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-13 22:18:06,305 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/496 dead transitions. [2025-03-13 22:18:06,305 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 496 transitions, 1566 flow [2025-03-13 22:18:06,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:06,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:06,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-13 22:18:06,307 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-13 22:18:06,307 INFO L175 Difference]: Start difference. First operand has 518 places, 497 transitions, 1442 flow. Second operand 6 states and 2338 transitions. [2025-03-13 22:18:06,307 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 496 transitions, 1566 flow [2025-03-13 22:18:06,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 496 transitions, 1490 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-13 22:18:06,315 INFO L231 Difference]: Finished difference. Result has 515 places, 496 transitions, 1374 flow [2025-03-13 22:18:06,316 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-13 22:18:06,316 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 73 predicate places. [2025-03-13 22:18:06,316 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1374 flow [2025-03-13 22:18:06,317 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-13 22:18:06,317 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:06,318 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-13 22:18:06,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:18:06,318 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-13 22:18:06,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:06,321 INFO L85 PathProgramCache]: Analyzing trace with hash 277532280, now seen corresponding path program 1 times [2025-03-13 22:18:06,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:06,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476564231] [2025-03-13 22:18:06,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:06,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:06,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-13 22:18:06,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-13 22:18:06,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:06,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:08,791 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-13 22:18:08,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476564231] [2025-03-13 22:18:08,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476564231] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:08,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996412088] [2025-03-13 22:18:08,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:08,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:08,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:08,793 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:18:08,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-13 22:18:09,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-13 22:18:09,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-13 22:18:09,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:09,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:09,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 5753 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:18:09,809 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:10,310 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-13 22:18:10,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:10,897 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-13 22:18:10,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996412088] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:10,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:10,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-13 22:18:10,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729247210] [2025-03-13 22:18:10,897 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:10,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-13 22:18:10,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:10,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-13 22:18:10,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-13 22:18:10,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-13 22:18:10,937 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-13 22:18:10,937 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:10,937 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-13 22:18:10,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:12,760 INFO L124 PetriNetUnfolderBase]: 30/4624 cut-off events. [2025-03-13 22:18:12,760 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-03-13 22:18:12,763 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-13 22:18:12,766 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 47 selfloop transitions, 135 changer transitions 0/597 dead transitions. [2025-03-13 22:18:12,766 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 597 transitions, 2502 flow [2025-03-13 22:18:12,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-13 22:18:12,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-13 22:18:12,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19340 transitions. [2025-03-13 22:18:12,780 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614715386527467 [2025-03-13 22:18:12,781 INFO L175 Difference]: Start difference. First operand has 515 places, 496 transitions, 1374 flow. Second operand 45 states and 19340 transitions. [2025-03-13 22:18:12,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 597 transitions, 2502 flow [2025-03-13 22:18:12,788 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 597 transitions, 2492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:12,793 INFO L231 Difference]: Finished difference. Result has 563 places, 571 transitions, 2238 flow [2025-03-13 22:18:12,794 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-13 22:18:12,794 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 121 predicate places. [2025-03-13 22:18:12,794 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 571 transitions, 2238 flow [2025-03-13 22:18:12,797 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-13 22:18:12,797 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:12,798 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-13 22:18:12,814 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-13 22:18:12,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:12,999 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-13 22:18:13,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:13,004 INFO L85 PathProgramCache]: Analyzing trace with hash -255393672, now seen corresponding path program 2 times [2025-03-13 22:18:13,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:13,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366454796] [2025-03-13 22:18:13,005 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:13,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:13,364 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2912 statements into 2 equivalence classes. [2025-03-13 22:18:13,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 2912 statements. [2025-03-13 22:18:13,370 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:13,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:13,697 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-13 22:18:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366454796] [2025-03-13 22:18:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366454796] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157975143] [2025-03-13 22:18:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:13,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:13,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:13,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:13,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:13,993 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-13 22:18:13,994 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-13 22:18:13,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:13,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-13 22:18:13,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:18,324 INFO L124 PetriNetUnfolderBase]: 1238/7754 cut-off events. [2025-03-13 22:18:18,325 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-13 22:18:18,334 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-13 22:18:18,343 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/570 dead transitions. [2025-03-13 22:18:18,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 570 transitions, 2438 flow [2025-03-13 22:18:18,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:18,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:18,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-13 22:18:18,345 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-13 22:18:18,345 INFO L175 Difference]: Start difference. First operand has 563 places, 571 transitions, 2238 flow. Second operand 6 states and 2148 transitions. [2025-03-13 22:18:18,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 570 transitions, 2438 flow [2025-03-13 22:18:18,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 570 transitions, 2330 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-13 22:18:18,359 INFO L231 Difference]: Finished difference. Result has 549 places, 570 transitions, 2138 flow [2025-03-13 22:18:18,359 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-13 22:18:18,360 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 107 predicate places. [2025-03-13 22:18:18,360 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 570 transitions, 2138 flow [2025-03-13 22:18:18,360 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-13 22:18:18,360 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:18,361 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-13 22:18:18,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:18:18,361 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-13 22:18:18,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:18,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1030857171, now seen corresponding path program 1 times [2025-03-13 22:18:18,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:18,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716914739] [2025-03-13 22:18:18,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:18,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:18,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-13 22:18:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-13 22:18:18,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:18,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:29,572 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-13 22:18:29,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716914739] [2025-03-13 22:18:29,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716914739] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:29,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401255020] [2025-03-13 22:18:29,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:29,572 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:29,572 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:29,574 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:18:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-13 22:18:30,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-13 22:18:31,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-13 22:18:31,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:31,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:31,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 11716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-13 22:18:31,535 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:32,478 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-13 22:18:32,478 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:18:33,959 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-13 22:18:33,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401255020] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:18:33,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:18:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-13 22:18:33,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954063859] [2025-03-13 22:18:33,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:18:33,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-13 22:18:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:33,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-13 22:18:33,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-13 22:18:34,006 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-13 22:18:34,019 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-13 22:18:34,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:34,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-13 22:18:34,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:40,247 INFO L124 PetriNetUnfolderBase]: 30/8673 cut-off events. [2025-03-13 22:18:40,247 INFO L125 PetriNetUnfolderBase]: For 13371/13371 co-relation queries the response was YES. [2025-03-13 22:18:40,254 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-13 22:18:40,259 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 92 selfloop transitions, 270 changer transitions 0/776 dead transitions. [2025-03-13 22:18:40,259 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 776 transitions, 5048 flow [2025-03-13 22:18:40,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-13 22:18:40,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-13 22:18:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 38667 transitions. [2025-03-13 22:18:40,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611483967188665 [2025-03-13 22:18:40,286 INFO L175 Difference]: Start difference. First operand has 549 places, 570 transitions, 2138 flow. Second operand 90 states and 38667 transitions. [2025-03-13 22:18:40,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 776 transitions, 5048 flow [2025-03-13 22:18:40,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 776 transitions, 5038 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:18:40,312 INFO L231 Difference]: Finished difference. Result has 649 places, 708 transitions, 4120 flow [2025-03-13 22:18:40,312 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-13 22:18:40,313 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 207 predicate places. [2025-03-13 22:18:40,313 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 708 transitions, 4120 flow [2025-03-13 22:18:40,317 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-13 22:18:40,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:40,319 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-13 22:18:40,349 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-13 22:18:40,519 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-13 22:18:40,520 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-13 22:18:40,529 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:40,530 INFO L85 PathProgramCache]: Analyzing trace with hash -1092205587, now seen corresponding path program 2 times [2025-03-13 22:18:40,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:40,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608899766] [2025-03-13 22:18:40,530 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:18:40,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:41,138 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5641 statements into 2 equivalence classes. [2025-03-13 22:18:41,140 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 5641 statements. [2025-03-13 22:18:41,140 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:18:41,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:41,413 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-13 22:18:41,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608899766] [2025-03-13 22:18:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608899766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:18:41,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:18:41,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:18:41,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196299661] [2025-03-13 22:18:41,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:18:41,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:18:41,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:18:41,416 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:18:41,416 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:18:42,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 447 [2025-03-13 22:18:42,148 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-13 22:18:42,148 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:18:42,148 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 447 [2025-03-13 22:18:42,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:18:49,502 INFO L124 PetriNetUnfolderBase]: 200/9574 cut-off events. [2025-03-13 22:18:49,502 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-03-13 22:18:49,513 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-13 22:18:49,520 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 75 selfloop transitions, 23 changer transitions 0/743 dead transitions. [2025-03-13 22:18:49,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 743 transitions, 4394 flow [2025-03-13 22:18:49,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:18:49,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:18:49,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2379 transitions. [2025-03-13 22:18:49,522 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870246085011185 [2025-03-13 22:18:49,522 INFO L175 Difference]: Start difference. First operand has 649 places, 708 transitions, 4120 flow. Second operand 6 states and 2379 transitions. [2025-03-13 22:18:49,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 743 transitions, 4394 flow [2025-03-13 22:18:49,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 743 transitions, 4040 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-13 22:18:49,555 INFO L231 Difference]: Finished difference. Result has 617 places, 730 transitions, 3924 flow [2025-03-13 22:18:49,555 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-13 22:18:49,556 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 175 predicate places. [2025-03-13 22:18:49,556 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 730 transitions, 3924 flow [2025-03-13 22:18:49,557 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-13 22:18:49,557 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:18:49,558 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-13 22:18:49,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:18:49,558 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-13 22:18:49,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:18:49,571 INFO L85 PathProgramCache]: Analyzing trace with hash 975219702, now seen corresponding path program 1 times [2025-03-13 22:18:49,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:18:49,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979216667] [2025-03-13 22:18:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:49,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:18:50,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-03-13 22:18:50,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-03-13 22:18:50,832 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:50,832 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:01,089 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-13 22:19:01,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:19:01,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979216667] [2025-03-13 22:19:01,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979216667] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:19:01,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145786047] [2025-03-13 22:19:01,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:19:01,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:19:01,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:19:01,092 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:19:01,093 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-13 22:19:03,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-03-13 22:19:04,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-03-13 22:19:04,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:19:04,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:19:05,097 INFO L256 TraceCheckSpWp]: Trace formula consists of 22774 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-13 22:19:05,148 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:19:09,671 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-13 22:19:09,671 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:19:13,509 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-13 22:19:13,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145786047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:19:13,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:19:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2025-03-13 22:19:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086110464] [2025-03-13 22:19:13,511 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:19:13,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-13 22:19:13,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:19:13,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-13 22:19:13,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-03-13 22:19:13,545 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-13 22:19:13,548 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 617 places, 730 transitions, 3924 flow. Second operand has 14 states, 14 states have (on average 430.07142857142856) internal successors, (6021), 14 states have internal predecessors, (6021), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:19:13,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:19:13,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-13 22:19:13,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand