./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:29:54,858 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:29:54,892 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:29:54,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:29:54,901 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:29:54,918 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:29:54,918 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:29:54,918 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:29:54,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:29:54,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:29:54,919 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:29:54,919 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:29:54,919 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:29:54,920 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:54,920 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:54,920 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:29:54,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:29:54,921 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-jdk21/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 -> 8a0558934008acf79b7e5b205fa256c568a1b783af274566f36b253458639325 [2025-01-09 21:29:55,131 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:29:55,141 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:29:55,142 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:29:55,143 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:29:55,143 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:29:55,144 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-01-09 21:29:56,261 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72f8f03be/8830324b444c4b188e34df0362b8b654/FLAGe32d9b17d [2025-01-09 21:29:56,549 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:29:56,550 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-array-int-symm.wvr.c [2025-01-09 21:29:56,557 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72f8f03be/8830324b444c4b188e34df0362b8b654/FLAGe32d9b17d [2025-01-09 21:29:56,822 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/72f8f03be/8830324b444c4b188e34df0362b8b654 [2025-01-09 21:29:56,823 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:29:56,824 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:29:56,825 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:56,825 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:29:56,828 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:29:56,829 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:56" (1/1) ... [2025-01-09 21:29:56,829 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@cf098e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:56, skipping insertion in model container [2025-01-09 21:29:56,830 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:29:56" (1/1) ... [2025-01-09 21:29:56,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:29:56,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:57,008 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:29:57,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:29:57,053 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:29:57,054 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57 WrapperNode [2025-01-09 21:29:57,055 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:29:57,055 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:57,056 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:29:57,056 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:29:57,060 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,072 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,093 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 14, calls inlined = 18, statements flattened = 343 [2025-01-09 21:29:57,093 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:29:57,094 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:29:57,094 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:29:57,094 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:29:57,099 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,099 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,102 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,113 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,116 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,117 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,118 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,123 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:29:57,124 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:29:57,124 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:29:57,125 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:29:57,125 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (1/1) ... [2025-01-09 21:29:57,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:29:57,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:29:57,155 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:29:57,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:29:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:29:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-01-09 21:29:57,173 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-01-09 21:29:57,173 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-01-09 21:29:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-01-09 21:29:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:29:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:29:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:29:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:29:57,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:29:57,174 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:29:57,176 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:29:57,262 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:29:57,264 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:29:57,673 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:29:57,673 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:29:57,696 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:29:57,697 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 21:29:57,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57 BoogieIcfgContainer [2025-01-09 21:29:57,697 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:29:57,698 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:29:57,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:29:57,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:29:57,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:29:56" (1/3) ... [2025-01-09 21:29:57,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115aa73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:57, skipping insertion in model container [2025-01-09 21:29:57,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:29:57" (2/3) ... [2025-01-09 21:29:57,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@115aa73e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:29:57, skipping insertion in model container [2025-01-09 21:29:57,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57" (3/3) ... [2025-01-09 21:29:57,705 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-array-int-symm.wvr.c [2025-01-09 21:29:57,716 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:29:57,717 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-array-int-symm.wvr.c that has 3 procedures, 434 locations, 1 initial locations, 4 loop locations, and 42 error locations. [2025-01-09 21:29:57,717 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:29:57,814 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:29:57,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 440 places, 457 transitions, 928 flow [2025-01-09 21:29:57,951 INFO L124 PetriNetUnfolderBase]: 24/455 cut-off events. [2025-01-09 21:29:57,953 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-01-09 21:29:57,959 INFO L83 FinitePrefix]: Finished finitePrefix Result has 464 conditions, 455 events. 24/455 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 889 event pairs, 0 based on Foata normal form. 0/389 useless extension candidates. Maximal degree in co-relation 272. Up to 3 conditions per place. [2025-01-09 21:29:57,960 INFO L82 GeneralOperation]: Start removeDead. Operand has 440 places, 457 transitions, 928 flow [2025-01-09 21:29:57,966 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 420 places, 435 transitions, 882 flow [2025-01-09 21:29:57,971 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:29:57,978 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;@42f67c1d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:29:57,979 INFO L334 AbstractCegarLoop]: Starting to check reachability of 72 error locations. [2025-01-09 21:29:57,983 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:29:57,983 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2025-01-09 21:29:57,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:29:57,983 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:57,984 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] [2025-01-09 21:29:57,984 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:29:57,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:57,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1838763036, now seen corresponding path program 1 times [2025-01-09 21:29:57,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:57,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051517470] [2025-01-09 21:29:57,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:57,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-01-09 21:29:58,047 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-01-09 21:29:58,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051517470] [2025-01-09 21:29:58,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051517470] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,094 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054311947] [2025-01-09 21:29:58,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,149 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 457 [2025-01-09 21:29:58,153 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 435 transitions, 882 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-01-09 21:29:58,153 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,153 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 457 [2025-01-09 21:29:58,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,264 INFO L124 PetriNetUnfolderBase]: 27/762 cut-off events. [2025-01-09 21:29:58,264 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-01-09 21:29:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 808 conditions, 762 events. 27/762 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2900 event pairs, 8 based on Foata normal form. 16/658 useless extension candidates. Maximal degree in co-relation 591. Up to 29 conditions per place. [2025-01-09 21:29:58,291 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 12 selfloop transitions, 2 changer transitions 6/422 dead transitions. [2025-01-09 21:29:58,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 421 places, 422 transitions, 884 flow [2025-01-09 21:29:58,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-01-09 21:29:58,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-01-09 21:29:58,305 INFO L175 Difference]: Start difference. First operand has 420 places, 435 transitions, 882 flow. Second operand 3 states and 1308 transitions. [2025-01-09 21:29:58,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 421 places, 422 transitions, 884 flow [2025-01-09 21:29:58,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 422 transitions, 876 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-01-09 21:29:58,316 INFO L231 Difference]: Finished difference. Result has 417 places, 416 transitions, 840 flow [2025-01-09 21:29:58,318 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=848, PETRI_DIFFERENCE_MINUEND_PLACES=415, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=422, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=420, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=840, PETRI_PLACES=417, PETRI_TRANSITIONS=416} [2025-01-09 21:29:58,320 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -3 predicate places. [2025-01-09 21:29:58,321 INFO L471 AbstractCegarLoop]: Abstraction has has 417 places, 416 transitions, 840 flow [2025-01-09 21:29:58,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-01-09 21:29:58,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,322 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] [2025-01-09 21:29:58,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:29:58,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:29:58,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 378945651, now seen corresponding path program 1 times [2025-01-09 21:29:58,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927121157] [2025-01-09 21:29:58,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-01-09 21:29:58,331 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-01-09 21:29:58,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927121157] [2025-01-09 21:29:58,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927121157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954689060] [2025-01-09 21:29:58,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,381 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 427 out of 457 [2025-01-09 21:29:58,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 417 places, 416 transitions, 840 flow. Second operand has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-01-09 21:29:58,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,383 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 427 of 457 [2025-01-09 21:29:58,383 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,468 INFO L124 PetriNetUnfolderBase]: 27/746 cut-off events. [2025-01-09 21:29:58,468 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-01-09 21:29:58,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 785 conditions, 746 events. 27/746 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2853 event pairs, 8 based on Foata normal form. 0/637 useless extension candidates. Maximal degree in co-relation 755. Up to 29 conditions per place. [2025-01-09 21:29:58,474 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 12 selfloop transitions, 2 changer transitions 0/415 dead transitions. [2025-01-09 21:29:58,474 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 415 transitions, 866 flow [2025-01-09 21:29:58,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1296 transitions. [2025-01-09 21:29:58,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9452954048140044 [2025-01-09 21:29:58,477 INFO L175 Difference]: Start difference. First operand has 417 places, 416 transitions, 840 flow. Second operand 3 states and 1296 transitions. [2025-01-09 21:29:58,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 415 transitions, 866 flow [2025-01-09 21:29:58,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 410 places, 415 transitions, 862 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:58,482 INFO L231 Difference]: Finished difference. Result has 410 places, 415 transitions, 838 flow [2025-01-09 21:29:58,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=408, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=415, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=838, PETRI_PLACES=410, PETRI_TRANSITIONS=415} [2025-01-09 21:29:58,484 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -10 predicate places. [2025-01-09 21:29:58,484 INFO L471 AbstractCegarLoop]: Abstraction has has 410 places, 415 transitions, 838 flow [2025-01-09 21:29:58,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 428.3333333333333) internal successors, (1285), 3 states have internal predecessors, (1285), 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-01-09 21:29:58,485 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,485 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] [2025-01-09 21:29:58,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:29:58,485 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:29:58,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,486 INFO L85 PathProgramCache]: Analyzing trace with hash 1765132953, now seen corresponding path program 1 times [2025-01-09 21:29:58,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229205945] [2025-01-09 21:29:58,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-09 21:29:58,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-09 21:29:58,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229205945] [2025-01-09 21:29:58,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229205945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63953744] [2025-01-09 21:29:58,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,544 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 457 [2025-01-09 21:29:58,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 410 places, 415 transitions, 838 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-01-09 21:29:58,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 457 [2025-01-09 21:29:58,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,735 INFO L124 PetriNetUnfolderBase]: 62/1354 cut-off events. [2025-01-09 21:29:58,735 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:29:58,739 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1433 conditions, 1354 events. 62/1354 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7776 event pairs, 24 based on Foata normal form. 0/1156 useless extension candidates. Maximal degree in co-relation 1395. Up to 67 conditions per place. [2025-01-09 21:29:58,742 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 1 changer transitions 0/410 dead transitions. [2025-01-09 21:29:58,742 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 407 places, 410 transitions, 858 flow [2025-01-09 21:29:58,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2025-01-09 21:29:58,745 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9401896425966448 [2025-01-09 21:29:58,745 INFO L175 Difference]: Start difference. First operand has 410 places, 415 transitions, 838 flow. Second operand 3 states and 1289 transitions. [2025-01-09 21:29:58,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 407 places, 410 transitions, 858 flow [2025-01-09 21:29:58,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 410 transitions, 854 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:29:58,750 INFO L231 Difference]: Finished difference. Result has 405 places, 410 transitions, 826 flow [2025-01-09 21:29:58,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=410, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=409, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=826, PETRI_PLACES=405, PETRI_TRANSITIONS=410} [2025-01-09 21:29:58,751 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2025-01-09 21:29:58,751 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 410 transitions, 826 flow [2025-01-09 21:29:58,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-01-09 21:29:58,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,752 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] [2025-01-09 21:29:58,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:29:58,752 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:29:58,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,753 INFO L85 PathProgramCache]: Analyzing trace with hash -2087221380, now seen corresponding path program 1 times [2025-01-09 21:29:58,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-01-09 21:29:58,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:58,775 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:58,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:58,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:58,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41178267] [2025-01-09 21:29:58,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41178267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:58,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:58,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:29:58,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936060553] [2025-01-09 21:29:58,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:58,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:29:58,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:58,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:29:58,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:29:58,837 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-01-09 21:29:58,838 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 410 transitions, 826 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-01-09 21:29:58,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:58,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-01-09 21:29:58,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:29:58,912 INFO L124 PetriNetUnfolderBase]: 24/645 cut-off events. [2025-01-09 21:29:58,912 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:29:58,914 INFO L83 FinitePrefix]: Finished finitePrefix Result has 682 conditions, 645 events. 24/645 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2146 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 644. Up to 28 conditions per place. [2025-01-09 21:29:58,915 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/409 dead transitions. [2025-01-09 21:29:58,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 409 transitions, 850 flow [2025-01-09 21:29:58,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:29:58,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:29:58,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-01-09 21:29:58,918 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-01-09 21:29:58,918 INFO L175 Difference]: Start difference. First operand has 405 places, 410 transitions, 826 flow. Second operand 3 states and 1298 transitions. [2025-01-09 21:29:58,918 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 409 transitions, 850 flow [2025-01-09 21:29:58,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 409 transitions, 849 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:29:58,923 INFO L231 Difference]: Finished difference. Result has 405 places, 409 transitions, 827 flow [2025-01-09 21:29:58,923 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=823, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=409, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=407, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=827, PETRI_PLACES=405, PETRI_TRANSITIONS=409} [2025-01-09 21:29:58,924 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -15 predicate places. [2025-01-09 21:29:58,924 INFO L471 AbstractCegarLoop]: Abstraction has has 405 places, 409 transitions, 827 flow [2025-01-09 21:29:58,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-01-09 21:29:58,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:29:58,925 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] [2025-01-09 21:29:58,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:29:58,925 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:29:58,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:29:58,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1846509249, now seen corresponding path program 1 times [2025-01-09 21:29:58,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:29:58,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680228353] [2025-01-09 21:29:58,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:29:58,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:29:58,934 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-01-09 21:29:58,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-01-09 21:29:58,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:29:58,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:29:59,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:29:59,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:29:59,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680228353] [2025-01-09 21:29:59,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680228353] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:29:59,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:29:59,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:29:59,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436162364] [2025-01-09 21:29:59,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:29:59,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:29:59,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:29:59,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:29:59,472 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:29:59,816 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 379 out of 457 [2025-01-09 21:29:59,818 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 405 places, 409 transitions, 827 flow. Second operand has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-01-09 21:29:59,819 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:29:59,819 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 379 of 457 [2025-01-09 21:29:59,819 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,100 INFO L124 PetriNetUnfolderBase]: 393/2923 cut-off events. [2025-01-09 21:30:00,100 INFO L125 PetriNetUnfolderBase]: For 46/47 co-relation queries the response was YES. [2025-01-09 21:30:00,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3647 conditions, 2923 events. 393/2923 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22537 event pairs, 288 based on Foata normal form. 0/2523 useless extension candidates. Maximal degree in co-relation 3610. Up to 691 conditions per place. [2025-01-09 21:30:00,114 INFO L140 encePairwiseOnDemand]: 445/457 looper letters, 52 selfloop transitions, 10 changer transitions 0/407 dead transitions. [2025-01-09 21:30:00,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 407 transitions, 947 flow [2025-01-09 21:30:00,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:00,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:00,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2338 transitions. [2025-01-09 21:30:00,118 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8526622902990518 [2025-01-09 21:30:00,119 INFO L175 Difference]: Start difference. First operand has 405 places, 409 transitions, 827 flow. Second operand 6 states and 2338 transitions. [2025-01-09 21:30:00,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 407 transitions, 947 flow [2025-01-09 21:30:00,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 407 transitions, 943 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,123 INFO L231 Difference]: Finished difference. Result has 406 places, 407 transitions, 839 flow [2025-01-09 21:30:00,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=819, PETRI_DIFFERENCE_MINUEND_PLACES=401, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=406, PETRI_TRANSITIONS=407} [2025-01-09 21:30:00,124 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -14 predicate places. [2025-01-09 21:30:00,124 INFO L471 AbstractCegarLoop]: Abstraction has has 406 places, 407 transitions, 839 flow [2025-01-09 21:30:00,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 380.5) internal successors, (2283), 6 states have internal predecessors, (2283), 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-01-09 21:30:00,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,126 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] [2025-01-09 21:30:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:30:00,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1458203118, now seen corresponding path program 1 times [2025-01-09 21:30:00,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363526871] [2025-01-09 21:30:00,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-01-09 21:30:00,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-01-09 21:30:00,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363526871] [2025-01-09 21:30:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1363526871] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398941588] [2025-01-09 21:30:00,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,195 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 423 out of 457 [2025-01-09 21:30:00,197 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 406 places, 407 transitions, 839 flow. Second operand has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-01-09 21:30:00,197 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,197 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 423 of 457 [2025-01-09 21:30:00,197 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,303 INFO L124 PetriNetUnfolderBase]: 65/1347 cut-off events. [2025-01-09 21:30:00,304 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-01-09 21:30:00,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1437 conditions, 1347 events. 65/1347 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7661 event pairs, 24 based on Foata normal form. 0/1169 useless extension candidates. Maximal degree in co-relation 1404. Up to 69 conditions per place. [2025-01-09 21:30:00,312 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 1 changer transitions 0/402 dead transitions. [2025-01-09 21:30:00,312 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 403 places, 402 transitions, 859 flow [2025-01-09 21:30:00,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1289 transitions. [2025-01-09 21:30:00,314 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9401896425966448 [2025-01-09 21:30:00,314 INFO L175 Difference]: Start difference. First operand has 406 places, 407 transitions, 839 flow. Second operand 3 states and 1289 transitions. [2025-01-09 21:30:00,314 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 403 places, 402 transitions, 859 flow [2025-01-09 21:30:00,316 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 402 transitions, 839 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:00,319 INFO L231 Difference]: Finished difference. Result has 398 places, 402 transitions, 811 flow [2025-01-09 21:30:00,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=809, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=402, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=401, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=811, PETRI_PLACES=398, PETRI_TRANSITIONS=402} [2025-01-09 21:30:00,320 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-01-09 21:30:00,320 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 402 transitions, 811 flow [2025-01-09 21:30:00,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 424.0) internal successors, (1272), 3 states have internal predecessors, (1272), 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-01-09 21:30:00,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,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] [2025-01-09 21:30:00,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:30:00,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,322 INFO L85 PathProgramCache]: Analyzing trace with hash -620626633, now seen corresponding path program 1 times [2025-01-09 21:30:00,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164402180] [2025-01-09 21:30:00,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:30:00,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:30:00,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164402180] [2025-01-09 21:30:00,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164402180] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672045732] [2025-01-09 21:30:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,406 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-01-09 21:30:00,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 402 transitions, 811 flow. Second operand has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-01-09 21:30:00,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-01-09 21:30:00,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,453 INFO L124 PetriNetUnfolderBase]: 24/633 cut-off events. [2025-01-09 21:30:00,454 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-01-09 21:30:00,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 671 conditions, 633 events. 24/633 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2031 event pairs, 8 based on Foata normal form. 0/561 useless extension candidates. Maximal degree in co-relation 633. Up to 28 conditions per place. [2025-01-09 21:30:00,467 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-01-09 21:30:00,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 835 flow [2025-01-09 21:30:00,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-01-09 21:30:00,470 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-01-09 21:30:00,470 INFO L175 Difference]: Start difference. First operand has 398 places, 402 transitions, 811 flow. Second operand 3 states and 1298 transitions. [2025-01-09 21:30:00,470 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 835 flow [2025-01-09 21:30:00,471 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 398 places, 401 transitions, 834 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:00,474 INFO L231 Difference]: Finished difference. Result has 398 places, 401 transitions, 812 flow [2025-01-09 21:30:00,475 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=401, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=812, PETRI_PLACES=398, PETRI_TRANSITIONS=401} [2025-01-09 21:30:00,476 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-01-09 21:30:00,476 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 401 transitions, 812 flow [2025-01-09 21:30:00,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 429.3333333333333) internal successors, (1288), 3 states have internal predecessors, (1288), 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-01-09 21:30:00,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,477 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:00,477 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:30:00,477 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,478 INFO L85 PathProgramCache]: Analyzing trace with hash 1740823065, now seen corresponding path program 1 times [2025-01-09 21:30:00,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-01-09 21:30:00,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:30:00,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:30:00,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149098815] [2025-01-09 21:30:00,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149098815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414773904] [2025-01-09 21:30:00,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,554 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-01-09 21:30:00,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 401 transitions, 812 flow. Second operand has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-01-09 21:30:00,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-01-09 21:30:00,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,601 INFO L124 PetriNetUnfolderBase]: 21/615 cut-off events. [2025-01-09 21:30:00,602 INFO L125 PetriNetUnfolderBase]: For 2/6 co-relation queries the response was YES. [2025-01-09 21:30:00,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 651 conditions, 615 events. 21/615 cut-off events. For 2/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1985 event pairs, 3 based on Foata normal form. 1/548 useless extension candidates. Maximal degree in co-relation 614. Up to 17 conditions per place. [2025-01-09 21:30:00,605 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-01-09 21:30:00,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 401 transitions, 839 flow [2025-01-09 21:30:00,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2025-01-09 21:30:00,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511305616338439 [2025-01-09 21:30:00,607 INFO L175 Difference]: Start difference. First operand has 398 places, 401 transitions, 812 flow. Second operand 3 states and 1304 transitions. [2025-01-09 21:30:00,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 401 transitions, 839 flow [2025-01-09 21:30:00,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 397 places, 401 transitions, 835 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,613 INFO L231 Difference]: Finished difference. Result has 397 places, 400 transitions, 810 flow [2025-01-09 21:30:00,613 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=400, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=398, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=810, PETRI_PLACES=397, PETRI_TRANSITIONS=400} [2025-01-09 21:30:00,615 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -23 predicate places. [2025-01-09 21:30:00,615 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 400 transitions, 810 flow [2025-01-09 21:30:00,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.3333333333333) internal successors, (1294), 3 states have internal predecessors, (1294), 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-01-09 21:30:00,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,616 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-01-09 21:30:00,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:30:00,616 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1457823975, now seen corresponding path program 1 times [2025-01-09 21:30:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-01-09 21:30:00,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 21:30:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 21:30:00,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139039069] [2025-01-09 21:30:00,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139039069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117224266] [2025-01-09 21:30:00,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,665 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-01-09 21:30:00,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 400 transitions, 810 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-01-09 21:30:00,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-01-09 21:30:00,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,704 INFO L124 PetriNetUnfolderBase]: 18/504 cut-off events. [2025-01-09 21:30:00,704 INFO L125 PetriNetUnfolderBase]: For 7/8 co-relation queries the response was YES. [2025-01-09 21:30:00,706 INFO L83 FinitePrefix]: Finished finitePrefix Result has 535 conditions, 504 events. 18/504 cut-off events. For 7/8 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1266 event pairs, 3 based on Foata normal form. 0/450 useless extension candidates. Maximal degree in co-relation 498. Up to 17 conditions per place. [2025-01-09 21:30:00,707 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 11 selfloop transitions, 2 changer transitions 0/400 dead transitions. [2025-01-09 21:30:00,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 400 transitions, 837 flow [2025-01-09 21:30:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1304 transitions. [2025-01-09 21:30:00,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9511305616338439 [2025-01-09 21:30:00,710 INFO L175 Difference]: Start difference. First operand has 397 places, 400 transitions, 810 flow. Second operand 3 states and 1304 transitions. [2025-01-09 21:30:00,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 400 transitions, 837 flow [2025-01-09 21:30:00,711 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 400 transitions, 833 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,714 INFO L231 Difference]: Finished difference. Result has 396 places, 399 transitions, 808 flow [2025-01-09 21:30:00,714 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=397, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=808, PETRI_PLACES=396, PETRI_TRANSITIONS=399} [2025-01-09 21:30:00,715 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -24 predicate places. [2025-01-09 21:30:00,715 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 399 transitions, 808 flow [2025-01-09 21:30:00,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-01-09 21:30:00,716 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,716 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] [2025-01-09 21:30:00,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:30:00,716 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,717 INFO L85 PathProgramCache]: Analyzing trace with hash 328983218, now seen corresponding path program 1 times [2025-01-09 21:30:00,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515606297] [2025-01-09 21:30:00,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:30:00,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:30:00,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,745 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515606297] [2025-01-09 21:30:00,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515606297] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:00,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1224456289] [2025-01-09 21:30:00,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,746 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,746 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-01-09 21:30:00,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 399 transitions, 808 flow. Second operand has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-01-09 21:30:00,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-01-09 21:30:00,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,810 INFO L124 PetriNetUnfolderBase]: 24/615 cut-off events. [2025-01-09 21:30:00,810 INFO L125 PetriNetUnfolderBase]: For 2/10 co-relation queries the response was YES. [2025-01-09 21:30:00,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 665 conditions, 615 events. 24/615 cut-off events. For 2/10 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1938 event pairs, 6 based on Foata normal form. 1/550 useless extension candidates. Maximal degree in co-relation 628. Up to 24 conditions per place. [2025-01-09 21:30:00,813 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 3 changer transitions 0/401 dead transitions. [2025-01-09 21:30:00,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 398 places, 401 transitions, 841 flow [2025-01-09 21:30:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-01-09 21:30:00,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-01-09 21:30:00,816 INFO L175 Difference]: Start difference. First operand has 396 places, 399 transitions, 808 flow. Second operand 3 states and 1308 transitions. [2025-01-09 21:30:00,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 398 places, 401 transitions, 841 flow [2025-01-09 21:30:00,818 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 401 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,822 INFO L231 Difference]: Finished difference. Result has 398 places, 400 transitions, 822 flow [2025-01-09 21:30:00,823 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=804, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=398, PETRI_TRANSITIONS=400} [2025-01-09 21:30:00,824 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -22 predicate places. [2025-01-09 21:30:00,824 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 400 transitions, 822 flow [2025-01-09 21:30:00,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.6666666666667) internal successors, (1298), 3 states have internal predecessors, (1298), 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-01-09 21:30:00,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,825 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] [2025-01-09 21:30:00,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:30:00,825 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1259574056, now seen corresponding path program 1 times [2025-01-09 21:30:00,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 21:30:00,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:00,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 21:30:00,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 21:30:00,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:00,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:00,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:00,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:00,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467826043] [2025-01-09 21:30:00,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467826043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:00,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:00,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:00,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414498903] [2025-01-09 21:30:00,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:00,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:00,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:00,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:00,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:00,876 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 457 [2025-01-09 21:30:00,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 400 transitions, 822 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:30:00,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:00,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 457 [2025-01-09 21:30:00,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:00,972 INFO L124 PetriNetUnfolderBase]: 69/1225 cut-off events. [2025-01-09 21:30:00,973 INFO L125 PetriNetUnfolderBase]: For 22/23 co-relation queries the response was YES. [2025-01-09 21:30:00,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1353 conditions, 1225 events. 69/1225 cut-off events. For 22/23 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 6572 event pairs, 12 based on Foata normal form. 0/1091 useless extension candidates. Maximal degree in co-relation 1315. Up to 79 conditions per place. [2025-01-09 21:30:00,983 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 16 selfloop transitions, 2 changer transitions 0/401 dead transitions. [2025-01-09 21:30:00,984 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 401 transitions, 863 flow [2025-01-09 21:30:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:00,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:00,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-01-09 21:30:00,986 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-01-09 21:30:00,986 INFO L175 Difference]: Start difference. First operand has 398 places, 400 transitions, 822 flow. Second operand 3 states and 1300 transitions. [2025-01-09 21:30:00,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 401 transitions, 863 flow [2025-01-09 21:30:00,988 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 401 transitions, 857 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:00,992 INFO L231 Difference]: Finished difference. Result has 395 places, 398 transitions, 822 flow [2025-01-09 21:30:00,992 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=808, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=396, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=822, PETRI_PLACES=395, PETRI_TRANSITIONS=398} [2025-01-09 21:30:00,994 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -25 predicate places. [2025-01-09 21:30:00,994 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 398 transitions, 822 flow [2025-01-09 21:30:00,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:30:00,995 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:00,995 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] [2025-01-09 21:30:00,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:30:00,995 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:00,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:00,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1408744716, now seen corresponding path program 1 times [2025-01-09 21:30:00,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:00,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-01-09 21:30:00,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:00,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:01,004 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 21:30:01,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 21:30:01,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:01,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:01,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:01,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890939036] [2025-01-09 21:30:01,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890939036] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:01,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:01,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:01,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [99604356] [2025-01-09 21:30:01,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:01,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:01,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:01,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-01-09 21:30:01,476 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 398 transitions, 822 flow. Second operand has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-01-09 21:30:01,477 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:01,477 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-01-09 21:30:01,477 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:01,658 INFO L124 PetriNetUnfolderBase]: 65/1275 cut-off events. [2025-01-09 21:30:01,659 INFO L125 PetriNetUnfolderBase]: For 7/19 co-relation queries the response was YES. [2025-01-09 21:30:01,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1493 conditions, 1275 events. 65/1275 cut-off events. For 7/19 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6568 event pairs, 15 based on Foata normal form. 3/1156 useless extension candidates. Maximal degree in co-relation 1453. Up to 70 conditions per place. [2025-01-09 21:30:01,666 INFO L140 encePairwiseOnDemand]: 441/457 looper letters, 43 selfloop transitions, 18 changer transitions 0/424 dead transitions. [2025-01-09 21:30:01,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 424 transitions, 1009 flow [2025-01-09 21:30:01,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:30:01,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:30:01,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 4970 transitions. [2025-01-09 21:30:01,673 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9062727935813275 [2025-01-09 21:30:01,673 INFO L175 Difference]: Start difference. First operand has 395 places, 398 transitions, 822 flow. Second operand 12 states and 4970 transitions. [2025-01-09 21:30:01,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 424 transitions, 1009 flow [2025-01-09 21:30:01,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 406 places, 424 transitions, 1009 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:01,678 INFO L231 Difference]: Finished difference. Result has 412 places, 407 transitions, 915 flow [2025-01-09 21:30:01,678 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=822, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=915, PETRI_PLACES=412, PETRI_TRANSITIONS=407} [2025-01-09 21:30:01,679 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -8 predicate places. [2025-01-09 21:30:01,679 INFO L471 AbstractCegarLoop]: Abstraction has has 412 places, 407 transitions, 915 flow [2025-01-09 21:30:01,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.125) internal successors, (3297), 8 states have internal predecessors, (3297), 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-01-09 21:30:01,681 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:01,681 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] [2025-01-09 21:30:01,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:30:01,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:01,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:01,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1283407895, now seen corresponding path program 1 times [2025-01-09 21:30:01,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:01,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36388092] [2025-01-09 21:30:01,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:01,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:01,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 21:30:01,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 21:30:01,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:01,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:01,715 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:01,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:01,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36388092] [2025-01-09 21:30:01,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36388092] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:01,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:01,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:30:01,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353465962] [2025-01-09 21:30:01,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,716 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:01,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:01,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:01,723 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 431 out of 457 [2025-01-09 21:30:01,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 412 places, 407 transitions, 915 flow. Second operand has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-01-09 21:30:01,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:01,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 431 of 457 [2025-01-09 21:30:01,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:01,826 INFO L124 PetriNetUnfolderBase]: 86/1151 cut-off events. [2025-01-09 21:30:01,826 INFO L125 PetriNetUnfolderBase]: For 72/75 co-relation queries the response was YES. [2025-01-09 21:30:01,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1388 conditions, 1151 events. 86/1151 cut-off events. For 72/75 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 6152 event pairs, 24 based on Foata normal form. 0/1030 useless extension candidates. Maximal degree in co-relation 1340. Up to 98 conditions per place. [2025-01-09 21:30:01,832 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 3 changer transitions 0/409 dead transitions. [2025-01-09 21:30:01,832 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 409 transitions, 948 flow [2025-01-09 21:30:01,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:01,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:01,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1308 transitions. [2025-01-09 21:30:01,835 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9540481400437637 [2025-01-09 21:30:01,835 INFO L175 Difference]: Start difference. First operand has 412 places, 407 transitions, 915 flow. Second operand 3 states and 1308 transitions. [2025-01-09 21:30:01,835 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 409 transitions, 948 flow [2025-01-09 21:30:01,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 409 transitions, 948 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:01,840 INFO L231 Difference]: Finished difference. Result has 416 places, 408 transitions, 933 flow [2025-01-09 21:30:01,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=915, PETRI_DIFFERENCE_MINUEND_PLACES=412, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=407, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=404, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=933, PETRI_PLACES=416, PETRI_TRANSITIONS=408} [2025-01-09 21:30:01,841 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -4 predicate places. [2025-01-09 21:30:01,841 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 408 transitions, 933 flow [2025-01-09 21:30:01,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 433.0) internal successors, (1299), 3 states have internal predecessors, (1299), 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-01-09 21:30:01,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:01,842 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] [2025-01-09 21:30:01,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:30:01,842 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:01,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:01,843 INFO L85 PathProgramCache]: Analyzing trace with hash 858137452, now seen corresponding path program 1 times [2025-01-09 21:30:01,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:01,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 21:30:01,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:01,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:01,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 21:30:01,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 21:30:01,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:01,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:01,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:01,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:01,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447620612] [2025-01-09 21:30:01,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447620612] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:01,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:01,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:01,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662570937] [2025-01-09 21:30:01,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:01,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:01,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:01,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:01,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:02,317 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-01-09 21:30:02,320 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 408 transitions, 933 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-01-09 21:30:02,321 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:02,321 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-01-09 21:30:02,321 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:02,471 INFO L124 PetriNetUnfolderBase]: 68/917 cut-off events. [2025-01-09 21:30:02,471 INFO L125 PetriNetUnfolderBase]: For 84/87 co-relation queries the response was YES. [2025-01-09 21:30:02,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1201 conditions, 917 events. 68/917 cut-off events. For 84/87 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 4055 event pairs, 20 based on Foata normal form. 2/847 useless extension candidates. Maximal degree in co-relation 1149. Up to 105 conditions per place. [2025-01-09 21:30:02,475 INFO L140 encePairwiseOnDemand]: 443/457 looper letters, 45 selfloop transitions, 15 changer transitions 0/428 dead transitions. [2025-01-09 21:30:02,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 426 places, 428 transitions, 1109 flow [2025-01-09 21:30:02,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:02,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:02,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4559 transitions. [2025-01-09 21:30:02,481 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9069027252834693 [2025-01-09 21:30:02,481 INFO L175 Difference]: Start difference. First operand has 416 places, 408 transitions, 933 flow. Second operand 11 states and 4559 transitions. [2025-01-09 21:30:02,481 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 426 places, 428 transitions, 1109 flow [2025-01-09 21:30:02,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 424 places, 428 transitions, 1099 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:02,490 INFO L231 Difference]: Finished difference. Result has 427 places, 411 transitions, 982 flow [2025-01-09 21:30:02,490 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=927, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=982, PETRI_PLACES=427, PETRI_TRANSITIONS=411} [2025-01-09 21:30:02,490 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 7 predicate places. [2025-01-09 21:30:02,491 INFO L471 AbstractCegarLoop]: Abstraction has has 427 places, 411 transitions, 982 flow [2025-01-09 21:30:02,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-01-09 21:30:02,492 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:02,492 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] [2025-01-09 21:30:02,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:30:02,492 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:02,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:02,493 INFO L85 PathProgramCache]: Analyzing trace with hash 508110287, now seen corresponding path program 1 times [2025-01-09 21:30:02,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:02,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-01-09 21:30:02,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:02,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:02,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 21:30:02,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 21:30:02,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:02,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:02,617 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:02,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:02,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1453445260] [2025-01-09 21:30:02,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1453445260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:02,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:02,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:02,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321989134] [2025-01-09 21:30:02,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:02,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:02,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:02,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:02,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:03,040 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-01-09 21:30:03,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 427 places, 411 transitions, 982 flow. Second operand has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-01-09 21:30:03,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:03,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-01-09 21:30:03,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:03,235 INFO L124 PetriNetUnfolderBase]: 75/1344 cut-off events. [2025-01-09 21:30:03,236 INFO L125 PetriNetUnfolderBase]: For 109/127 co-relation queries the response was YES. [2025-01-09 21:30:03,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1820 conditions, 1344 events. 75/1344 cut-off events. For 109/127 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6878 event pairs, 23 based on Foata normal form. 4/1249 useless extension candidates. Maximal degree in co-relation 1762. Up to 114 conditions per place. [2025-01-09 21:30:03,242 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 48 selfloop transitions, 19 changer transitions 0/434 dead transitions. [2025-01-09 21:30:03,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 437 places, 434 transitions, 1209 flow [2025-01-09 21:30:03,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:03,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2025-01-09 21:30:03,249 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055102446787349 [2025-01-09 21:30:03,249 INFO L175 Difference]: Start difference. First operand has 427 places, 411 transitions, 982 flow. Second operand 11 states and 4552 transitions. [2025-01-09 21:30:03,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 437 places, 434 transitions, 1209 flow [2025-01-09 21:30:03,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 430 places, 434 transitions, 1188 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:30:03,254 INFO L231 Difference]: Finished difference. Result has 435 places, 423 transitions, 1093 flow [2025-01-09 21:30:03,255 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=961, PETRI_DIFFERENCE_MINUEND_PLACES=420, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=411, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=394, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1093, PETRI_PLACES=435, PETRI_TRANSITIONS=423} [2025-01-09 21:30:03,255 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 15 predicate places. [2025-01-09 21:30:03,255 INFO L471 AbstractCegarLoop]: Abstraction has has 435 places, 423 transitions, 1093 flow [2025-01-09 21:30:03,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.25) internal successors, (3298), 8 states have internal predecessors, (3298), 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-01-09 21:30:03,256 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:03,256 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] [2025-01-09 21:30:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 21:30:03,256 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash 271101423, now seen corresponding path program 1 times [2025-01-09 21:30:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:03,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-01-09 21:30:03,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:03,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:03,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 21:30:03,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 21:30:03,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:03,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 21:30:03,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:03,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966364724] [2025-01-09 21:30:03,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966364724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:03,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:03,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 21:30:03,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745305412] [2025-01-09 21:30:03,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:03,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 21:30:03,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:03,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 21:30:03,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-01-09 21:30:03,843 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 409 out of 457 [2025-01-09 21:30:03,846 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 435 places, 423 transitions, 1093 flow. Second operand has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-01-09 21:30:03,846 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:03,846 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 409 of 457 [2025-01-09 21:30:03,846 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:04,081 INFO L124 PetriNetUnfolderBase]: 87/1207 cut-off events. [2025-01-09 21:30:04,081 INFO L125 PetriNetUnfolderBase]: For 204/209 co-relation queries the response was YES. [2025-01-09 21:30:04,086 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1690 conditions, 1207 events. 87/1207 cut-off events. For 204/209 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 6254 event pairs, 29 based on Foata normal form. 0/1115 useless extension candidates. Maximal degree in co-relation 1625. Up to 130 conditions per place. [2025-01-09 21:30:04,092 INFO L140 encePairwiseOnDemand]: 442/457 looper letters, 47 selfloop transitions, 18 changer transitions 0/440 dead transitions. [2025-01-09 21:30:04,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 445 places, 440 transitions, 1293 flow [2025-01-09 21:30:04,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:30:04,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:30:04,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 4552 transitions. [2025-01-09 21:30:04,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055102446787349 [2025-01-09 21:30:04,099 INFO L175 Difference]: Start difference. First operand has 435 places, 423 transitions, 1093 flow. Second operand 11 states and 4552 transitions. [2025-01-09 21:30:04,099 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 445 places, 440 transitions, 1293 flow [2025-01-09 21:30:04,103 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 440 transitions, 1289 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:04,107 INFO L231 Difference]: Finished difference. Result has 447 places, 429 transitions, 1184 flow [2025-01-09 21:30:04,107 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=434, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=405, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1184, PETRI_PLACES=447, PETRI_TRANSITIONS=429} [2025-01-09 21:30:04,107 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 27 predicate places. [2025-01-09 21:30:04,107 INFO L471 AbstractCegarLoop]: Abstraction has has 447 places, 429 transitions, 1184 flow [2025-01-09 21:30:04,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 412.375) internal successors, (3299), 8 states have internal predecessors, (3299), 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-01-09 21:30:04,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:04,109 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] [2025-01-09 21:30:04,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:30:04,109 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:04,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:04,110 INFO L85 PathProgramCache]: Analyzing trace with hash 612301402, now seen corresponding path program 1 times [2025-01-09 21:30:04,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:04,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970272275] [2025-01-09 21:30:04,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:04,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:04,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:30:04,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:30:04,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:04,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:04,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:04,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:04,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970272275] [2025-01-09 21:30:04,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970272275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:04,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:04,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:04,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042235654] [2025-01-09 21:30:04,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:04,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:04,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:04,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:04,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:04,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-01-09 21:30:04,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 447 places, 429 transitions, 1184 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-01-09 21:30:04,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:04,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-01-09 21:30:04,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:04,296 INFO L124 PetriNetUnfolderBase]: 43/1283 cut-off events. [2025-01-09 21:30:04,296 INFO L125 PetriNetUnfolderBase]: For 191/202 co-relation queries the response was YES. [2025-01-09 21:30:04,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1727 conditions, 1283 events. 43/1283 cut-off events. For 191/202 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 5546 event pairs, 5 based on Foata normal form. 0/1207 useless extension candidates. Maximal degree in co-relation 1659. Up to 36 conditions per place. [2025-01-09 21:30:04,304 INFO L140 encePairwiseOnDemand]: 453/457 looper letters, 11 selfloop transitions, 1 changer transitions 0/426 dead transitions. [2025-01-09 21:30:04,304 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 446 places, 426 transitions, 1202 flow [2025-01-09 21:30:04,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:04,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:04,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1299 transitions. [2025-01-09 21:30:04,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9474835886214442 [2025-01-09 21:30:04,306 INFO L175 Difference]: Start difference. First operand has 447 places, 429 transitions, 1184 flow. Second operand 3 states and 1299 transitions. [2025-01-09 21:30:04,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 446 places, 426 transitions, 1202 flow [2025-01-09 21:30:04,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 439 places, 426 transitions, 1181 flow, removed 0 selfloop flow, removed 7 redundant places. [2025-01-09 21:30:04,313 INFO L231 Difference]: Finished difference. Result has 439 places, 426 transitions, 1159 flow [2025-01-09 21:30:04,313 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1157, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=426, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=425, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1159, PETRI_PLACES=439, PETRI_TRANSITIONS=426} [2025-01-09 21:30:04,313 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 19 predicate places. [2025-01-09 21:30:04,313 INFO L471 AbstractCegarLoop]: Abstraction has has 439 places, 426 transitions, 1159 flow [2025-01-09 21:30:04,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-01-09 21:30:04,318 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:04,318 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] [2025-01-09 21:30:04,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:30:04,318 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:04,319 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:04,319 INFO L85 PathProgramCache]: Analyzing trace with hash -848550688, now seen corresponding path program 1 times [2025-01-09 21:30:04,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:04,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123371132] [2025-01-09 21:30:04,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:04,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:04,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:30:04,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:30:04,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:04,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:04,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:30:04,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:04,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123371132] [2025-01-09 21:30:04,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123371132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:04,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:04,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:04,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879977873] [2025-01-09 21:30:04,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:04,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:04,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:04,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:04,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:04,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 428 out of 457 [2025-01-09 21:30:04,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 426 transitions, 1159 flow. Second operand has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-01-09 21:30:04,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:04,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 428 of 457 [2025-01-09 21:30:04,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:04,490 INFO L124 PetriNetUnfolderBase]: 46/1243 cut-off events. [2025-01-09 21:30:04,490 INFO L125 PetriNetUnfolderBase]: For 166/171 co-relation queries the response was YES. [2025-01-09 21:30:04,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1648 conditions, 1243 events. 46/1243 cut-off events. For 166/171 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 5770 event pairs, 6 based on Foata normal form. 5/1187 useless extension candidates. Maximal degree in co-relation 1581. Up to 38 conditions per place. [2025-01-09 21:30:04,496 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 5 selfloop transitions, 0 changer transitions 66/425 dead transitions. [2025-01-09 21:30:04,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 438 places, 425 transitions, 1183 flow [2025-01-09 21:30:04,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:04,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-01-09 21:30:04,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-01-09 21:30:04,498 INFO L175 Difference]: Start difference. First operand has 439 places, 426 transitions, 1159 flow. Second operand 3 states and 1300 transitions. [2025-01-09 21:30:04,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 438 places, 425 transitions, 1183 flow [2025-01-09 21:30:04,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 425 transitions, 1182 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:30:04,504 INFO L231 Difference]: Finished difference. Result has 437 places, 359 transitions, 856 flow [2025-01-09 21:30:04,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=1152, PETRI_DIFFERENCE_MINUEND_PLACES=435, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=423, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=423, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=856, PETRI_PLACES=437, PETRI_TRANSITIONS=359} [2025-01-09 21:30:04,505 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, 17 predicate places. [2025-01-09 21:30:04,505 INFO L471 AbstractCegarLoop]: Abstraction has has 437 places, 359 transitions, 856 flow [2025-01-09 21:30:04,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 430.3333333333333) internal successors, (1291), 3 states have internal predecessors, (1291), 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-01-09 21:30:04,505 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:04,506 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] [2025-01-09 21:30:04,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:30:04,506 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:04,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:04,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1145882581, now seen corresponding path program 1 times [2025-01-09 21:30:04,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:04,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335293938] [2025-01-09 21:30:04,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:04,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:04,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 21:30:04,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 21:30:04,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:04,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:04,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:04,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:04,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335293938] [2025-01-09 21:30:04,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335293938] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:04,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:04,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834106801] [2025-01-09 21:30:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:04,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:04,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:04,828 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:04,828 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:05,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-01-09 21:30:05,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 437 places, 359 transitions, 856 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-01-09 21:30:05,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:05,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-01-09 21:30:05,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:05,213 INFO L124 PetriNetUnfolderBase]: 29/648 cut-off events. [2025-01-09 21:30:05,214 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2025-01-09 21:30:05,217 INFO L83 FinitePrefix]: Finished finitePrefix Result has 895 conditions, 648 events. 29/648 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1918 event pairs, 2 based on Foata normal form. 0/610 useless extension candidates. Maximal degree in co-relation 872. Up to 29 conditions per place. [2025-01-09 21:30:05,218 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 25 selfloop transitions, 5 changer transitions 0/362 dead transitions. [2025-01-09 21:30:05,218 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 362 transitions, 927 flow [2025-01-09 21:30:05,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:05,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:05,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-01-09 21:30:05,221 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197665937272064 [2025-01-09 21:30:05,221 INFO L175 Difference]: Start difference. First operand has 437 places, 359 transitions, 856 flow. Second operand 6 states and 2522 transitions. [2025-01-09 21:30:05,221 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 362 transitions, 927 flow [2025-01-09 21:30:05,223 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 366 places, 362 transitions, 847 flow, removed 19 selfloop flow, removed 24 redundant places. [2025-01-09 21:30:05,226 INFO L231 Difference]: Finished difference. Result has 366 places, 357 transitions, 782 flow [2025-01-09 21:30:05,226 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=772, PETRI_DIFFERENCE_MINUEND_PLACES=361, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=782, PETRI_PLACES=366, PETRI_TRANSITIONS=357} [2025-01-09 21:30:05,226 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -54 predicate places. [2025-01-09 21:30:05,226 INFO L471 AbstractCegarLoop]: Abstraction has has 366 places, 357 transitions, 782 flow [2025-01-09 21:30:05,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-01-09 21:30:05,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:05,227 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] [2025-01-09 21:30:05,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:30:05,228 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:05,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:05,229 INFO L85 PathProgramCache]: Analyzing trace with hash 1681567255, now seen corresponding path program 1 times [2025-01-09 21:30:05,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:05,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026187275] [2025-01-09 21:30:05,229 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:05,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:05,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 21:30:05,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 21:30:05,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:05,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:05,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:05,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:05,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026187275] [2025-01-09 21:30:05,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026187275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:05,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:05,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:05,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098753403] [2025-01-09 21:30:05,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:05,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:05,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:05,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:05,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:05,289 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 426 out of 457 [2025-01-09 21:30:05,290 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 366 places, 357 transitions, 782 flow. Second operand has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:30:05,290 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:05,290 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 426 of 457 [2025-01-09 21:30:05,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:05,429 INFO L124 PetriNetUnfolderBase]: 68/1259 cut-off events. [2025-01-09 21:30:05,429 INFO L125 PetriNetUnfolderBase]: For 23/24 co-relation queries the response was YES. [2025-01-09 21:30:05,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1469 conditions, 1259 events. 68/1259 cut-off events. For 23/24 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 6588 event pairs, 17 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1459. Up to 85 conditions per place. [2025-01-09 21:30:05,433 INFO L140 encePairwiseOnDemand]: 451/457 looper letters, 14 selfloop transitions, 2 changer transitions 0/357 dead transitions. [2025-01-09 21:30:05,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 357 transitions, 816 flow [2025-01-09 21:30:05,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:05,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:05,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1298 transitions. [2025-01-09 21:30:05,435 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9467541940189642 [2025-01-09 21:30:05,435 INFO L175 Difference]: Start difference. First operand has 366 places, 357 transitions, 782 flow. Second operand 3 states and 1298 transitions. [2025-01-09 21:30:05,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 357 transitions, 816 flow [2025-01-09 21:30:05,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 357 transitions, 806 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:05,440 INFO L231 Difference]: Finished difference. Result has 360 places, 355 transitions, 778 flow [2025-01-09 21:30:05,440 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=357, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=778, PETRI_PLACES=360, PETRI_TRANSITIONS=355} [2025-01-09 21:30:05,440 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -60 predicate places. [2025-01-09 21:30:05,440 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 355 transitions, 778 flow [2025-01-09 21:30:05,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 427.3333333333333) internal successors, (1282), 3 states have internal predecessors, (1282), 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-01-09 21:30:05,441 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:05,441 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] [2025-01-09 21:30:05,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 21:30:05,441 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread2Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:05,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:05,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1456485237, now seen corresponding path program 1 times [2025-01-09 21:30:05,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:05,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-01-09 21:30:05,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:05,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:05,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 21:30:05,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 21:30:05,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:05,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:05,780 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:05,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:05,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886602747] [2025-01-09 21:30:05,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886602747] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:05,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:05,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:05,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783828251] [2025-01-09 21:30:05,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:05,780 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:05,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:05,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:05,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:06,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-01-09 21:30:06,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 355 transitions, 778 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-01-09 21:30:06,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-01-09 21:30:06,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,199 INFO L124 PetriNetUnfolderBase]: 57/799 cut-off events. [2025-01-09 21:30:06,199 INFO L125 PetriNetUnfolderBase]: For 40/42 co-relation queries the response was YES. [2025-01-09 21:30:06,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 799 events. 57/799 cut-off events. For 40/42 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3374 event pairs, 4 based on Foata normal form. 0/760 useless extension candidates. Maximal degree in co-relation 1005. Up to 52 conditions per place. [2025-01-09 21:30:06,203 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 24 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-01-09 21:30:06,203 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 357 transitions, 844 flow [2025-01-09 21:30:06,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:06,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:06,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2025-01-09 21:30:06,206 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194018964259665 [2025-01-09 21:30:06,206 INFO L175 Difference]: Start difference. First operand has 360 places, 355 transitions, 778 flow. Second operand 6 states and 2521 transitions. [2025-01-09 21:30:06,206 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 357 transitions, 844 flow [2025-01-09 21:30:06,208 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 357 transitions, 844 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:30:06,210 INFO L231 Difference]: Finished difference. Result has 363 places, 353 transitions, 784 flow [2025-01-09 21:30:06,210 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=774, PETRI_DIFFERENCE_MINUEND_PLACES=358, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=353, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=348, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=784, PETRI_PLACES=363, PETRI_TRANSITIONS=353} [2025-01-09 21:30:06,211 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -57 predicate places. [2025-01-09 21:30:06,211 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 353 transitions, 784 flow [2025-01-09 21:30:06,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-01-09 21:30:06,211 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,212 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:30:06,212 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1971929989, now seen corresponding path program 1 times [2025-01-09 21:30:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-01-09 21:30:06,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-01-09 21:30:06,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-01-09 21:30:06,229 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:06,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:30:06,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:06,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1838485091] [2025-01-09 21:30:06,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1838485091] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:06,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:06,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:06,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809082320] [2025-01-09 21:30:06,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:06,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:06,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:06,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:06,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:06,814 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-01-09 21:30:06,816 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 353 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-01-09 21:30:06,816 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:06,816 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-01-09 21:30:06,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:06,885 INFO L124 PetriNetUnfolderBase]: 33/766 cut-off events. [2025-01-09 21:30:06,885 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-01-09 21:30:06,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 961 conditions, 766 events. 33/766 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2611 event pairs, 3 based on Foata normal form. 0/734 useless extension candidates. Maximal degree in co-relation 950. Up to 29 conditions per place. [2025-01-09 21:30:06,890 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 25 selfloop transitions, 5 changer transitions 0/356 dead transitions. [2025-01-09 21:30:06,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 356 transitions, 855 flow [2025-01-09 21:30:06,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:06,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:06,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2522 transitions. [2025-01-09 21:30:06,891 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9197665937272064 [2025-01-09 21:30:06,891 INFO L175 Difference]: Start difference. First operand has 363 places, 353 transitions, 784 flow. Second operand 6 states and 2522 transitions. [2025-01-09 21:30:06,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 356 transitions, 855 flow [2025-01-09 21:30:06,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 361 places, 356 transitions, 845 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:06,895 INFO L231 Difference]: Finished difference. Result has 361 places, 351 transitions, 780 flow [2025-01-09 21:30:06,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=770, PETRI_DIFFERENCE_MINUEND_PLACES=356, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=780, PETRI_PLACES=361, PETRI_TRANSITIONS=351} [2025-01-09 21:30:06,896 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -59 predicate places. [2025-01-09 21:30:06,896 INFO L471 AbstractCegarLoop]: Abstraction has has 361 places, 351 transitions, 780 flow [2025-01-09 21:30:06,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 417.8333333333333) internal successors, (2507), 6 states have internal predecessors, (2507), 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-01-09 21:30:06,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:06,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:30:06,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 21:30:06,897 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:06,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:06,897 INFO L85 PathProgramCache]: Analyzing trace with hash -411029093, now seen corresponding path program 1 times [2025-01-09 21:30:06,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:06,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615566310] [2025-01-09 21:30:06,897 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:06,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:06,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 21:30:06,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 21:30:06,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:06,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,159 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:07,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615566310] [2025-01-09 21:30:07,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615566310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:30:07,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385522694] [2025-01-09 21:30:07,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:30:07,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:30:07,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:30:07,487 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 415 out of 457 [2025-01-09 21:30:07,489 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 361 places, 351 transitions, 780 flow. Second operand has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-01-09 21:30:07,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 415 of 457 [2025-01-09 21:30:07,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,583 INFO L124 PetriNetUnfolderBase]: 60/895 cut-off events. [2025-01-09 21:30:07,583 INFO L125 PetriNetUnfolderBase]: For 43/46 co-relation queries the response was YES. [2025-01-09 21:30:07,585 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1124 conditions, 895 events. 60/895 cut-off events. For 43/46 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 3966 event pairs, 6 based on Foata normal form. 0/853 useless extension candidates. Maximal degree in co-relation 1113. Up to 56 conditions per place. [2025-01-09 21:30:07,586 INFO L140 encePairwiseOnDemand]: 450/457 looper letters, 24 selfloop transitions, 5 changer transitions 0/353 dead transitions. [2025-01-09 21:30:07,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 364 places, 353 transitions, 846 flow [2025-01-09 21:30:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:30:07,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:30:07,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2521 transitions. [2025-01-09 21:30:07,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9194018964259665 [2025-01-09 21:30:07,588 INFO L175 Difference]: Start difference. First operand has 361 places, 351 transitions, 780 flow. Second operand 6 states and 2521 transitions. [2025-01-09 21:30:07,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 364 places, 353 transitions, 846 flow [2025-01-09 21:30:07,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 353 transitions, 836 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:07,592 INFO L231 Difference]: Finished difference. Result has 359 places, 349 transitions, 776 flow [2025-01-09 21:30:07,592 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=766, PETRI_DIFFERENCE_MINUEND_PLACES=354, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=349, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=776, PETRI_PLACES=359, PETRI_TRANSITIONS=349} [2025-01-09 21:30:07,592 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -61 predicate places. [2025-01-09 21:30:07,592 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 349 transitions, 776 flow [2025-01-09 21:30:07,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 418.0) internal successors, (2508), 6 states have internal predecessors, (2508), 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-01-09 21:30:07,593 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,593 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] [2025-01-09 21:30:07,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 21:30:07,593 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:07,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,594 INFO L85 PathProgramCache]: Analyzing trace with hash -744090005, now seen corresponding path program 1 times [2025-01-09 21:30:07,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438184813] [2025-01-09 21:30:07,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 215 statements into 1 equivalence classes. [2025-01-09 21:30:07,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 215 of 215 statements. [2025-01-09 21:30:07,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,634 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 21:30:07,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438184813] [2025-01-09 21:30:07,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438184813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645525518] [2025-01-09 21:30:07,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,650 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-01-09 21:30:07,651 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 349 transitions, 776 flow. Second operand has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-01-09 21:30:07,651 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,651 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-01-09 21:30:07,651 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,710 INFO L124 PetriNetUnfolderBase]: 29/866 cut-off events. [2025-01-09 21:30:07,710 INFO L125 PetriNetUnfolderBase]: For 7/9 co-relation queries the response was YES. [2025-01-09 21:30:07,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1020 conditions, 866 events. 29/866 cut-off events. For 7/9 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2850 event pairs, 3 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 1009. Up to 21 conditions per place. [2025-01-09 21:30:07,714 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 7 selfloop transitions, 2 changer transitions 0/349 dead transitions. [2025-01-09 21:30:07,714 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 349 transitions, 795 flow [2025-01-09 21:30:07,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-01-09 21:30:07,716 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-01-09 21:30:07,716 INFO L175 Difference]: Start difference. First operand has 359 places, 349 transitions, 776 flow. Second operand 3 states and 1300 transitions. [2025-01-09 21:30:07,716 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 349 transitions, 795 flow [2025-01-09 21:30:07,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 355 places, 349 transitions, 785 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:30:07,719 INFO L231 Difference]: Finished difference. Result has 355 places, 348 transitions, 768 flow [2025-01-09 21:30:07,719 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=764, PETRI_DIFFERENCE_MINUEND_PLACES=353, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=348, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=768, PETRI_PLACES=355, PETRI_TRANSITIONS=348} [2025-01-09 21:30:07,720 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -65 predicate places. [2025-01-09 21:30:07,720 INFO L471 AbstractCegarLoop]: Abstraction has has 355 places, 348 transitions, 768 flow [2025-01-09 21:30:07,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 431.6666666666667) internal successors, (1295), 3 states have internal predecessors, (1295), 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-01-09 21:30:07,720 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:30:07,720 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] [2025-01-09 21:30:07,720 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 21:30:07,721 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting thread2Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err2ASSERT_VIOLATIONDATA_RACE, thread1Err3ASSERT_VIOLATIONDATA_RACE (and 68 more)] === [2025-01-09 21:30:07,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:30:07,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1428330114, now seen corresponding path program 1 times [2025-01-09 21:30:07,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:30:07,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-01-09 21:30:07,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:30:07,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:30:07,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 221 statements into 1 equivalence classes. [2025-01-09 21:30:07,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 221 of 221 statements. [2025-01-09 21:30:07,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:30:07,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:30:07,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 21:30:07,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:30:07,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308736431] [2025-01-09 21:30:07,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308736431] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:30:07,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:30:07,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:30:07,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148006725] [2025-01-09 21:30:07,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:30:07,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:30:07,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:30:07,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:30:07,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:30:07,777 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 430 out of 457 [2025-01-09 21:30:07,778 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 355 places, 348 transitions, 768 flow. Second operand has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-01-09 21:30:07,778 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:30:07,778 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 430 of 457 [2025-01-09 21:30:07,778 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:30:07,825 INFO L124 PetriNetUnfolderBase]: 35/736 cut-off events. [2025-01-09 21:30:07,825 INFO L125 PetriNetUnfolderBase]: For 14/16 co-relation queries the response was YES. [2025-01-09 21:30:07,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 868 conditions, 736 events. 35/736 cut-off events. For 14/16 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2589 event pairs, 4 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 857. Up to 20 conditions per place. [2025-01-09 21:30:07,828 INFO L140 encePairwiseOnDemand]: 454/457 looper letters, 0 selfloop transitions, 0 changer transitions 348/348 dead transitions. [2025-01-09 21:30:07,828 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 356 places, 348 transitions, 787 flow [2025-01-09 21:30:07,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:30:07,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:30:07,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1300 transitions. [2025-01-09 21:30:07,829 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9482129832239241 [2025-01-09 21:30:07,829 INFO L175 Difference]: Start difference. First operand has 355 places, 348 transitions, 768 flow. Second operand 3 states and 1300 transitions. [2025-01-09 21:30:07,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 356 places, 348 transitions, 787 flow [2025-01-09 21:30:07,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 348 transitions, 783 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:30:07,832 INFO L231 Difference]: Finished difference. Result has 354 places, 0 transitions, 0 flow [2025-01-09 21:30:07,832 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=457, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=352, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=347, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=354, PETRI_TRANSITIONS=0} [2025-01-09 21:30:07,832 INFO L279 CegarLoopForPetriNet]: 420 programPoint places, -66 predicate places. [2025-01-09 21:30:07,832 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 0 transitions, 0 flow [2025-01-09 21:30:07,833 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 432.0) internal successors, (1296), 3 states have internal predecessors, (1296), 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-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (71 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (70 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (69 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (68 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (67 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (66 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (65 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (64 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (63 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (62 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (61 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (60 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (59 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (58 of 72 remaining) [2025-01-09 21:30:07,835 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (57 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (55 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (54 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (53 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (52 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (51 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (50 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (49 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (48 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (47 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (46 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (45 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (44 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (43 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (41 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (40 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (39 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (38 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (37 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (36 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (35 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (34 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (33 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (32 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (31 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (30 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (29 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (28 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (27 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (26 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (25 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (24 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (23 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (22 of 72 remaining) [2025-01-09 21:30:07,836 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (21 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (20 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (18 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (17 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (15 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (14 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (13 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (12 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (11 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (10 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (9 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (8 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (7 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (5 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (4 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (3 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (2 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (1 of 72 remaining) [2025-01-09 21:30:07,837 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (0 of 72 remaining) [2025-01-09 21:30:07,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 21:30:07,837 INFO L422 BasicCegarLoop]: Path program 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] [2025-01-09 21:30:07,841 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:30:07,841 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:30:07,848 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:30:07 BasicIcfg [2025-01-09 21:30:07,848 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:30:07,849 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:30:07,849 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:30:07,849 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:30:07,849 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:29:57" (3/4) ... [2025-01-09 21:30:07,850 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:30:07,853 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-01-09 21:30:07,853 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-01-09 21:30:07,857 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 22 nodes and edges [2025-01-09 21:30:07,857 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-01-09 21:30:07,857 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:30:07,858 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:30:07,924 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:30:07,925 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:30:07,925 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:30:07,925 INFO L158 Benchmark]: Toolchain (without parser) took 11100.90ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 134.2MB in the beginning and 219.2MB in the end (delta: -85.0MB). Peak memory consumption was 190.5MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,925 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: CACSL2BoogieTranslator took 229.59ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 121.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.01ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 118.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: Boogie Preprocessor took 29.79ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: RCFGBuilder took 572.87ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 81.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: TraceAbstraction took 10149.74ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 80.8MB in the beginning and 223.5MB in the end (delta: -142.6MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,926 INFO L158 Benchmark]: Witness Printer took 76.08ms. Allocated memory is still 444.6MB. Free memory was 223.5MB in the beginning and 219.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 21:30:07,927 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 229.59ms. Allocated memory is still 167.8MB. Free memory was 134.2MB in the beginning and 121.2MB in the end (delta: 13.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.01ms. Allocated memory is still 167.8MB. Free memory was 121.2MB in the beginning and 118.0MB in the end (delta: 3.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.79ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 115.5MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 572.87ms. Allocated memory is still 167.8MB. Free memory was 115.5MB in the beginning and 81.4MB in the end (delta: 34.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10149.74ms. Allocated memory was 167.8MB in the beginning and 444.6MB in the end (delta: 276.8MB). Free memory was 80.8MB in the beginning and 223.5MB in the end (delta: -142.6MB). Peak memory consumption was 131.8MB. Max. memory is 16.1GB. * Witness Printer took 76.08ms. Allocated memory is still 444.6MB. Free memory was 223.5MB in the beginning and 219.2MB in the end (delta: 4.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 64]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 103]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 656 locations, 72 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.0s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3591 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2299 mSDsluCounter, 3542 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 3121 mSDsCounter, 610 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5770 IncrementalHoareTripleChecker+Invalid, 6380 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 610 mSolverCounterUnsat, 421 mSDtfsCounter, 5770 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 120 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1184occurred in iteration=16, InterpolantAutomatonStates: 123, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 3156 NumberOfCodeBlocks, 3156 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 3131 ConstructedInterpolants, 0 QuantifiedInterpolants, 4560 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 18/18 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 42 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:30:07,948 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE