./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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-nzb-file-trans.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 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:28:58,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:28:58,746 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:28:58,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:28:58,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:28:58,775 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:28:58,777 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:28:58,777 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:28:58,777 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:28:58,778 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:28:58,778 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:28:58,779 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:28:58,779 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:28:58,780 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:28:58,781 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:28:58,781 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:28:58,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:28:58,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:28:58,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:28:58,784 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 -> 0d0975dc4466296431d96c26938a2e71864de63aba998f18ecd8a32ca341796b [2025-02-06 09:28:59,097 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:28:59,106 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:28:59,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:28:59,109 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:28:59,109 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:28:59,112 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-02-06 09:29:00,530 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc844e71c/cb046006c1f04653be6964e1e70f3d31/FLAGfe29a47d8 [2025-02-06 09:29:00,884 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:29:00,884 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-nzb-file-trans.wvr.c [2025-02-06 09:29:00,902 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc844e71c/cb046006c1f04653be6964e1e70f3d31/FLAGfe29a47d8 [2025-02-06 09:29:00,924 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bc844e71c/cb046006c1f04653be6964e1e70f3d31 [2025-02-06 09:29:00,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:29:00,929 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:29:00,931 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:00,932 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:29:00,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:29:00,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:00" (1/1) ... [2025-02-06 09:29:00,940 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59c2aa76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:00, skipping insertion in model container [2025-02-06 09:29:00,941 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:29:00" (1/1) ... [2025-02-06 09:29:00,963 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:29:01,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:01,225 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:29:01,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:29:01,310 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:29:01,310 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01 WrapperNode [2025-02-06 09:29:01,311 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:29:01,311 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:01,311 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:29:01,312 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:29:01,316 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,329 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,380 INFO L138 Inliner]: procedures = 25, calls = 62, calls flagged for inlining = 29, calls inlined = 43, statements flattened = 1309 [2025-02-06 09:29:01,380 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:29:01,381 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:29:01,381 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:29:01,381 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:29:01,388 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,390 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,400 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,400 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,428 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,433 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,447 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,460 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:29:01,461 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:29:01,461 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:29:01,461 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:29:01,462 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (1/1) ... [2025-02-06 09:29:01,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:29:01,480 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:29:01,496 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-02-06 09:29:01,500 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-02-06 09:29:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:29:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:29:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:29:01,525 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:29:01,525 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:29:01,526 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:29:01,526 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:29:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:29:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:29:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:29:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:29:01,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:29:01,527 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:29:01,529 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:29:01,707 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:29:01,709 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:29:03,262 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:29:03,262 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:29:03,319 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:29:03,319 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:29:03,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:03 BoogieIcfgContainer [2025-02-06 09:29:03,320 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:29:03,322 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:29:03,322 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:29:03,328 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:29:03,329 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:29:00" (1/3) ... [2025-02-06 09:29:03,329 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8006be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:03, skipping insertion in model container [2025-02-06 09:29:03,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:29:01" (2/3) ... [2025-02-06 09:29:03,330 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8006be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:29:03, skipping insertion in model container [2025-02-06 09:29:03,330 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:29:03" (3/3) ... [2025-02-06 09:29:03,331 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-nzb-file-trans.wvr.c [2025-02-06 09:29:03,344 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:29:03,346 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-nzb-file-trans.wvr.c that has 4 procedures, 1664 locations, 1 initial locations, 6 loop locations, and 225 error locations. [2025-02-06 09:29:03,346 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:29:03,634 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-06 09:29:03,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 1673 places, 1771 transitions, 3563 flow [2025-02-06 09:29:05,033 INFO L124 PetriNetUnfolderBase]: 108/1768 cut-off events. [2025-02-06 09:29:05,036 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:29:05,120 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 1768 events. 108/1768 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 7676 event pairs, 0 based on Foata normal form. 0/1435 useless extension candidates. Maximal degree in co-relation 1386. Up to 2 conditions per place. [2025-02-06 09:29:05,121 INFO L82 GeneralOperation]: Start removeDead. Operand has 1673 places, 1771 transitions, 3563 flow [2025-02-06 09:29:05,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 1651 places, 1747 transitions, 3512 flow [2025-02-06 09:29:05,181 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:29:05,197 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;@57ec0033, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:29:05,197 INFO L334 AbstractCegarLoop]: Starting to check reachability of 426 error locations. [2025-02-06 09:29:05,203 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:29:05,204 INFO L124 PetriNetUnfolderBase]: 0/38 cut-off events. [2025-02-06 09:29:05,204 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:29:05,204 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:05,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:05,205 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:05,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:05,211 INFO L85 PathProgramCache]: Analyzing trace with hash 480355490, now seen corresponding path program 1 times [2025-02-06 09:29:05,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:05,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249873841] [2025-02-06 09:29:05,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:05,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:05,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-02-06 09:29:05,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-02-06 09:29:05,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:05,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:05,421 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:05,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:05,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249873841] [2025-02-06 09:29:05,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249873841] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:05,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:05,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:05,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067141913] [2025-02-06 09:29:05,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:05,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:05,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:05,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:05,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:05,506 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:05,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1651 places, 1747 transitions, 3512 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:05,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:05,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:05,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:07,107 INFO L124 PetriNetUnfolderBase]: 124/2623 cut-off events. [2025-02-06 09:29:07,107 INFO L125 PetriNetUnfolderBase]: For 16/18 co-relation queries the response was YES. [2025-02-06 09:29:07,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2666 conditions, 2623 events. 124/2623 cut-off events. For 16/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 14461 event pairs, 5 based on Foata normal form. 103/2203 useless extension candidates. Maximal degree in co-relation 2279. Up to 22 conditions per place. [2025-02-06 09:29:07,232 INFO L140 encePairwiseOnDemand]: 1735/1771 looper letters, 11 selfloop transitions, 2 changer transitions 6/1713 dead transitions. [2025-02-06 09:29:07,233 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1652 places, 1713 transitions, 3470 flow [2025-02-06 09:29:07,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:07,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5210 transitions. [2025-02-06 09:29:07,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9806135893092415 [2025-02-06 09:29:07,266 INFO L175 Difference]: Start difference. First operand has 1651 places, 1747 transitions, 3512 flow. Second operand 3 states and 5210 transitions. [2025-02-06 09:29:07,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1652 places, 1713 transitions, 3470 flow [2025-02-06 09:29:07,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1646 places, 1713 transitions, 3458 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-02-06 09:29:07,312 INFO L231 Difference]: Finished difference. Result has 1646 places, 1707 transitions, 3424 flow [2025-02-06 09:29:07,317 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3432, PETRI_DIFFERENCE_MINUEND_PLACES=1644, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1713, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1711, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3424, PETRI_PLACES=1646, PETRI_TRANSITIONS=1707} [2025-02-06 09:29:07,322 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -5 predicate places. [2025-02-06 09:29:07,323 INFO L471 AbstractCegarLoop]: Abstraction has has 1646 places, 1707 transitions, 3424 flow [2025-02-06 09:29:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:07,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:07,327 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] [2025-02-06 09:29:07,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:29:07,327 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash -205143403, now seen corresponding path program 1 times [2025-02-06 09:29:07,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:07,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910328574] [2025-02-06 09:29:07,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:07,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-06 09:29:07,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-06 09:29:07,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:07,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:07,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:07,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:07,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910328574] [2025-02-06 09:29:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910328574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:07,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:07,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:07,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999143520] [2025-02-06 09:29:07,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:07,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:07,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:07,415 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:07,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:07,442 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:07,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1646 places, 1707 transitions, 3424 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:07,449 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:07,449 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:07,449 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:08,696 INFO L124 PetriNetUnfolderBase]: 124/2616 cut-off events. [2025-02-06 09:29:08,698 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:29:08,808 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2649 conditions, 2616 events. 124/2616 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 14908 event pairs, 5 based on Foata normal form. 0/2101 useless extension candidates. Maximal degree in co-relation 2603. Up to 22 conditions per place. [2025-02-06 09:29:08,853 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1706 dead transitions. [2025-02-06 09:29:08,853 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1641 places, 1706 transitions, 3448 flow [2025-02-06 09:29:08,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:08,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:08,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-02-06 09:29:08,866 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-02-06 09:29:08,866 INFO L175 Difference]: Start difference. First operand has 1646 places, 1707 transitions, 3424 flow. Second operand 3 states and 5177 transitions. [2025-02-06 09:29:08,866 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1641 places, 1706 transitions, 3448 flow [2025-02-06 09:29:08,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1639 places, 1706 transitions, 3444 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:08,898 INFO L231 Difference]: Finished difference. Result has 1639 places, 1706 transitions, 3422 flow [2025-02-06 09:29:08,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3418, PETRI_DIFFERENCE_MINUEND_PLACES=1637, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1706, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1704, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3422, PETRI_PLACES=1639, PETRI_TRANSITIONS=1706} [2025-02-06 09:29:08,901 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -12 predicate places. [2025-02-06 09:29:08,901 INFO L471 AbstractCegarLoop]: Abstraction has has 1639 places, 1706 transitions, 3422 flow [2025-02-06 09:29:08,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:08,905 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:08,905 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] [2025-02-06 09:29:08,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:29:08,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:08,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:08,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1280558170, now seen corresponding path program 1 times [2025-02-06 09:29:08,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:08,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812721114] [2025-02-06 09:29:08,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:08,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:08,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:29:08,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:29:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:08,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:08,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:08,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812721114] [2025-02-06 09:29:08,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812721114] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:08,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:08,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:08,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605645348] [2025-02-06 09:29:08,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:08,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:08,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:08,972 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:08,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:08,992 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:09,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1639 places, 1706 transitions, 3422 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:09,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:09,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:09,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:10,776 INFO L124 PetriNetUnfolderBase]: 172/3516 cut-off events. [2025-02-06 09:29:10,776 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:29:10,867 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3554 conditions, 3516 events. 172/3516 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 21559 event pairs, 7 based on Foata normal form. 0/2805 useless extension candidates. Maximal degree in co-relation 3500. Up to 25 conditions per place. [2025-02-06 09:29:10,926 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1705 dead transitions. [2025-02-06 09:29:10,926 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1640 places, 1705 transitions, 3446 flow [2025-02-06 09:29:10,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:10,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-02-06 09:29:10,934 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-02-06 09:29:10,934 INFO L175 Difference]: Start difference. First operand has 1639 places, 1706 transitions, 3422 flow. Second operand 3 states and 5177 transitions. [2025-02-06 09:29:10,934 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1640 places, 1705 transitions, 3446 flow [2025-02-06 09:29:10,942 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1638 places, 1705 transitions, 3442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:10,957 INFO L231 Difference]: Finished difference. Result has 1638 places, 1705 transitions, 3420 flow [2025-02-06 09:29:10,959 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3416, PETRI_DIFFERENCE_MINUEND_PLACES=1636, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1705, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1703, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3420, PETRI_PLACES=1638, PETRI_TRANSITIONS=1705} [2025-02-06 09:29:10,960 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -13 predicate places. [2025-02-06 09:29:10,960 INFO L471 AbstractCegarLoop]: Abstraction has has 1638 places, 1705 transitions, 3420 flow [2025-02-06 09:29:10,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:10,963 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:10,964 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] [2025-02-06 09:29:10,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:29:10,964 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:10,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:10,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1366413998, now seen corresponding path program 1 times [2025-02-06 09:29:10,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:10,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789589457] [2025-02-06 09:29:10,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:10,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:10,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:29:10,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:29:10,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:10,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:11,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:11,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:11,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789589457] [2025-02-06 09:29:11,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789589457] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:11,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:11,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:11,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915903359] [2025-02-06 09:29:11,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:11,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:11,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:11,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:11,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:11,047 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:11,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1638 places, 1705 transitions, 3420 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:11,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:11,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:11,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:12,410 INFO L124 PetriNetUnfolderBase]: 172/3515 cut-off events. [2025-02-06 09:29:12,410 INFO L125 PetriNetUnfolderBase]: For 2/5 co-relation queries the response was YES. [2025-02-06 09:29:12,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3553 conditions, 3515 events. 172/3515 cut-off events. For 2/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 22691 event pairs, 7 based on Foata normal form. 0/2806 useless extension candidates. Maximal degree in co-relation 3491. Up to 25 conditions per place. [2025-02-06 09:29:12,571 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1704 dead transitions. [2025-02-06 09:29:12,571 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1639 places, 1704 transitions, 3444 flow [2025-02-06 09:29:12,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:12,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:12,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-02-06 09:29:12,581 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-02-06 09:29:12,582 INFO L175 Difference]: Start difference. First operand has 1638 places, 1705 transitions, 3420 flow. Second operand 3 states and 5177 transitions. [2025-02-06 09:29:12,582 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1639 places, 1704 transitions, 3444 flow [2025-02-06 09:29:12,593 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1637 places, 1704 transitions, 3440 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:12,613 INFO L231 Difference]: Finished difference. Result has 1637 places, 1704 transitions, 3418 flow [2025-02-06 09:29:12,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3414, PETRI_DIFFERENCE_MINUEND_PLACES=1635, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1704, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1702, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3418, PETRI_PLACES=1637, PETRI_TRANSITIONS=1704} [2025-02-06 09:29:12,616 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -14 predicate places. [2025-02-06 09:29:12,616 INFO L471 AbstractCegarLoop]: Abstraction has has 1637 places, 1704 transitions, 3418 flow [2025-02-06 09:29:12,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:12,620 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:12,620 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:12,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:29:12,621 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:12,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:12,621 INFO L85 PathProgramCache]: Analyzing trace with hash -366198797, now seen corresponding path program 1 times [2025-02-06 09:29:12,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:12,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033043225] [2025-02-06 09:29:12,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:12,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:12,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-02-06 09:29:12,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-02-06 09:29:12,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:12,648 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:12,701 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:12,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:12,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033043225] [2025-02-06 09:29:12,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033043225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:12,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:12,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:12,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450220964] [2025-02-06 09:29:12,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:12,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:12,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:12,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:12,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:12,727 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:12,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1637 places, 1704 transitions, 3418 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:12,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:12,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:12,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:13,767 INFO L124 PetriNetUnfolderBase]: 103/2164 cut-off events. [2025-02-06 09:29:13,767 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-06 09:29:13,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2199 conditions, 2164 events. 103/2164 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 10881 event pairs, 7 based on Foata normal form. 0/1747 useless extension candidates. Maximal degree in co-relation 2129. Up to 25 conditions per place. [2025-02-06 09:29:13,927 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1703 dead transitions. [2025-02-06 09:29:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1638 places, 1703 transitions, 3442 flow [2025-02-06 09:29:13,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-02-06 09:29:13,936 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-02-06 09:29:13,936 INFO L175 Difference]: Start difference. First operand has 1637 places, 1704 transitions, 3418 flow. Second operand 3 states and 5177 transitions. [2025-02-06 09:29:13,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1638 places, 1703 transitions, 3442 flow [2025-02-06 09:29:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1636 places, 1703 transitions, 3438 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:14,232 INFO L231 Difference]: Finished difference. Result has 1636 places, 1703 transitions, 3416 flow [2025-02-06 09:29:14,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3412, PETRI_DIFFERENCE_MINUEND_PLACES=1634, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1703, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1701, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3416, PETRI_PLACES=1636, PETRI_TRANSITIONS=1703} [2025-02-06 09:29:14,237 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -15 predicate places. [2025-02-06 09:29:14,237 INFO L471 AbstractCegarLoop]: Abstraction has has 1636 places, 1703 transitions, 3416 flow [2025-02-06 09:29:14,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:14,241 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:14,241 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] [2025-02-06 09:29:14,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:29:14,242 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:14,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:14,243 INFO L85 PathProgramCache]: Analyzing trace with hash 559339757, now seen corresponding path program 1 times [2025-02-06 09:29:14,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:14,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360623571] [2025-02-06 09:29:14,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:14,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:14,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-06 09:29:14,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-06 09:29:14,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:14,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:14,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:14,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:14,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360623571] [2025-02-06 09:29:14,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360623571] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:14,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:14,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:14,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109981141] [2025-02-06 09:29:14,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:14,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:14,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:14,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:14,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:14,349 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1721 out of 1771 [2025-02-06 09:29:14,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1636 places, 1703 transitions, 3416 flow. Second operand has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:14,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:14,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1721 of 1771 [2025-02-06 09:29:14,357 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:15,195 INFO L124 PetriNetUnfolderBase]: 103/2163 cut-off events. [2025-02-06 09:29:15,195 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-06 09:29:15,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2198 conditions, 2163 events. 103/2163 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 11172 event pairs, 7 based on Foata normal form. 0/1750 useless extension candidates. Maximal degree in co-relation 2120. Up to 25 conditions per place. [2025-02-06 09:29:15,285 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 11 selfloop transitions, 2 changer transitions 0/1702 dead transitions. [2025-02-06 09:29:15,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1637 places, 1702 transitions, 3440 flow [2025-02-06 09:29:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:15,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5177 transitions. [2025-02-06 09:29:15,293 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744024091850179 [2025-02-06 09:29:15,293 INFO L175 Difference]: Start difference. First operand has 1636 places, 1703 transitions, 3416 flow. Second operand 3 states and 5177 transitions. [2025-02-06 09:29:15,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1637 places, 1702 transitions, 3440 flow [2025-02-06 09:29:15,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1635 places, 1702 transitions, 3436 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:15,317 INFO L231 Difference]: Finished difference. Result has 1635 places, 1702 transitions, 3414 flow [2025-02-06 09:29:15,319 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3410, PETRI_DIFFERENCE_MINUEND_PLACES=1633, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1700, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3414, PETRI_PLACES=1635, PETRI_TRANSITIONS=1702} [2025-02-06 09:29:15,320 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -16 predicate places. [2025-02-06 09:29:15,320 INFO L471 AbstractCegarLoop]: Abstraction has has 1635 places, 1702 transitions, 3414 flow [2025-02-06 09:29:15,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1722.3333333333333) internal successors, (5167), 3 states have internal predecessors, (5167), 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-02-06 09:29:15,323 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:15,323 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] [2025-02-06 09:29:15,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:29:15,324 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:15,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:15,324 INFO L85 PathProgramCache]: Analyzing trace with hash 2068066009, now seen corresponding path program 1 times [2025-02-06 09:29:15,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:15,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685350390] [2025-02-06 09:29:15,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:15,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:15,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-06 09:29:15,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-06 09:29:15,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:15,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:15,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:15,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685350390] [2025-02-06 09:29:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685350390] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723377600] [2025-02-06 09:29:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:15,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:15,455 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-02-06 09:29:15,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1635 places, 1702 transitions, 3414 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:15,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:15,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-02-06 09:29:15,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:19,014 INFO L124 PetriNetUnfolderBase]: 505/9846 cut-off events. [2025-02-06 09:29:19,015 INFO L125 PetriNetUnfolderBase]: For 2/4 co-relation queries the response was YES. [2025-02-06 09:29:19,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9929 conditions, 9846 events. 505/9846 cut-off events. For 2/4 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 88765 event pairs, 18 based on Foata normal form. 0/7772 useless extension candidates. Maximal degree in co-relation 9843. Up to 56 conditions per place. [2025-02-06 09:29:19,413 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1701 dead transitions. [2025-02-06 09:29:19,413 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1636 places, 1701 transitions, 3454 flow [2025-02-06 09:29:19,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:19,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:19,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-02-06 09:29:19,420 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-02-06 09:29:19,420 INFO L175 Difference]: Start difference. First operand has 1635 places, 1702 transitions, 3414 flow. Second operand 3 states and 5161 transitions. [2025-02-06 09:29:19,420 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1636 places, 1701 transitions, 3454 flow [2025-02-06 09:29:19,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1634 places, 1701 transitions, 3450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:19,447 INFO L231 Difference]: Finished difference. Result has 1634 places, 1701 transitions, 3412 flow [2025-02-06 09:29:19,450 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3408, PETRI_DIFFERENCE_MINUEND_PLACES=1632, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1701, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1699, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3412, PETRI_PLACES=1634, PETRI_TRANSITIONS=1701} [2025-02-06 09:29:19,451 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -17 predicate places. [2025-02-06 09:29:19,451 INFO L471 AbstractCegarLoop]: Abstraction has has 1634 places, 1701 transitions, 3412 flow [2025-02-06 09:29:19,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:19,456 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:19,456 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:19,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:29:19,457 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:19,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:19,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1646026456, now seen corresponding path program 1 times [2025-02-06 09:29:19,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:19,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11050342] [2025-02-06 09:29:19,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:19,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:19,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-06 09:29:19,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-06 09:29:19,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:19,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:19,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:19,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:19,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11050342] [2025-02-06 09:29:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11050342] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:19,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:19,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243863487] [2025-02-06 09:29:19,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:19,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:19,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:19,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:19,601 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-02-06 09:29:19,606 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1634 places, 1701 transitions, 3412 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:19,606 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:19,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-02-06 09:29:19,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:26,050 INFO L124 PetriNetUnfolderBase]: 793/15275 cut-off events. [2025-02-06 09:29:26,058 INFO L125 PetriNetUnfolderBase]: For 1/3 co-relation queries the response was YES. [2025-02-06 09:29:26,639 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15399 conditions, 15275 events. 793/15275 cut-off events. For 1/3 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 154334 event pairs, 30 based on Foata normal form. 0/12028 useless extension candidates. Maximal degree in co-relation 15305. Up to 85 conditions per place. [2025-02-06 09:29:26,905 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1700 dead transitions. [2025-02-06 09:29:26,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1635 places, 1700 transitions, 3462 flow [2025-02-06 09:29:26,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:26,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:26,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-02-06 09:29:26,912 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-02-06 09:29:26,912 INFO L175 Difference]: Start difference. First operand has 1634 places, 1701 transitions, 3412 flow. Second operand 3 states and 5151 transitions. [2025-02-06 09:29:26,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1635 places, 1700 transitions, 3462 flow [2025-02-06 09:29:26,920 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1633 places, 1700 transitions, 3458 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:26,934 INFO L231 Difference]: Finished difference. Result has 1633 places, 1700 transitions, 3410 flow [2025-02-06 09:29:26,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3406, PETRI_DIFFERENCE_MINUEND_PLACES=1631, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1700, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1698, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3410, PETRI_PLACES=1633, PETRI_TRANSITIONS=1700} [2025-02-06 09:29:26,936 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -18 predicate places. [2025-02-06 09:29:26,937 INFO L471 AbstractCegarLoop]: Abstraction has has 1633 places, 1700 transitions, 3410 flow [2025-02-06 09:29:26,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:26,938 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:26,938 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] [2025-02-06 09:29:26,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:29:26,938 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1200546438, now seen corresponding path program 1 times [2025-02-06 09:29:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399696400] [2025-02-06 09:29:26,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:26,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:26,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-02-06 09:29:26,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-02-06 09:29:26,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:26,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:27,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:27,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:27,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399696400] [2025-02-06 09:29:27,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399696400] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:27,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:27,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:27,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518593315] [2025-02-06 09:29:27,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:27,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:27,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:27,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:27,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:27,062 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-02-06 09:29:27,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1633 places, 1700 transitions, 3410 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:27,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:27,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-02-06 09:29:27,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:29,776 INFO L124 PetriNetUnfolderBase]: 298/5776 cut-off events. [2025-02-06 09:29:29,777 INFO L125 PetriNetUnfolderBase]: For 10/13 co-relation queries the response was YES. [2025-02-06 09:29:30,013 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5850 conditions, 5776 events. 298/5776 cut-off events. For 10/13 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 42651 event pairs, 18 based on Foata normal form. 0/4582 useless extension candidates. Maximal degree in co-relation 5748. Up to 56 conditions per place. [2025-02-06 09:29:30,100 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1699 dead transitions. [2025-02-06 09:29:30,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1634 places, 1699 transitions, 3450 flow [2025-02-06 09:29:30,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:30,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:30,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-02-06 09:29:30,106 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-02-06 09:29:30,106 INFO L175 Difference]: Start difference. First operand has 1633 places, 1700 transitions, 3410 flow. Second operand 3 states and 5161 transitions. [2025-02-06 09:29:30,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1634 places, 1699 transitions, 3450 flow [2025-02-06 09:29:30,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1632 places, 1699 transitions, 3446 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:30,121 INFO L231 Difference]: Finished difference. Result has 1632 places, 1699 transitions, 3408 flow [2025-02-06 09:29:30,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3404, PETRI_DIFFERENCE_MINUEND_PLACES=1630, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1699, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1697, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3408, PETRI_PLACES=1632, PETRI_TRANSITIONS=1699} [2025-02-06 09:29:30,124 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -19 predicate places. [2025-02-06 09:29:30,124 INFO L471 AbstractCegarLoop]: Abstraction has has 1632 places, 1699 transitions, 3408 flow [2025-02-06 09:29:30,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:30,125 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:30,125 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] [2025-02-06 09:29:30,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:29:30,126 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:30,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:30,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1645622462, now seen corresponding path program 1 times [2025-02-06 09:29:30,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:30,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840408819] [2025-02-06 09:29:30,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:30,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:30,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:29:30,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:29:30,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:30,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:30,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:30,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:30,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840408819] [2025-02-06 09:29:30,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840408819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:30,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:30,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:30,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057147352] [2025-02-06 09:29:30,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:30,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:30,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:30,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:30,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:30,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-02-06 09:29:30,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1632 places, 1699 transitions, 3408 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:30,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:30,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-02-06 09:29:30,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:34,146 INFO L124 PetriNetUnfolderBase]: 448/8493 cut-off events. [2025-02-06 09:29:34,146 INFO L125 PetriNetUnfolderBase]: For 16/24 co-relation queries the response was YES. [2025-02-06 09:29:34,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8602 conditions, 8493 events. 448/8493 cut-off events. For 16/24 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 71502 event pairs, 30 based on Foata normal form. 0/6708 useless extension candidates. Maximal degree in co-relation 8492. Up to 85 conditions per place. [2025-02-06 09:29:34,812 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1698 dead transitions. [2025-02-06 09:29:34,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1633 places, 1698 transitions, 3458 flow [2025-02-06 09:29:34,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:34,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:34,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-02-06 09:29:34,818 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-02-06 09:29:34,818 INFO L175 Difference]: Start difference. First operand has 1632 places, 1699 transitions, 3408 flow. Second operand 3 states and 5151 transitions. [2025-02-06 09:29:34,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1633 places, 1698 transitions, 3458 flow [2025-02-06 09:29:34,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1631 places, 1698 transitions, 3454 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:34,837 INFO L231 Difference]: Finished difference. Result has 1631 places, 1698 transitions, 3406 flow [2025-02-06 09:29:34,839 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3402, PETRI_DIFFERENCE_MINUEND_PLACES=1629, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1698, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1696, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3406, PETRI_PLACES=1631, PETRI_TRANSITIONS=1698} [2025-02-06 09:29:34,840 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -20 predicate places. [2025-02-06 09:29:34,840 INFO L471 AbstractCegarLoop]: Abstraction has has 1631 places, 1698 transitions, 3406 flow [2025-02-06 09:29:34,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:34,842 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:34,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] [2025-02-06 09:29:34,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:29:34,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:34,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:34,843 INFO L85 PathProgramCache]: Analyzing trace with hash 931496240, now seen corresponding path program 1 times [2025-02-06 09:29:34,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:34,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536491402] [2025-02-06 09:29:34,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:34,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:34,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 09:29:34,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 09:29:34,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:34,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:34,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:34,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:34,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536491402] [2025-02-06 09:29:34,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536491402] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:34,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:34,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:34,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411111507] [2025-02-06 09:29:34,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:34,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:34,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:34,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:34,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:34,959 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1713 out of 1771 [2025-02-06 09:29:34,964 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1631 places, 1698 transitions, 3406 flow. Second operand has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:34,964 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:34,964 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1713 of 1771 [2025-02-06 09:29:34,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:35,815 INFO L124 PetriNetUnfolderBase]: 91/1733 cut-off events. [2025-02-06 09:29:35,816 INFO L125 PetriNetUnfolderBase]: For 10/12 co-relation queries the response was YES. [2025-02-06 09:29:35,885 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1798 conditions, 1733 events. 91/1733 cut-off events. For 10/12 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 8523 event pairs, 18 based on Foata normal form. 0/1420 useless extension candidates. Maximal degree in co-relation 1680. Up to 56 conditions per place. [2025-02-06 09:29:35,921 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 19 selfloop transitions, 2 changer transitions 0/1697 dead transitions. [2025-02-06 09:29:35,921 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1632 places, 1697 transitions, 3446 flow [2025-02-06 09:29:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:35,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:35,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5161 transitions. [2025-02-06 09:29:35,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.971390927912667 [2025-02-06 09:29:35,928 INFO L175 Difference]: Start difference. First operand has 1631 places, 1698 transitions, 3406 flow. Second operand 3 states and 5161 transitions. [2025-02-06 09:29:35,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1632 places, 1697 transitions, 3446 flow [2025-02-06 09:29:35,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1630 places, 1697 transitions, 3442 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:35,948 INFO L231 Difference]: Finished difference. Result has 1630 places, 1697 transitions, 3404 flow [2025-02-06 09:29:35,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3400, PETRI_DIFFERENCE_MINUEND_PLACES=1628, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1695, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3404, PETRI_PLACES=1630, PETRI_TRANSITIONS=1697} [2025-02-06 09:29:35,950 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -21 predicate places. [2025-02-06 09:29:35,950 INFO L471 AbstractCegarLoop]: Abstraction has has 1630 places, 1697 transitions, 3404 flow [2025-02-06 09:29:35,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1714.3333333333333) internal successors, (5143), 3 states have internal predecessors, (5143), 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-02-06 09:29:35,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:35,952 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-02-06 09:29:35,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:29:35,952 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:35,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash -43438504, now seen corresponding path program 1 times [2025-02-06 09:29:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:35,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269794872] [2025-02-06 09:29:35,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:35,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:35,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-02-06 09:29:35,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-02-06 09:29:35,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:35,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:36,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:36,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269794872] [2025-02-06 09:29:36,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269794872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:36,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:36,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612605218] [2025-02-06 09:29:36,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:36,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:36,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:36,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:36,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:36,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1708 out of 1771 [2025-02-06 09:29:36,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1630 places, 1697 transitions, 3404 flow. Second operand has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:36,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:36,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1708 of 1771 [2025-02-06 09:29:36,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:37,029 INFO L124 PetriNetUnfolderBase]: 136/2393 cut-off events. [2025-02-06 09:29:37,030 INFO L125 PetriNetUnfolderBase]: For 32/34 co-relation queries the response was YES. [2025-02-06 09:29:37,124 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2488 conditions, 2393 events. 136/2393 cut-off events. For 32/34 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 13949 event pairs, 30 based on Foata normal form. 0/1933 useless extension candidates. Maximal degree in co-relation 2362. Up to 86 conditions per place. [2025-02-06 09:29:37,164 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 24 selfloop transitions, 2 changer transitions 0/1696 dead transitions. [2025-02-06 09:29:37,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1631 places, 1696 transitions, 3454 flow [2025-02-06 09:29:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:37,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:37,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5151 transitions. [2025-02-06 09:29:37,174 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9695087521174478 [2025-02-06 09:29:37,175 INFO L175 Difference]: Start difference. First operand has 1630 places, 1697 transitions, 3404 flow. Second operand 3 states and 5151 transitions. [2025-02-06 09:29:37,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1631 places, 1696 transitions, 3454 flow [2025-02-06 09:29:37,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1629 places, 1696 transitions, 3450 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:37,201 INFO L231 Difference]: Finished difference. Result has 1629 places, 1696 transitions, 3402 flow [2025-02-06 09:29:37,203 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3398, PETRI_DIFFERENCE_MINUEND_PLACES=1627, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1696, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1694, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3402, PETRI_PLACES=1629, PETRI_TRANSITIONS=1696} [2025-02-06 09:29:37,203 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -22 predicate places. [2025-02-06 09:29:37,203 INFO L471 AbstractCegarLoop]: Abstraction has has 1629 places, 1696 transitions, 3402 flow [2025-02-06 09:29:37,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1709.3333333333333) internal successors, (5128), 3 states have internal predecessors, (5128), 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-02-06 09:29:37,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:37,205 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:29:37,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:29:37,205 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:37,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:37,206 INFO L85 PathProgramCache]: Analyzing trace with hash 794458260, now seen corresponding path program 1 times [2025-02-06 09:29:37,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:37,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291771562] [2025-02-06 09:29:37,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:37,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:37,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-06 09:29:37,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-06 09:29:37,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:37,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:37,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:37,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:37,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291771562] [2025-02-06 09:29:37,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291771562] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:37,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:37,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:37,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104311987] [2025-02-06 09:29:37,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:37,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:37,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:37,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:37,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:37,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-02-06 09:29:37,358 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1629 places, 1696 transitions, 3402 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:37,361 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:37,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-02-06 09:29:37,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:39,840 INFO L124 PetriNetUnfolderBase]: 335/6219 cut-off events. [2025-02-06 09:29:39,840 INFO L125 PetriNetUnfolderBase]: For 11/19 co-relation queries the response was YES. [2025-02-06 09:29:39,993 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6318 conditions, 6219 events. 335/6219 cut-off events. For 11/19 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 52092 event pairs, 32 based on Foata normal form. 0/4940 useless extension candidates. Maximal degree in co-relation 6184. Up to 82 conditions per place. [2025-02-06 09:29:40,058 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1695 dead transitions. [2025-02-06 09:29:40,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1630 places, 1695 transitions, 3438 flow [2025-02-06 09:29:40,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:40,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:40,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-02-06 09:29:40,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-02-06 09:29:40,061 INFO L175 Difference]: Start difference. First operand has 1629 places, 1696 transitions, 3402 flow. Second operand 3 states and 5165 transitions. [2025-02-06 09:29:40,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1630 places, 1695 transitions, 3438 flow [2025-02-06 09:29:40,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1628 places, 1695 transitions, 3434 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:40,074 INFO L231 Difference]: Finished difference. Result has 1628 places, 1695 transitions, 3400 flow [2025-02-06 09:29:40,075 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3396, PETRI_DIFFERENCE_MINUEND_PLACES=1626, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1693, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3400, PETRI_PLACES=1628, PETRI_TRANSITIONS=1695} [2025-02-06 09:29:40,075 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -23 predicate places. [2025-02-06 09:29:40,076 INFO L471 AbstractCegarLoop]: Abstraction has has 1628 places, 1695 transitions, 3400 flow [2025-02-06 09:29:40,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:40,077 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:40,077 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] [2025-02-06 09:29:40,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:29:40,077 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:40,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:40,077 INFO L85 PathProgramCache]: Analyzing trace with hash 2003936746, now seen corresponding path program 1 times [2025-02-06 09:29:40,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:40,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902811906] [2025-02-06 09:29:40,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:40,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:40,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-02-06 09:29:40,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-02-06 09:29:40,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:40,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:40,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:40,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:40,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902811906] [2025-02-06 09:29:40,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902811906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:40,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:40,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:40,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675500151] [2025-02-06 09:29:40,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:40,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:40,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:40,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:40,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:40,175 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-02-06 09:29:40,179 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1628 places, 1695 transitions, 3400 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:40,179 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:40,179 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-02-06 09:29:40,179 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:42,616 INFO L124 PetriNetUnfolderBase]: 459/8010 cut-off events. [2025-02-06 09:29:42,617 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2025-02-06 09:29:43,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8177 conditions, 8010 events. 459/8010 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 75472 event pairs, 64 based on Foata normal form. 0/6333 useless extension candidates. Maximal degree in co-relation 8035. Up to 130 conditions per place. [2025-02-06 09:29:43,137 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1694 dead transitions. [2025-02-06 09:29:43,138 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1629 places, 1694 transitions, 3436 flow [2025-02-06 09:29:43,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:43,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:43,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-02-06 09:29:43,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-02-06 09:29:43,141 INFO L175 Difference]: Start difference. First operand has 1628 places, 1695 transitions, 3400 flow. Second operand 3 states and 5165 transitions. [2025-02-06 09:29:43,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1629 places, 1694 transitions, 3436 flow [2025-02-06 09:29:43,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1627 places, 1694 transitions, 3432 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:43,156 INFO L231 Difference]: Finished difference. Result has 1627 places, 1694 transitions, 3398 flow [2025-02-06 09:29:43,158 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3394, PETRI_DIFFERENCE_MINUEND_PLACES=1625, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1694, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1692, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3398, PETRI_PLACES=1627, PETRI_TRANSITIONS=1694} [2025-02-06 09:29:43,158 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -24 predicate places. [2025-02-06 09:29:43,159 INFO L471 AbstractCegarLoop]: Abstraction has has 1627 places, 1694 transitions, 3398 flow [2025-02-06 09:29:43,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:43,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:43,160 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] [2025-02-06 09:29:43,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:29:43,161 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:43,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:43,161 INFO L85 PathProgramCache]: Analyzing trace with hash 1927166029, now seen corresponding path program 1 times [2025-02-06 09:29:43,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:43,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230375072] [2025-02-06 09:29:43,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:43,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:43,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 09:29:43,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 09:29:43,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:43,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:43,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:43,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:43,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230375072] [2025-02-06 09:29:43,220 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230375072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:43,220 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:43,220 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:43,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459528823] [2025-02-06 09:29:43,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:43,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:43,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:43,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:43,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:43,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1715 out of 1771 [2025-02-06 09:29:43,262 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1627 places, 1694 transitions, 3398 flow. Second operand has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:43,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:43,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1715 of 1771 [2025-02-06 09:29:43,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:29:45,479 INFO L124 PetriNetUnfolderBase]: 316/5272 cut-off events. [2025-02-06 09:29:45,479 INFO L125 PetriNetUnfolderBase]: For 29/70 co-relation queries the response was YES. [2025-02-06 09:29:45,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5424 conditions, 5272 events. 316/5272 cut-off events. For 29/70 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 41488 event pairs, 64 based on Foata normal form. 0/4199 useless extension candidates. Maximal degree in co-relation 5274. Up to 139 conditions per place. [2025-02-06 09:29:45,831 INFO L140 encePairwiseOnDemand]: 1768/1771 looper letters, 17 selfloop transitions, 2 changer transitions 0/1693 dead transitions. [2025-02-06 09:29:45,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 1628 places, 1693 transitions, 3434 flow [2025-02-06 09:29:45,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:29:45,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:29:45,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 5165 transitions. [2025-02-06 09:29:45,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9721437982307548 [2025-02-06 09:29:45,836 INFO L175 Difference]: Start difference. First operand has 1627 places, 1694 transitions, 3398 flow. Second operand 3 states and 5165 transitions. [2025-02-06 09:29:45,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 1628 places, 1693 transitions, 3434 flow [2025-02-06 09:29:45,844 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 1626 places, 1693 transitions, 3430 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:29:45,857 INFO L231 Difference]: Finished difference. Result has 1626 places, 1693 transitions, 3396 flow [2025-02-06 09:29:45,858 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=1771, PETRI_DIFFERENCE_MINUEND_FLOW=3392, PETRI_DIFFERENCE_MINUEND_PLACES=1624, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1693, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=1691, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=3396, PETRI_PLACES=1626, PETRI_TRANSITIONS=1693} [2025-02-06 09:29:45,859 INFO L279 CegarLoopForPetriNet]: 1651 programPoint places, -25 predicate places. [2025-02-06 09:29:45,859 INFO L471 AbstractCegarLoop]: Abstraction has has 1626 places, 1693 transitions, 3396 flow [2025-02-06 09:29:45,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1716.3333333333333) internal successors, (5149), 3 states have internal predecessors, (5149), 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-02-06 09:29:45,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:29:45,860 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-02-06 09:29:45,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:29:45,860 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err56ASSERT_VIOLATIONDATA_RACE, thread1Err65ASSERT_VIOLATIONDATA_RACE, thread1Err55ASSERT_VIOLATIONDATA_RACE, thread1Err64ASSERT_VIOLATIONDATA_RACE (and 422 more)] === [2025-02-06 09:29:45,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:29:45,861 INFO L85 PathProgramCache]: Analyzing trace with hash 2037871573, now seen corresponding path program 1 times [2025-02-06 09:29:45,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:29:45,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20714833] [2025-02-06 09:29:45,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:29:45,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:29:45,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-06 09:29:45,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-06 09:29:45,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:29:45,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:29:45,911 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:29:45,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:29:45,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20714833] [2025-02-06 09:29:45,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20714833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:29:45,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:29:45,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:29:45,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764476875] [2025-02-06 09:29:45,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:29:45,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:29:45,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:29:45,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:29:45,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:29:45,991 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 1709 out of 1771 [2025-02-06 09:29:45,994 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 1626 places, 1693 transitions, 3396 flow. Second operand has 3 states, 3 states have (on average 1710.3333333333333) internal successors, (5131), 3 states have internal predecessors, (5131), 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-02-06 09:29:45,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:29:45,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 1709 of 1771 [2025-02-06 09:29:45,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand