./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 798a7b37 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-?-798a7b3-m [2025-03-04 06:47:27,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:47:27,959 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:47:27,963 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:47:27,963 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:47:27,979 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:47:27,979 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:47:27,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:47:27,980 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:47:27,980 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:47:27,980 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:47:27,980 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:47:27,980 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:47:27,980 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:47:27,980 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:47:27,981 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:47:27,982 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:27,982 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:47:27,982 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:47:27,983 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:47:27,983 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-04 06:47:28,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:47:28,208 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:47:28,209 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:47:28,210 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:47:28,210 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:47:28,211 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-04 06:47:29,290 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77e12a21/10b10c674be841fab00a6804d84e16dc/FLAG0174f7943 [2025-03-04 06:47:29,575 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:47:29,579 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_23-evilcollapse_rc.i [2025-03-04 06:47:29,597 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77e12a21/10b10c674be841fab00a6804d84e16dc/FLAG0174f7943 [2025-03-04 06:47:29,850 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b77e12a21/10b10c674be841fab00a6804d84e16dc [2025-03-04 06:47:29,852 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:47:29,853 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:47:29,855 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:29,855 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:47:29,859 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:47:29,860 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:29" (1/1) ... [2025-03-04 06:47:29,861 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5836acc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:29, skipping insertion in model container [2025-03-04 06:47:29,861 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:29" (1/1) ... [2025-03-04 06:47:29,886 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:47:30,195 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,196 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,196 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,199 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,220 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:30,244 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:47:30,277 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,280 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,280 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,281 WARN L1731 CHandler]: Possible shadowing of function new [2025-03-04 06:47:30,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:30,335 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:47:30,336 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30 WrapperNode [2025-03-04 06:47:30,336 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:30,337 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:30,337 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:47:30,337 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:47:30,341 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,353 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,374 INFO L138 Inliner]: procedures = 274, calls = 101, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 322 [2025-03-04 06:47:30,374 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:30,374 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:47:30,374 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:47:30,374 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:47:30,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,384 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,386 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,406 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,407 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,413 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,415 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,423 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:47:30,423 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:47:30,423 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:47:30,423 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:47:30,424 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (1/1) ... [2025-03-04 06:47:30,428 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:30,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:30,450 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-04 06:47:30,452 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-04 06:47:30,469 INFO L130 BoogieDeclarations]: Found specification of procedure f [2025-03-04 06:47:30,469 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2025-03-04 06:47:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:47:30,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:47:30,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:47:30,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:47:30,472 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:47:30,591 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:47:30,593 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:47:31,096 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:47:31,096 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:47:31,124 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:47:31,124 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:47:31,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:31 BoogieIcfgContainer [2025-03-04 06:47:31,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:47:31,126 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:47:31,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:47:31,131 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:47:31,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:47:29" (1/3) ... [2025-03-04 06:47:31,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac1adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:31, skipping insertion in model container [2025-03-04 06:47:31,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:30" (2/3) ... [2025-03-04 06:47:31,132 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27ac1adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:31, skipping insertion in model container [2025-03-04 06:47:31,132 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:31" (3/3) ... [2025-03-04 06:47:31,133 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_23-evilcollapse_rc.i [2025-03-04 06:47:31,143 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:47:31,145 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-04 06:47:31,145 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:47:31,275 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:47:31,318 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 444 places, 447 transitions, 902 flow [2025-03-04 06:47:31,449 INFO L124 PetriNetUnfolderBase]: 10/445 cut-off events. [2025-03-04 06:47:31,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:31,460 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-04 06:47:31,460 INFO L82 GeneralOperation]: Start removeDead. Operand has 444 places, 447 transitions, 902 flow [2025-03-04 06:47:31,467 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 442 places, 445 transitions, 896 flow [2025-03-04 06:47:31,476 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:47:31,486 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;@68124997, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:47:31,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-03-04 06:47:31,503 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:47:31,504 INFO L124 PetriNetUnfolderBase]: 0/102 cut-off events. [2025-03-04 06:47:31,504 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:31,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:31,505 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-04 06:47:31,505 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-04 06:47:31,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:31,511 INFO L85 PathProgramCache]: Analyzing trace with hash -1292152077, now seen corresponding path program 1 times [2025-03-04 06:47:31,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:31,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092828087] [2025-03-04 06:47:31,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:31,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:31,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-04 06:47:31,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-04 06:47:31,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:31,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:32,335 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-04 06:47:32,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:32,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092828087] [2025-03-04 06:47:32,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092828087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:32,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:32,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:32,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864359191] [2025-03-04 06:47:32,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:32,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:32,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:32,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:32,365 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:32,780 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-04 06:47:32,785 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-04 06:47:32,785 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:32,785 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-04 06:47:32,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:33,166 INFO L124 PetriNetUnfolderBase]: 449/1917 cut-off events. [2025-03-04 06:47:33,166 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-03-04 06:47:33,173 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-04 06:47:33,182 INFO L140 encePairwiseOnDemand]: 431/447 looper letters, 88 selfloop transitions, 10 changer transitions 2/439 dead transitions. [2025-03-04 06:47:33,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 1080 flow [2025-03-04 06:47:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:33,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:33,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2162 transitions. [2025-03-04 06:47:33,204 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8061148396718867 [2025-03-04 06:47:33,206 INFO L175 Difference]: Start difference. First operand has 442 places, 445 transitions, 896 flow. Second operand 6 states and 2162 transitions. [2025-03-04 06:47:33,207 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 1080 flow [2025-03-04 06:47:33,214 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 439 transitions, 1078 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-04 06:47:33,223 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 898 flow [2025-03-04 06:47:33,225 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-04 06:47:33,229 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-04 06:47:33,230 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 898 flow [2025-03-04 06:47:33,231 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-04 06:47:33,231 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:33,231 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-04 06:47:33,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:33,232 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-04 06:47:33,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:33,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1451285049, now seen corresponding path program 1 times [2025-03-04 06:47:33,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:33,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344635280] [2025-03-04 06:47:33,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:33,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:33,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-03-04 06:47:33,262 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-03-04 06:47:33,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:33,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:33,669 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-04 06:47:33,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:33,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344635280] [2025-03-04 06:47:33,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344635280] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:33,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:33,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:33,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046400160] [2025-03-04 06:47:33,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:33,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:33,671 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:33,671 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:34,110 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 343 out of 447 [2025-03-04 06:47:34,112 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-04 06:47:34,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:34,112 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 343 of 447 [2025-03-04 06:47:34,112 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:34,355 INFO L124 PetriNetUnfolderBase]: 449/1913 cut-off events. [2025-03-04 06:47:34,356 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:34,358 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-04 06:47:34,363 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 88 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-04 06:47:34,363 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 435 transitions, 1090 flow [2025-03-04 06:47:34,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:34,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:34,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2158 transitions. [2025-03-04 06:47:34,367 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046234153616704 [2025-03-04 06:47:34,367 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 898 flow. Second operand 6 states and 2158 transitions. [2025-03-04 06:47:34,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 435 transitions, 1090 flow [2025-03-04 06:47:34,369 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 435 transitions, 1070 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:34,373 INFO L231 Difference]: Finished difference. Result has 439 places, 435 transitions, 894 flow [2025-03-04 06:47:34,374 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-04 06:47:34,375 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-04 06:47:34,375 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 435 transitions, 894 flow [2025-03-04 06:47:34,376 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-04 06:47:34,376 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:34,376 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-04 06:47:34,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:34,377 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-04 06:47:34,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:34,378 INFO L85 PathProgramCache]: Analyzing trace with hash 556577461, now seen corresponding path program 1 times [2025-03-04 06:47:34,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:34,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927049900] [2025-03-04 06:47:34,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:34,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:34,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-04 06:47:34,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-04 06:47:34,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:34,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:34,487 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-04 06:47:34,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:34,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927049900] [2025-03-04 06:47:34,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927049900] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:34,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:34,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:34,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364174819] [2025-03-04 06:47:34,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:34,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:34,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:34,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:34,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:34,503 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-04 06:47:34,504 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-04 06:47:34,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:34,505 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-04 06:47:34,505 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:34,596 INFO L124 PetriNetUnfolderBase]: 29/737 cut-off events. [2025-03-04 06:47:34,597 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:34,598 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-04 06:47:34,599 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-04 06:47:34,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 436 transitions, 922 flow [2025-03-04 06:47:34,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:34,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:34,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-04 06:47:34,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-04 06:47:34,602 INFO L175 Difference]: Start difference. First operand has 439 places, 435 transitions, 894 flow. Second operand 3 states and 1307 transitions. [2025-03-04 06:47:34,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 436 transitions, 922 flow [2025-03-04 06:47:34,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 436 places, 436 transitions, 902 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:34,609 INFO L231 Difference]: Finished difference. Result has 437 places, 436 transitions, 886 flow [2025-03-04 06:47:34,610 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-04 06:47:34,611 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-04 06:47:34,611 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 436 transitions, 886 flow [2025-03-04 06:47:34,612 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-04 06:47:34,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:34,612 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-04 06:47:34,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:34,612 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-04 06:47:34,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:34,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1525146210, now seen corresponding path program 1 times [2025-03-04 06:47:34,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:34,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557051051] [2025-03-04 06:47:34,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:34,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:34,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 06:47:34,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 06:47:34,648 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:34,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:35,101 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-04 06:47:35,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:35,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557051051] [2025-03-04 06:47:35,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557051051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:35,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:35,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:35,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458538730] [2025-03-04 06:47:35,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:35,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:35,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:35,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:35,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:35,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-04 06:47:35,438 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-04 06:47:35,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:35,438 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-04 06:47:35,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:35,758 INFO L124 PetriNetUnfolderBase]: 450/2035 cut-off events. [2025-03-04 06:47:35,758 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:35,762 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-04 06:47:35,768 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-04 06:47:35,768 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 435 transitions, 1084 flow [2025-03-04 06:47:35,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:35,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:35,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-04 06:47:35,772 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-04 06:47:35,772 INFO L175 Difference]: Start difference. First operand has 437 places, 436 transitions, 886 flow. Second operand 6 states and 2153 transitions. [2025-03-04 06:47:35,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 435 transitions, 1084 flow [2025-03-04 06:47:35,774 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 435 transitions, 1082 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:35,781 INFO L231 Difference]: Finished difference. Result has 440 places, 435 transitions, 892 flow [2025-03-04 06:47:35,782 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-04 06:47:35,783 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-04 06:47:35,783 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 435 transitions, 892 flow [2025-03-04 06:47:35,784 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-04 06:47:35,784 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:35,784 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:35,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:35,784 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-04 06:47:35,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:35,785 INFO L85 PathProgramCache]: Analyzing trace with hash 475602129, now seen corresponding path program 1 times [2025-03-04 06:47:35,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:35,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81066706] [2025-03-04 06:47:35,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:35,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:35,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-04 06:47:35,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-04 06:47:35,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:35,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:35,851 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-04 06:47:35,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:35,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81066706] [2025-03-04 06:47:35,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81066706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:35,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:35,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:35,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105369074] [2025-03-04 06:47:35,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:35,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:35,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:35,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:35,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:35,866 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 447 [2025-03-04 06:47:35,867 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-04 06:47:35,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:35,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 447 [2025-03-04 06:47:35,867 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:35,952 INFO L124 PetriNetUnfolderBase]: 29/923 cut-off events. [2025-03-04 06:47:35,952 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:35,955 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-04 06:47:35,959 INFO L140 encePairwiseOnDemand]: 444/447 looper letters, 11 selfloop transitions, 2 changer transitions 0/436 dead transitions. [2025-03-04 06:47:35,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 436 transitions, 920 flow [2025-03-04 06:47:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:35,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:35,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1307 transitions. [2025-03-04 06:47:35,962 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9746457867263236 [2025-03-04 06:47:35,962 INFO L175 Difference]: Start difference. First operand has 440 places, 435 transitions, 892 flow. Second operand 3 states and 1307 transitions. [2025-03-04 06:47:35,962 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 436 transitions, 920 flow [2025-03-04 06:47:35,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 436 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:35,970 INFO L231 Difference]: Finished difference. Result has 438 places, 436 transitions, 894 flow [2025-03-04 06:47:35,971 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-04 06:47:35,971 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-04 06:47:35,971 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 436 transitions, 894 flow [2025-03-04 06:47:35,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.3333333333333) internal successors, (1297), 3 states have internal predecessors, (1297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:35,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:35,972 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:35,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:47:35,972 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [fErr3ASSERT_VIOLATIONDATA_RACE, fErr2ASSERT_VIOLATIONDATA_RACE, fErr1ASSERT_VIOLATIONDATA_RACE, fErr0ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2025-03-04 06:47:35,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:35,973 INFO L85 PathProgramCache]: Analyzing trace with hash 637441325, now seen corresponding path program 1 times [2025-03-04 06:47:35,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:35,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697437705] [2025-03-04 06:47:35,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:35,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:35,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-04 06:47:36,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-04 06:47:36,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:36,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:36,465 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-04 06:47:36,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:36,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697437705] [2025-03-04 06:47:36,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697437705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:36,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:36,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:36,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747150459] [2025-03-04 06:47:36,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:36,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:36,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:36,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:36,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:37,032 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-04 06:47:37,035 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-04 06:47:37,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:37,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-04 06:47:37,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:37,219 INFO L124 PetriNetUnfolderBase]: 75/1235 cut-off events. [2025-03-04 06:47:37,219 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:37,221 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-04 06:47:37,223 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/435 dead transitions. [2025-03-04 06:47:37,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 435 transitions, 1018 flow [2025-03-04 06:47:37,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:37,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-04 06:47:37,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-04 06:47:37,227 INFO L175 Difference]: Start difference. First operand has 438 places, 436 transitions, 894 flow. Second operand 6 states and 2338 transitions. [2025-03-04 06:47:37,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 435 transitions, 1018 flow [2025-03-04 06:47:37,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 441 places, 435 transitions, 1016 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:37,232 INFO L231 Difference]: Finished difference. Result has 441 places, 435 transitions, 900 flow [2025-03-04 06:47:37,233 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-04 06:47:37,233 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -1 predicate places. [2025-03-04 06:47:37,233 INFO L471 AbstractCegarLoop]: Abstraction has has 441 places, 435 transitions, 900 flow [2025-03-04 06:47:37,234 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-04 06:47:37,235 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:37,235 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-04 06:47:37,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:37,235 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-04 06:47:37,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:37,235 INFO L85 PathProgramCache]: Analyzing trace with hash -645751327, now seen corresponding path program 1 times [2025-03-04 06:47:37,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:37,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419595416] [2025-03-04 06:47:37,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:37,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:37,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-03-04 06:47:37,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-03-04 06:47:37,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:37,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:37,659 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-04 06:47:37,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:37,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419595416] [2025-03-04 06:47:37,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419595416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:37,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:37,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:37,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388202126] [2025-03-04 06:47:37,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:37,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:37,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:37,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:37,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:37,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 342 out of 447 [2025-03-04 06:47:37,967 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-04 06:47:37,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:37,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 342 of 447 [2025-03-04 06:47:37,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:38,260 INFO L124 PetriNetUnfolderBase]: 450/2215 cut-off events. [2025-03-04 06:47:38,260 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:38,264 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-04 06:47:38,270 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 95 selfloop transitions, 5 changer transitions 0/434 dead transitions. [2025-03-04 06:47:38,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 434 transitions, 1098 flow [2025-03-04 06:47:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:38,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:38,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2153 transitions. [2025-03-04 06:47:38,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8027591349739001 [2025-03-04 06:47:38,274 INFO L175 Difference]: Start difference. First operand has 441 places, 435 transitions, 900 flow. Second operand 6 states and 2153 transitions. [2025-03-04 06:47:38,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 434 transitions, 1098 flow [2025-03-04 06:47:38,276 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 434 transitions, 1088 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:38,279 INFO L231 Difference]: Finished difference. Result has 440 places, 434 transitions, 898 flow [2025-03-04 06:47:38,279 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-04 06:47:38,280 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -2 predicate places. [2025-03-04 06:47:38,280 INFO L471 AbstractCegarLoop]: Abstraction has has 440 places, 434 transitions, 898 flow [2025-03-04 06:47:38,281 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-04 06:47:38,281 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:38,281 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-04 06:47:38,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:47:38,281 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-04 06:47:38,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:38,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1184388287, now seen corresponding path program 1 times [2025-03-04 06:47:38,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:38,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46088947] [2025-03-04 06:47:38,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:38,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:38,305 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-03-04 06:47:38,313 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-03-04 06:47:38,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:38,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:38,660 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-04 06:47:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46088947] [2025-03-04 06:47:38,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46088947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:38,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:38,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:38,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270810846] [2025-03-04 06:47:38,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:38,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:38,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:38,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:38,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:39,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-04 06:47:39,086 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-04 06:47:39,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:39,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-04 06:47:39,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:39,299 INFO L124 PetriNetUnfolderBase]: 450/2211 cut-off events. [2025-03-04 06:47:39,299 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:39,303 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-04 06:47:39,309 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/433 dead transitions. [2025-03-04 06:47:39,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 444 places, 433 transitions, 1088 flow [2025-03-04 06:47:39,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:39,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:39,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-04 06:47:39,313 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-04 06:47:39,313 INFO L175 Difference]: Start difference. First operand has 440 places, 434 transitions, 898 flow. Second operand 6 states and 2173 transitions. [2025-03-04 06:47:39,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 444 places, 433 transitions, 1088 flow [2025-03-04 06:47:39,315 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 433 transitions, 1078 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:39,318 INFO L231 Difference]: Finished difference. Result has 439 places, 433 transitions, 896 flow [2025-03-04 06:47:39,319 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-04 06:47:39,320 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -3 predicate places. [2025-03-04 06:47:39,320 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 433 transitions, 896 flow [2025-03-04 06:47:39,321 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-04 06:47:39,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:39,321 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-04 06:47:39,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:39,321 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-04 06:47:39,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:39,322 INFO L85 PathProgramCache]: Analyzing trace with hash 157923113, now seen corresponding path program 1 times [2025-03-04 06:47:39,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:39,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483979076] [2025-03-04 06:47:39,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:39,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-04 06:47:39,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-04 06:47:39,353 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:39,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:39,669 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-04 06:47:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:39,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483979076] [2025-03-04 06:47:39,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483979076] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:39,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699614483] [2025-03-04 06:47:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:39,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:39,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:39,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:39,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:39,975 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 346 out of 447 [2025-03-04 06:47:39,977 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-04 06:47:39,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:39,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 346 of 447 [2025-03-04 06:47:39,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:40,190 INFO L124 PetriNetUnfolderBase]: 450/2207 cut-off events. [2025-03-04 06:47:40,190 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:40,194 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-04 06:47:40,202 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 91 selfloop transitions, 5 changer transitions 0/432 dead transitions. [2025-03-04 06:47:40,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 443 places, 432 transitions, 1086 flow [2025-03-04 06:47:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:40,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2173 transitions. [2025-03-04 06:47:40,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8102162565249813 [2025-03-04 06:47:40,206 INFO L175 Difference]: Start difference. First operand has 439 places, 433 transitions, 896 flow. Second operand 6 states and 2173 transitions. [2025-03-04 06:47:40,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 443 places, 432 transitions, 1086 flow [2025-03-04 06:47:40,209 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 438 places, 432 transitions, 1076 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:40,211 INFO L231 Difference]: Finished difference. Result has 438 places, 432 transitions, 894 flow [2025-03-04 06:47:40,212 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-04 06:47:40,213 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -4 predicate places. [2025-03-04 06:47:40,213 INFO L471 AbstractCegarLoop]: Abstraction has has 438 places, 432 transitions, 894 flow [2025-03-04 06:47:40,214 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-04 06:47:40,214 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:40,214 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-04 06:47:40,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 06:47:40,214 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-04 06:47:40,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:40,214 INFO L85 PathProgramCache]: Analyzing trace with hash -56164290, now seen corresponding path program 1 times [2025-03-04 06:47:40,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:40,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021067198] [2025-03-04 06:47:40,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:40,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:40,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-03-04 06:47:40,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-03-04 06:47:40,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:40,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:40,612 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-04 06:47:40,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:40,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021067198] [2025-03-04 06:47:40,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021067198] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:40,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:40,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:40,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988165970] [2025-03-04 06:47:40,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:40,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:40,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:40,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:40,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:41,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-04 06:47:41,066 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-04 06:47:41,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:41,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-04 06:47:41,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:41,265 INFO L124 PetriNetUnfolderBase]: 450/2203 cut-off events. [2025-03-04 06:47:41,265 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:41,269 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-04 06:47:41,274 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/431 dead transitions. [2025-03-04 06:47:41,274 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 442 places, 431 transitions, 1094 flow [2025-03-04 06:47:41,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:41,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:41,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-04 06:47:41,277 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-04 06:47:41,277 INFO L175 Difference]: Start difference. First operand has 438 places, 432 transitions, 894 flow. Second operand 6 states and 2148 transitions. [2025-03-04 06:47:41,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 442 places, 431 transitions, 1094 flow [2025-03-04 06:47:41,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 431 transitions, 1084 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:41,282 INFO L231 Difference]: Finished difference. Result has 437 places, 431 transitions, 892 flow [2025-03-04 06:47:41,283 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-04 06:47:41,283 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, -5 predicate places. [2025-03-04 06:47:41,283 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 431 transitions, 892 flow [2025-03-04 06:47:41,284 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-04 06:47:41,284 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:41,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-04 06:47:41,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:41,284 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-04 06:47:41,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:41,285 INFO L85 PathProgramCache]: Analyzing trace with hash -273165573, now seen corresponding path program 1 times [2025-03-04 06:47:41,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:41,285 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880668217] [2025-03-04 06:47:41,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:41,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:41,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-04 06:47:41,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 06:47:41,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:41,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:41,450 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-04 06:47:41,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880668217] [2025-03-04 06:47:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880668217] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:41,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253269274] [2025-03-04 06:47:41,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:41,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:41,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:41,456 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-04 06:47:41,458 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-04 06:47:41,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-04 06:47:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-04 06:47:41,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:41,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:41,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 714 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:41,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:41,799 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-04 06:47:41,799 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:41,918 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-04 06:47:41,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253269274] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:41,920 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:41,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:41,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643215515] [2025-03-04 06:47:41,921 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:41,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:41,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:41,922 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:41,922 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:41,947 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-04 06:47:41,949 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-04 06:47:41,949 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:41,950 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-04 06:47:41,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:42,086 INFO L124 PetriNetUnfolderBase]: 29/1087 cut-off events. [2025-03-04 06:47:42,086 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:42,088 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-04 06:47:42,090 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 15 selfloop transitions, 9 changer transitions 0/439 dead transitions. [2025-03-04 06:47:42,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 439 transitions, 958 flow [2025-03-04 06:47:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:42,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:42,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3878 transitions. [2025-03-04 06:47:42,097 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9639572458364405 [2025-03-04 06:47:42,098 INFO L175 Difference]: Start difference. First operand has 437 places, 431 transitions, 892 flow. Second operand 9 states and 3878 transitions. [2025-03-04 06:47:42,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 439 transitions, 958 flow [2025-03-04 06:47:42,100 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 440 places, 439 transitions, 948 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:42,103 INFO L231 Difference]: Finished difference. Result has 443 places, 437 transitions, 932 flow [2025-03-04 06:47:42,103 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-04 06:47:42,104 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 1 predicate places. [2025-03-04 06:47:42,104 INFO L471 AbstractCegarLoop]: Abstraction has has 443 places, 437 transitions, 932 flow [2025-03-04 06:47:42,106 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-04 06:47:42,106 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:42,107 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-04 06:47:42,115 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-04 06:47:42,307 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-04 06:47:42,308 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-04 06:47:42,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:42,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1694650929, now seen corresponding path program 2 times [2025-03-04 06:47:42,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:42,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540438685] [2025-03-04 06:47:42,309 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:42,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:42,368 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 403 statements into 2 equivalence classes. [2025-03-04 06:47:42,371 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 403 statements. [2025-03-04 06:47:42,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:42,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:42,585 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-04 06:47:42,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:42,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540438685] [2025-03-04 06:47:42,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540438685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:42,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:42,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:42,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115574676] [2025-03-04 06:47:42,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:42,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:42,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:42,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:42,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:43,415 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 447 [2025-03-04 06:47:43,417 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-04 06:47:43,417 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:43,417 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 447 [2025-03-04 06:47:43,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:43,640 INFO L124 PetriNetUnfolderBase]: 75/1401 cut-off events. [2025-03-04 06:47:43,640 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2025-03-04 06:47:43,643 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-04 06:47:43,647 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 61 selfloop transitions, 10 changer transitions 0/435 dead transitions. [2025-03-04 06:47:43,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 435 transitions, 1070 flow [2025-03-04 06:47:43,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:43,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:43,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2293 transitions. [2025-03-04 06:47:43,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.854958985831469 [2025-03-04 06:47:43,653 INFO L175 Difference]: Start difference. First operand has 443 places, 437 transitions, 932 flow. Second operand 6 states and 2293 transitions. [2025-03-04 06:47:43,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 435 transitions, 1070 flow [2025-03-04 06:47:43,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 445 places, 435 transitions, 1064 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:43,659 INFO L231 Difference]: Finished difference. Result has 445 places, 435 transitions, 942 flow [2025-03-04 06:47:43,659 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-04 06:47:43,661 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 3 predicate places. [2025-03-04 06:47:43,661 INFO L471 AbstractCegarLoop]: Abstraction has has 445 places, 435 transitions, 942 flow [2025-03-04 06:47:43,662 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-04 06:47:43,662 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:43,663 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-04 06:47:43,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:43,663 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-04 06:47:43,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:43,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1531654921, now seen corresponding path program 1 times [2025-03-04 06:47:43,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:43,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826299889] [2025-03-04 06:47:43,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:43,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:43,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 06:47:43,733 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 06:47:43,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:43,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:43,949 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-04 06:47:43,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826299889] [2025-03-04 06:47:43,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826299889] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:43,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632737871] [2025-03-04 06:47:43,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:43,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:43,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:43,952 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-04 06:47:43,954 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-04 06:47:44,129 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-04 06:47:44,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-04 06:47:44,259 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:44,259 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:44,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 1567 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:44,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:44,580 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-04 06:47:44,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:44,904 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-04 06:47:44,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632737871] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:44,904 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:44,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 9] total 19 [2025-03-04 06:47:44,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165692847] [2025-03-04 06:47:44,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:44,905 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-04 06:47:44,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:44,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-04 06:47:44,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2025-03-04 06:47:44,981 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 422 out of 447 [2025-03-04 06:47:44,985 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-04 06:47:44,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:44,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 422 of 447 [2025-03-04 06:47:44,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:45,974 INFO L124 PetriNetUnfolderBase]: 30/2465 cut-off events. [2025-03-04 06:47:45,975 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2025-03-04 06:47:45,976 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-04 06:47:45,978 INFO L140 encePairwiseOnDemand]: 436/447 looper letters, 47 selfloop transitions, 68 changer transitions 0/521 dead transitions. [2025-03-04 06:47:45,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 507 places, 521 transitions, 1582 flow [2025-03-04 06:47:45,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2025-03-04 06:47:45,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2025-03-04 06:47:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 26714 transitions. [2025-03-04 06:47:46,000 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9486168815027876 [2025-03-04 06:47:46,000 INFO L175 Difference]: Start difference. First operand has 445 places, 435 transitions, 942 flow. Second operand 63 states and 26714 transitions. [2025-03-04 06:47:46,000 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 507 places, 521 transitions, 1582 flow [2025-03-04 06:47:46,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 502 places, 521 transitions, 1562 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:46,008 INFO L231 Difference]: Finished difference. Result has 518 places, 497 transitions, 1442 flow [2025-03-04 06:47:46,008 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-04 06:47:46,009 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 76 predicate places. [2025-03-04 06:47:46,009 INFO L471 AbstractCegarLoop]: Abstraction has has 518 places, 497 transitions, 1442 flow [2025-03-04 06:47:46,014 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-04 06:47:46,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:46,015 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-04 06:47:46,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:47:46,215 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-04 06:47:46,216 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-04 06:47:46,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:46,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1056443811, now seen corresponding path program 2 times [2025-03-04 06:47:46,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:46,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253011735] [2025-03-04 06:47:46,218 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:46,383 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1465 statements into 2 equivalence classes. [2025-03-04 06:47:46,389 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 147 of 1465 statements. [2025-03-04 06:47:46,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:46,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:46,606 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-04 06:47:46,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:46,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253011735] [2025-03-04 06:47:46,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253011735] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:46,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:46,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:46,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704514671] [2025-03-04 06:47:46,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:46,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:46,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:46,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:46,988 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 447 [2025-03-04 06:47:46,990 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-04 06:47:46,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:46,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 447 [2025-03-04 06:47:46,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:47,809 INFO L124 PetriNetUnfolderBase]: 188/3246 cut-off events. [2025-03-04 06:47:47,809 INFO L125 PetriNetUnfolderBase]: For 432/432 co-relation queries the response was YES. [2025-03-04 06:47:47,813 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-04 06:47:47,816 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 58 selfloop transitions, 5 changer transitions 0/496 dead transitions. [2025-03-04 06:47:47,816 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 522 places, 496 transitions, 1566 flow [2025-03-04 06:47:47,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:47,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:47,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-03-04 06:47:47,817 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8717375093214019 [2025-03-04 06:47:47,817 INFO L175 Difference]: Start difference. First operand has 518 places, 497 transitions, 1442 flow. Second operand 6 states and 2338 transitions. [2025-03-04 06:47:47,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 522 places, 496 transitions, 1566 flow [2025-03-04 06:47:47,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 515 places, 496 transitions, 1490 flow, removed 19 selfloop flow, removed 7 redundant places. [2025-03-04 06:47:47,825 INFO L231 Difference]: Finished difference. Result has 515 places, 496 transitions, 1374 flow [2025-03-04 06:47:47,826 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-04 06:47:47,826 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 73 predicate places. [2025-03-04 06:47:47,826 INFO L471 AbstractCegarLoop]: Abstraction has has 515 places, 496 transitions, 1374 flow [2025-03-04 06:47:47,827 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-04 06:47:47,827 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:47,827 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-04 06:47:47,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:47:47,827 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-04 06:47:47,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:47,830 INFO L85 PathProgramCache]: Analyzing trace with hash 277532280, now seen corresponding path program 1 times [2025-03-04 06:47:47,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:47,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145745493] [2025-03-04 06:47:47,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:47,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:47,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-04 06:47:48,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-04 06:47:48,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:48,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:50,393 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-04 06:47:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145745493] [2025-03-04 06:47:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145745493] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:50,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [861793241] [2025-03-04 06:47:50,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:50,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:50,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:50,398 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-04 06:47:50,399 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-04 06:47:50,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1472 statements into 1 equivalence classes. [2025-03-04 06:47:51,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1472 of 1472 statements. [2025-03-04 06:47:51,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:51,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:51,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 5753 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:51,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:51,884 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-04 06:47:51,884 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:52,513 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-04 06:47:52,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [861793241] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:52,513 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:52,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 34 [2025-03-04 06:47:52,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326090346] [2025-03-04 06:47:52,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:52,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-03-04 06:47:52,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:52,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-03-04 06:47:52,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=816, Unknown=0, NotChecked=0, Total=1122 [2025-03-04 06:47:52,553 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-04 06:47:52,560 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-04 06:47:52,560 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:52,560 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-04 06:47:52,560 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:54,329 INFO L124 PetriNetUnfolderBase]: 30/4624 cut-off events. [2025-03-04 06:47:54,329 INFO L125 PetriNetUnfolderBase]: For 3207/3207 co-relation queries the response was YES. [2025-03-04 06:47:54,333 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-04 06:47:54,336 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 47 selfloop transitions, 135 changer transitions 0/597 dead transitions. [2025-03-04 06:47:54,336 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 559 places, 597 transitions, 2502 flow [2025-03-04 06:47:54,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-04 06:47:54,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2025-03-04 06:47:54,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 19340 transitions. [2025-03-04 06:47:54,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9614715386527467 [2025-03-04 06:47:54,344 INFO L175 Difference]: Start difference. First operand has 515 places, 496 transitions, 1374 flow. Second operand 45 states and 19340 transitions. [2025-03-04 06:47:54,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 559 places, 597 transitions, 2502 flow [2025-03-04 06:47:54,350 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 554 places, 597 transitions, 2492 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:54,354 INFO L231 Difference]: Finished difference. Result has 563 places, 571 transitions, 2238 flow [2025-03-04 06:47:54,355 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-04 06:47:54,355 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 121 predicate places. [2025-03-04 06:47:54,356 INFO L471 AbstractCegarLoop]: Abstraction has has 563 places, 571 transitions, 2238 flow [2025-03-04 06:47:54,358 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-04 06:47:54,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:54,359 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-04 06:47:54,375 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-04 06:47:54,559 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-04 06:47:54,560 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-04 06:47:54,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:54,564 INFO L85 PathProgramCache]: Analyzing trace with hash -255393672, now seen corresponding path program 2 times [2025-03-04 06:47:54,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:54,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681684929] [2025-03-04 06:47:54,564 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:54,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:54,861 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 2912 statements into 2 equivalence classes. [2025-03-04 06:47:54,981 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 154 of 2912 statements. [2025-03-04 06:47:54,981 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:55,312 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-04 06:47:55,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:55,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681684929] [2025-03-04 06:47:55,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681684929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:55,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:55,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:55,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834717902] [2025-03-04 06:47:55,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:55,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:55,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:55,321 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:55,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:55,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 341 out of 447 [2025-03-04 06:47:55,624 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-04 06:47:55,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:55,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 341 of 447 [2025-03-04 06:47:55,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:00,231 INFO L124 PetriNetUnfolderBase]: 1238/7754 cut-off events. [2025-03-04 06:48:00,231 INFO L125 PetriNetUnfolderBase]: For 1218/1218 co-relation queries the response was YES. [2025-03-04 06:48:00,242 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-04 06:48:00,253 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 96 selfloop transitions, 5 changer transitions 0/570 dead transitions. [2025-03-04 06:48:00,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 567 places, 570 transitions, 2438 flow [2025-03-04 06:48:00,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:48:00,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:48:00,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2148 transitions. [2025-03-04 06:48:00,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008948545861297 [2025-03-04 06:48:00,256 INFO L175 Difference]: Start difference. First operand has 563 places, 571 transitions, 2238 flow. Second operand 6 states and 2148 transitions. [2025-03-04 06:48:00,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 567 places, 570 transitions, 2438 flow [2025-03-04 06:48:00,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 549 places, 570 transitions, 2330 flow, removed 0 selfloop flow, removed 18 redundant places. [2025-03-04 06:48:00,271 INFO L231 Difference]: Finished difference. Result has 549 places, 570 transitions, 2138 flow [2025-03-04 06:48:00,272 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-04 06:48:00,272 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 107 predicate places. [2025-03-04 06:48:00,273 INFO L471 AbstractCegarLoop]: Abstraction has has 549 places, 570 transitions, 2138 flow [2025-03-04 06:48:00,273 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-04 06:48:00,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:00,274 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-04 06:48:00,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:48:00,274 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-04 06:48:00,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:00,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1030857171, now seen corresponding path program 1 times [2025-03-04 06:48:00,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:00,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508220962] [2025-03-04 06:48:00,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:00,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:00,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-04 06:48:00,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-04 06:48:00,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:00,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:11,690 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-04 06:48:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508220962] [2025-03-04 06:48:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508220962] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:48:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1471083951] [2025-03-04 06:48:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:11,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:48:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:48:11,692 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-04 06:48:11,694 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-04 06:48:12,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2941 statements into 1 equivalence classes. [2025-03-04 06:48:13,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2941 of 2941 statements. [2025-03-04 06:48:13,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:13,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:13,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 11716 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-04 06:48:13,851 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:48:14,911 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-04 06:48:14,911 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:48:16,587 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-04 06:48:16,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1471083951] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:48:16,588 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:48:16,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 33] total 63 [2025-03-04 06:48:16,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515060211] [2025-03-04 06:48:16,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:48:16,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2025-03-04 06:48:16,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:16,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2025-03-04 06:48:16,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2025-03-04 06:48:16,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 447 [2025-03-04 06:48:16,710 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-04 06:48:16,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:16,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 447 [2025-03-04 06:48:16,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:22,564 INFO L124 PetriNetUnfolderBase]: 30/8673 cut-off events. [2025-03-04 06:48:22,564 INFO L125 PetriNetUnfolderBase]: For 13371/13371 co-relation queries the response was YES. [2025-03-04 06:48:22,572 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-04 06:48:22,580 INFO L140 encePairwiseOnDemand]: 441/447 looper letters, 92 selfloop transitions, 270 changer transitions 0/776 dead transitions. [2025-03-04 06:48:22,580 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 638 places, 776 transitions, 5048 flow [2025-03-04 06:48:22,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2025-03-04 06:48:22,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2025-03-04 06:48:22,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 38667 transitions. [2025-03-04 06:48:22,600 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9611483967188665 [2025-03-04 06:48:22,601 INFO L175 Difference]: Start difference. First operand has 549 places, 570 transitions, 2138 flow. Second operand 90 states and 38667 transitions. [2025-03-04 06:48:22,601 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 638 places, 776 transitions, 5048 flow [2025-03-04 06:48:22,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 633 places, 776 transitions, 5038 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:48:22,729 INFO L231 Difference]: Finished difference. Result has 649 places, 708 transitions, 4120 flow [2025-03-04 06:48:22,730 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-04 06:48:22,730 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 207 predicate places. [2025-03-04 06:48:22,730 INFO L471 AbstractCegarLoop]: Abstraction has has 649 places, 708 transitions, 4120 flow [2025-03-04 06:48:22,736 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-04 06:48:22,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:22,738 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-04 06:48:22,767 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-04 06:48:22,938 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-04 06:48:22,939 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-04 06:48:22,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1092205587, now seen corresponding path program 2 times [2025-03-04 06:48:22,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:22,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749364220] [2025-03-04 06:48:22,949 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:48:22,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:23,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 5641 statements into 2 equivalence classes. [2025-03-04 06:48:23,582 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 182 of 5641 statements. [2025-03-04 06:48:23,583 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:48:23,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:48:23,979 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-04 06:48:23,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:48:23,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749364220] [2025-03-04 06:48:23,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749364220] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:48:23,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:48:23,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:48:23,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517341776] [2025-03-04 06:48:23,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:48:23,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:48:23,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:48:23,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:48:23,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:48:24,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 380 out of 447 [2025-03-04 06:48:24,722 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-04 06:48:24,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:48:24,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 380 of 447 [2025-03-04 06:48:24,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:48:31,508 INFO L124 PetriNetUnfolderBase]: 200/9574 cut-off events. [2025-03-04 06:48:31,509 INFO L125 PetriNetUnfolderBase]: For 3537/3537 co-relation queries the response was YES. [2025-03-04 06:48:31,519 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-04 06:48:31,525 INFO L140 encePairwiseOnDemand]: 435/447 looper letters, 75 selfloop transitions, 23 changer transitions 0/743 dead transitions. [2025-03-04 06:48:31,525 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 654 places, 743 transitions, 4394 flow [2025-03-04 06:48:31,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:48:31,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:48:31,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2379 transitions. [2025-03-04 06:48:31,527 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8870246085011185 [2025-03-04 06:48:31,527 INFO L175 Difference]: Start difference. First operand has 649 places, 708 transitions, 4120 flow. Second operand 6 states and 2379 transitions. [2025-03-04 06:48:31,527 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 654 places, 743 transitions, 4394 flow [2025-03-04 06:48:31,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 612 places, 743 transitions, 4040 flow, removed 51 selfloop flow, removed 42 redundant places. [2025-03-04 06:48:31,558 INFO L231 Difference]: Finished difference. Result has 617 places, 730 transitions, 3924 flow [2025-03-04 06:48:31,558 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-04 06:48:31,559 INFO L279 CegarLoopForPetriNet]: 442 programPoint places, 175 predicate places. [2025-03-04 06:48:31,559 INFO L471 AbstractCegarLoop]: Abstraction has has 617 places, 730 transitions, 3924 flow [2025-03-04 06:48:31,559 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-04 06:48:31,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:48:31,561 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-04 06:48:31,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 06:48:31,561 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-04 06:48:31,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:48:31,572 INFO L85 PathProgramCache]: Analyzing trace with hash 975219702, now seen corresponding path program 1 times [2025-03-04 06:48:31,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:48:31,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956480657] [2025-03-04 06:48:31,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:48:31,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:48:32,086 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5647 statements into 1 equivalence classes. [2025-03-04 06:48:32,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5647 of 5647 statements. [2025-03-04 06:48:32,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:48:32,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat