./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d 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-chromosome-opt-symm.wvr.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:37:07,878 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:37:07,940 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:37:07,944 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:37:07,944 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:37:07,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:37:07,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:37:07,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:37:07,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:37:07,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:37:07,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:37:07,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:37:07,961 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:37:07,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:37:07,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:07,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:37:07,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:37:07,964 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 -> b034d85232772d264d33ccb960d3ce3e7bf57df858fd0c6fd0b22127388c3f9a [2025-02-08 05:37:08,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:37:08,184 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:37:08,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:37:08,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:37:08,186 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:37:08,187 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-08 05:37:09,322 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61265cdd/833c06dc9c4f44ecbc933aedd9efa4cf/FLAG1af56e7ad [2025-02-08 05:37:09,598 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:37:09,598 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/chl-chromosome-opt-symm.wvr.c [2025-02-08 05:37:09,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61265cdd/833c06dc9c4f44ecbc933aedd9efa4cf/FLAG1af56e7ad [2025-02-08 05:37:09,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d61265cdd/833c06dc9c4f44ecbc933aedd9efa4cf [2025-02-08 05:37:09,658 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:37:09,660 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:37:09,661 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:09,661 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:37:09,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:37:09,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37d44b8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09, skipping insertion in model container [2025-02-08 05:37:09,666 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,684 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:37:09,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:09,820 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:37:09,840 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:37:09,851 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:37:09,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09 WrapperNode [2025-02-08 05:37:09,852 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:37:09,853 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:09,853 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:37:09,853 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:37:09,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,867 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,904 INFO L138 Inliner]: procedures = 23, calls = 26, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 269 [2025-02-08 05:37:09,904 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:37:09,905 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:37:09,905 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:37:09,905 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:37:09,911 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,911 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,914 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,914 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,925 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,931 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,932 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,935 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:37:09,937 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:37:09,938 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:37:09,938 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:37:09,938 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (1/1) ... [2025-02-08 05:37:09,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:37:09,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:09,987 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-08 05:37:09,992 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-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:37:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-08 05:37:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:37:10,011 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:37:10,011 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:37:10,012 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:37:10,103 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:37:10,104 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:37:10,438 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:37:10,439 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:37:10,450 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:37:10,451 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:37:10,451 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10 BoogieIcfgContainer [2025-02-08 05:37:10,451 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:37:10,453 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:37:10,453 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:37:10,456 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:37:10,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:37:09" (1/3) ... [2025-02-08 05:37:10,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1474cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:10, skipping insertion in model container [2025-02-08 05:37:10,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:37:09" (2/3) ... [2025-02-08 05:37:10,457 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e1474cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:37:10, skipping insertion in model container [2025-02-08 05:37:10,457 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10" (3/3) ... [2025-02-08 05:37:10,457 INFO L128 eAbstractionObserver]: Analyzing ICFG chl-chromosome-opt-symm.wvr.c [2025-02-08 05:37:10,469 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:37:10,470 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG chl-chromosome-opt-symm.wvr.c that has 3 procedures, 328 locations, 1 initial locations, 4 loop locations, and 30 error locations. [2025-02-08 05:37:10,470 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:37:10,584 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:37:10,622 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 334 places, 344 transitions, 702 flow [2025-02-08 05:37:10,757 INFO L124 PetriNetUnfolderBase]: 17/342 cut-off events. [2025-02-08 05:37:10,759 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:10,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 342 events. 17/342 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 681 event pairs, 0 based on Foata normal form. 0/295 useless extension candidates. Maximal degree in co-relation 234. Up to 3 conditions per place. [2025-02-08 05:37:10,767 INFO L82 GeneralOperation]: Start removeDead. Operand has 334 places, 344 transitions, 702 flow [2025-02-08 05:37:10,773 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 316 places, 325 transitions, 662 flow [2025-02-08 05:37:10,784 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:37:10,797 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;@1cf387c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:37:10,797 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2025-02-08 05:37:10,810 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:37:10,812 INFO L124 PetriNetUnfolderBase]: 2/59 cut-off events. [2025-02-08 05:37:10,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:37:10,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:10,812 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-08 05:37:10,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:10,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1464131574, now seen corresponding path program 1 times [2025-02-08 05:37:10,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:10,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689731437] [2025-02-08 05:37:10,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:10,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:10,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:10,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:10,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:10,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:11,525 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-08 05:37:11,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:11,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689731437] [2025-02-08 05:37:11,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689731437] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:11,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:11,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:11,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275965248] [2025-02-08 05:37:11,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:11,533 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:11,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:11,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:11,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:11,879 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 270 out of 344 [2025-02-08 05:37:11,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 316 places, 325 transitions, 662 flow. Second operand has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 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-08 05:37:11,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:11,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 270 of 344 [2025-02-08 05:37:11,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,252 INFO L124 PetriNetUnfolderBase]: 424/2295 cut-off events. [2025-02-08 05:37:12,252 INFO L125 PetriNetUnfolderBase]: For 158/159 co-relation queries the response was YES. [2025-02-08 05:37:12,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3100 conditions, 2295 events. 424/2295 cut-off events. For 158/159 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 16295 event pairs, 288 based on Foata normal form. 98/1995 useless extension candidates. Maximal degree in co-relation 2697. Up to 709 conditions per place. [2025-02-08 05:37:12,275 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 52 selfloop transitions, 10 changer transitions 4/315 dead transitions. [2025-02-08 05:37:12,276 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 315 transitions, 766 flow [2025-02-08 05:37:12,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:12,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1692 transitions. [2025-02-08 05:37:12,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8197674418604651 [2025-02-08 05:37:12,305 INFO L175 Difference]: Start difference. First operand has 316 places, 325 transitions, 662 flow. Second operand 6 states and 1692 transitions. [2025-02-08 05:37:12,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 315 transitions, 766 flow [2025-02-08 05:37:12,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 315 transitions, 758 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-08 05:37:12,322 INFO L231 Difference]: Finished difference. Result has 315 places, 311 transitions, 646 flow [2025-02-08 05:37:12,324 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=634, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=646, PETRI_PLACES=315, PETRI_TRANSITIONS=311} [2025-02-08 05:37:12,329 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -1 predicate places. [2025-02-08 05:37:12,333 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 311 transitions, 646 flow [2025-02-08 05:37:12,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 271.5) internal successors, (1629), 6 states have internal predecessors, (1629), 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-08 05:37:12,334 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,334 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-08 05:37:12,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:37:12,335 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:12,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1620186677, now seen corresponding path program 1 times [2025-02-08 05:37:12,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866177378] [2025-02-08 05:37:12,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-02-08 05:37:12,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-02-08 05:37:12,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,359 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-08 05:37:12,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866177378] [2025-02-08 05:37:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866177378] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606778109] [2025-02-08 05:37:12,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,360 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,394 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344 [2025-02-08 05:37:12,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 311 transitions, 646 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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-08 05:37:12,395 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,395 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344 [2025-02-08 05:37:12,395 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,502 INFO L124 PetriNetUnfolderBase]: 22/488 cut-off events. [2025-02-08 05:37:12,502 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:12,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 534 conditions, 488 events. 22/488 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1556 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 501. Up to 28 conditions per place. [2025-02-08 05:37:12,506 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/310 dead transitions. [2025-02-08 05:37:12,506 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 310 transitions, 670 flow [2025-02-08 05:37:12,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:37:12,509 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408914728682171 [2025-02-08 05:37:12,509 INFO L175 Difference]: Start difference. First operand has 315 places, 311 transitions, 646 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:37:12,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 310 transitions, 670 flow [2025-02-08 05:37:12,511 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 310 transitions, 650 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:12,514 INFO L231 Difference]: Finished difference. Result has 307 places, 310 transitions, 628 flow [2025-02-08 05:37:12,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=310, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=307, PETRI_TRANSITIONS=310} [2025-02-08 05:37:12,515 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -9 predicate places. [2025-02-08 05:37:12,515 INFO L471 AbstractCegarLoop]: Abstraction has has 307 places, 310 transitions, 628 flow [2025-02-08 05:37:12,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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-08 05:37:12,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,515 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-08 05:37:12,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:37:12,516 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:12,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,516 INFO L85 PathProgramCache]: Analyzing trace with hash -2029056642, now seen corresponding path program 1 times [2025-02-08 05:37:12,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579483325] [2025-02-08 05:37:12,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-08 05:37:12,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-08 05:37:12,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,553 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-08 05:37:12,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579483325] [2025-02-08 05:37:12,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579483325] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250912148] [2025-02-08 05:37:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 319 out of 344 [2025-02-08 05:37:12,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 310 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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-08 05:37:12,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 319 of 344 [2025-02-08 05:37:12,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,643 INFO L124 PetriNetUnfolderBase]: 22/487 cut-off events. [2025-02-08 05:37:12,644 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:12,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 525 conditions, 487 events. 22/487 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1454 event pairs, 8 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 456. Up to 28 conditions per place. [2025-02-08 05:37:12,647 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 11 selfloop transitions, 2 changer transitions 0/309 dead transitions. [2025-02-08 05:37:12,648 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 308 places, 309 transitions, 652 flow [2025-02-08 05:37:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 971 transitions. [2025-02-08 05:37:12,650 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9408914728682171 [2025-02-08 05:37:12,650 INFO L175 Difference]: Start difference. First operand has 307 places, 310 transitions, 628 flow. Second operand 3 states and 971 transitions. [2025-02-08 05:37:12,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 308 places, 309 transitions, 652 flow [2025-02-08 05:37:12,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 309 transitions, 648 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,655 INFO L231 Difference]: Finished difference. Result has 306 places, 309 transitions, 626 flow [2025-02-08 05:37:12,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=622, PETRI_DIFFERENCE_MINUEND_PLACES=304, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=309, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=307, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=306, PETRI_TRANSITIONS=309} [2025-02-08 05:37:12,656 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -10 predicate places. [2025-02-08 05:37:12,657 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 309 transitions, 626 flow [2025-02-08 05:37:12,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 320.3333333333333) internal successors, (961), 3 states have internal predecessors, (961), 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-08 05:37:12,657 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,657 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-08 05:37:12,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:37:12,658 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:12,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1544875958, now seen corresponding path program 1 times [2025-02-08 05:37:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243127937] [2025-02-08 05:37:12,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-08 05:37:12,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-08 05:37:12,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,713 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-08 05:37:12,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243127937] [2025-02-08 05:37:12,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243127937] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693876956] [2025-02-08 05:37:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,714 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344 [2025-02-08 05:37:12,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 309 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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-08 05:37:12,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344 [2025-02-08 05:37:12,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,804 INFO L124 PetriNetUnfolderBase]: 17/468 cut-off events. [2025-02-08 05:37:12,804 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-08 05:37:12,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 493 conditions, 468 events. 17/468 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1439 event pairs, 3 based on Foata normal form. 0/402 useless extension candidates. Maximal degree in co-relation 377. Up to 16 conditions per place. [2025-02-08 05:37:12,808 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-08 05:37:12,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 308 transitions, 646 flow [2025-02-08 05:37:12,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-02-08 05:37:12,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447674418604651 [2025-02-08 05:37:12,810 INFO L175 Difference]: Start difference. First operand has 306 places, 309 transitions, 626 flow. Second operand 3 states and 975 transitions. [2025-02-08 05:37:12,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 308 transitions, 646 flow [2025-02-08 05:37:12,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 305 places, 308 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,816 INFO L231 Difference]: Finished difference. Result has 305 places, 308 transitions, 624 flow [2025-02-08 05:37:12,816 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=308, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=306, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=624, PETRI_PLACES=305, PETRI_TRANSITIONS=308} [2025-02-08 05:37:12,818 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -11 predicate places. [2025-02-08 05:37:12,818 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 308 transitions, 624 flow [2025-02-08 05:37:12,818 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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-08 05:37:12,818 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,819 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-08 05:37:12,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:37:12,819 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:12,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,820 INFO L85 PathProgramCache]: Analyzing trace with hash -552893630, now seen corresponding path program 1 times [2025-02-08 05:37:12,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031728848] [2025-02-08 05:37:12,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:12,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-08 05:37:12,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-08 05:37:12,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:12,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:12,886 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-08 05:37:12,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:12,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031728848] [2025-02-08 05:37:12,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031728848] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:12,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:12,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:12,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40116562] [2025-02-08 05:37:12,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:12,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:12,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:12,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:12,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:12,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 321 out of 344 [2025-02-08 05:37:12,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 308 transitions, 624 flow. Second operand has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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-08 05:37:12,906 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:12,906 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 321 of 344 [2025-02-08 05:37:12,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:12,973 INFO L124 PetriNetUnfolderBase]: 14/395 cut-off events. [2025-02-08 05:37:12,974 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-08 05:37:12,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 420 conditions, 395 events. 14/395 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 985 event pairs, 3 based on Foata normal form. 0/345 useless extension candidates. Maximal degree in co-relation 296. Up to 16 conditions per place. [2025-02-08 05:37:12,976 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 9 selfloop transitions, 2 changer transitions 0/307 dead transitions. [2025-02-08 05:37:12,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 306 places, 307 transitions, 644 flow [2025-02-08 05:37:12,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 975 transitions. [2025-02-08 05:37:12,982 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9447674418604651 [2025-02-08 05:37:12,982 INFO L175 Difference]: Start difference. First operand has 305 places, 308 transitions, 624 flow. Second operand 3 states and 975 transitions. [2025-02-08 05:37:12,982 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 306 places, 307 transitions, 644 flow [2025-02-08 05:37:12,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 307 transitions, 640 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:12,990 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 622 flow [2025-02-08 05:37:12,991 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=618, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=305, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=622, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-02-08 05:37:12,991 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2025-02-08 05:37:12,991 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 622 flow [2025-02-08 05:37:12,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 322.3333333333333) internal successors, (967), 3 states have internal predecessors, (967), 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-08 05:37:12,993 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:12,993 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] [2025-02-08 05:37:12,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:37:12,994 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:12,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1469995781, now seen corresponding path program 1 times [2025-02-08 05:37:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39036151] [2025-02-08 05:37:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:12,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-08 05:37:13,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-08 05:37:13,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,060 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-08 05:37:13,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [39036151] [2025-02-08 05:37:13,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [39036151] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:13,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037642215] [2025-02-08 05:37:13,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:13,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,064 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:13,064 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:13,074 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344 [2025-02-08 05:37:13,076 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 622 flow. Second operand has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 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-08 05:37:13,077 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,077 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344 [2025-02-08 05:37:13,077 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,132 INFO L124 PetriNetUnfolderBase]: 31/684 cut-off events. [2025-02-08 05:37:13,132 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-08 05:37:13,135 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 684 events. 31/684 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2988 event pairs, 5 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 589. Up to 25 conditions per place. [2025-02-08 05:37:13,137 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-08 05:37:13,137 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 304 places, 308 transitions, 649 flow [2025-02-08 05:37:13,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:13,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:13,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-02-08 05:37:13,139 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-02-08 05:37:13,139 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 622 flow. Second operand 3 states and 983 transitions. [2025-02-08 05:37:13,139 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 304 places, 308 transitions, 649 flow [2025-02-08 05:37:13,141 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:13,145 INFO L231 Difference]: Finished difference. Result has 303 places, 307 transitions, 628 flow [2025-02-08 05:37:13,146 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=614, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=303, PETRI_TRANSITIONS=307} [2025-02-08 05:37:13,147 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2025-02-08 05:37:13,148 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 307 transitions, 628 flow [2025-02-08 05:37:13,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.3333333333333) internal successors, (973), 3 states have internal predecessors, (973), 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-08 05:37:13,149 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,149 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] [2025-02-08 05:37:13,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:37:13,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err10ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:13,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1693014976, now seen corresponding path program 1 times [2025-02-08 05:37:13,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812885311] [2025-02-08 05:37:13,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-08 05:37:13,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-08 05:37:13,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,186 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-08 05:37:13,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812885311] [2025-02-08 05:37:13,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812885311] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:13,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930600488] [2025-02-08 05:37:13,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:13,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,188 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:13,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:13,197 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 344 [2025-02-08 05:37:13,198 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 307 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-08 05:37:13,198 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,198 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 344 [2025-02-08 05:37:13,198 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,250 INFO L124 PetriNetUnfolderBase]: 32/662 cut-off events. [2025-02-08 05:37:13,250 INFO L125 PetriNetUnfolderBase]: For 4/6 co-relation queries the response was YES. [2025-02-08 05:37:13,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 707 conditions, 662 events. 32/662 cut-off events. For 4/6 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 3072 event pairs, 3 based on Foata normal form. 0/571 useless extension candidates. Maximal degree in co-relation 492. Up to 26 conditions per place. [2025-02-08 05:37:13,254 INFO L140 encePairwiseOnDemand]: 340/344 looper letters, 10 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-08 05:37:13,254 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 308 transitions, 655 flow [2025-02-08 05:37:13,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:13,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-02-08 05:37:13,256 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-02-08 05:37:13,256 INFO L175 Difference]: Start difference. First operand has 303 places, 307 transitions, 628 flow. Second operand 3 states and 983 transitions. [2025-02-08 05:37:13,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 308 transitions, 655 flow [2025-02-08 05:37:13,258 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 303 places, 308 transitions, 655 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:13,260 INFO L231 Difference]: Finished difference. Result has 304 places, 307 transitions, 638 flow [2025-02-08 05:37:13,260 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=638, PETRI_PLACES=304, PETRI_TRANSITIONS=307} [2025-02-08 05:37:13,261 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -12 predicate places. [2025-02-08 05:37:13,261 INFO L471 AbstractCegarLoop]: Abstraction has has 304 places, 307 transitions, 638 flow [2025-02-08 05:37:13,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 324.6666666666667) internal successors, (974), 3 states have internal predecessors, (974), 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-08 05:37:13,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,262 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] [2025-02-08 05:37:13,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:37:13,262 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:13,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1430979319, now seen corresponding path program 1 times [2025-02-08 05:37:13,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103746471] [2025-02-08 05:37:13,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,269 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-08 05:37:13,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-08 05:37:13,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,308 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-08 05:37:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103746471] [2025-02-08 05:37:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103746471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:13,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108314033] [2025-02-08 05:37:13,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:13,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:13,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:13,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344 [2025-02-08 05:37:13,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 304 places, 307 transitions, 638 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-08 05:37:13,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344 [2025-02-08 05:37:13,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,424 INFO L124 PetriNetUnfolderBase]: 80/1050 cut-off events. [2025-02-08 05:37:13,424 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-02-08 05:37:13,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 1050 events. 80/1050 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 5533 event pairs, 12 based on Foata normal form. 0/904 useless extension candidates. Maximal degree in co-relation 950. Up to 94 conditions per place. [2025-02-08 05:37:13,431 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/308 dead transitions. [2025-02-08 05:37:13,431 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 302 places, 308 transitions, 679 flow [2025-02-08 05:37:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:13,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:13,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:37:13,437 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428294573643411 [2025-02-08 05:37:13,437 INFO L175 Difference]: Start difference. First operand has 304 places, 307 transitions, 638 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:37:13,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 302 places, 308 transitions, 679 flow [2025-02-08 05:37:13,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 308 transitions, 679 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:13,441 INFO L231 Difference]: Finished difference. Result has 303 places, 305 transitions, 644 flow [2025-02-08 05:37:13,443 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=300, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=303, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=301, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=644, PETRI_PLACES=303, PETRI_TRANSITIONS=305} [2025-02-08 05:37:13,444 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -13 predicate places. [2025-02-08 05:37:13,445 INFO L471 AbstractCegarLoop]: Abstraction has has 303 places, 305 transitions, 644 flow [2025-02-08 05:37:13,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 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-08 05:37:13,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,446 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] [2025-02-08 05:37:13,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:37:13,446 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:13,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1962774618, now seen corresponding path program 1 times [2025-02-08 05:37:13,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218568649] [2025-02-08 05:37:13,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-02-08 05:37:13,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-02-08 05:37:13,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,554 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-08 05:37:13,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218568649] [2025-02-08 05:37:13,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218568649] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:13,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:13,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:13,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045397500] [2025-02-08 05:37:13,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:13,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:37:13,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:13,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:37:13,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:37:13,635 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 312 out of 344 [2025-02-08 05:37:13,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 303 places, 305 transitions, 644 flow. Second operand has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 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-08 05:37:13,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:13,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 312 of 344 [2025-02-08 05:37:13,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:13,721 INFO L124 PetriNetUnfolderBase]: 25/588 cut-off events. [2025-02-08 05:37:13,722 INFO L125 PetriNetUnfolderBase]: For 6/10 co-relation queries the response was YES. [2025-02-08 05:37:13,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 660 conditions, 588 events. 25/588 cut-off events. For 6/10 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2122 event pairs, 0 based on Foata normal form. 2/527 useless extension candidates. Maximal degree in co-relation 441. Up to 13 conditions per place. [2025-02-08 05:37:13,725 INFO L140 encePairwiseOnDemand]: 330/344 looper letters, 12 selfloop transitions, 12 changer transitions 0/307 dead transitions. [2025-02-08 05:37:13,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 307 transitions, 696 flow [2025-02-08 05:37:13,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 05:37:13,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-08 05:37:13,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1586 transitions. [2025-02-08 05:37:13,728 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.922093023255814 [2025-02-08 05:37:13,728 INFO L175 Difference]: Start difference. First operand has 303 places, 305 transitions, 644 flow. Second operand 5 states and 1586 transitions. [2025-02-08 05:37:13,729 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 307 transitions, 696 flow [2025-02-08 05:37:13,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 307 transitions, 696 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:13,732 INFO L231 Difference]: Finished difference. Result has 308 places, 307 transitions, 684 flow [2025-02-08 05:37:13,733 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=644, PETRI_DIFFERENCE_MINUEND_PLACES=303, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=305, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=293, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=684, PETRI_PLACES=308, PETRI_TRANSITIONS=307} [2025-02-08 05:37:13,733 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -8 predicate places. [2025-02-08 05:37:13,734 INFO L471 AbstractCegarLoop]: Abstraction has has 308 places, 307 transitions, 684 flow [2025-02-08 05:37:13,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 315.4) internal successors, (1577), 5 states have internal predecessors, (1577), 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-08 05:37:13,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:13,735 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] [2025-02-08 05:37:13,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:37:13,735 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:13,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:13,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1484867005, now seen corresponding path program 1 times [2025-02-08 05:37:13,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:13,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730312166] [2025-02-08 05:37:13,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:13,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:37:13,766 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:37:13,767 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:13,767 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:13,918 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:13,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:13,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730312166] [2025-02-08 05:37:13,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730312166] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:13,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173504053] [2025-02-08 05:37:13,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:13,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:13,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:13,921 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:13,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 05:37:13,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-08 05:37:14,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-08 05:37:14,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:14,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:14,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-08 05:37:14,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:14,177 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:14,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 05:37:14,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173504053] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:14,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:14,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-02-08 05:37:14,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016643073] [2025-02-08 05:37:14,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:14,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:37:14,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:14,278 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:37:14,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-02-08 05:37:14,621 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:14,625 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 308 places, 307 transitions, 684 flow. Second operand has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 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-08 05:37:14,625 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:14,625 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:14,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:14,837 INFO L124 PetriNetUnfolderBase]: 25/622 cut-off events. [2025-02-08 05:37:14,837 INFO L125 PetriNetUnfolderBase]: For 16/20 co-relation queries the response was YES. [2025-02-08 05:37:14,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 738 conditions, 622 events. 25/622 cut-off events. For 16/20 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2073 event pairs, 0 based on Foata normal form. 4/563 useless extension candidates. Maximal degree in co-relation 513. Up to 13 conditions per place. [2025-02-08 05:37:14,841 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 20 selfloop transitions, 26 changer transitions 0/323 dead transitions. [2025-02-08 05:37:14,842 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 323 transitions, 812 flow [2025-02-08 05:37:14,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-02-08 05:37:14,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-02-08 05:37:14,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 3416 transitions. [2025-02-08 05:37:14,848 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9027484143763214 [2025-02-08 05:37:14,848 INFO L175 Difference]: Start difference. First operand has 308 places, 307 transitions, 684 flow. Second operand 11 states and 3416 transitions. [2025-02-08 05:37:14,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 323 transitions, 812 flow [2025-02-08 05:37:14,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 315 places, 323 transitions, 792 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:14,854 INFO L231 Difference]: Finished difference. Result has 318 places, 319 transitions, 784 flow [2025-02-08 05:37:14,854 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=307, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=287, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=784, PETRI_PLACES=318, PETRI_TRANSITIONS=319} [2025-02-08 05:37:14,856 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places. [2025-02-08 05:37:14,856 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 319 transitions, 784 flow [2025-02-08 05:37:14,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 308.6666666666667) internal successors, (4630), 15 states have internal predecessors, (4630), 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-08 05:37:14,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:14,859 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:14,869 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-08 05:37:15,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 05:37:15,060 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:15,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,061 INFO L85 PathProgramCache]: Analyzing trace with hash -128947613, now seen corresponding path program 2 times [2025-02-08 05:37:15,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49956992] [2025-02-08 05:37:15,062 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:15,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 212 statements into 2 equivalence classes. [2025-02-08 05:37:15,093 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 122 of 212 statements. [2025-02-08 05:37:15,093 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:15,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,441 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:15,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49956992] [2025-02-08 05:37:15,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49956992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:15,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421618742] [2025-02-08 05:37:15,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:15,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:15,764 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:15,766 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 319 transitions, 784 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 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-08 05:37:15,766 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,766 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:15,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:15,867 INFO L124 PetriNetUnfolderBase]: 38/726 cut-off events. [2025-02-08 05:37:15,867 INFO L125 PetriNetUnfolderBase]: For 21/48 co-relation queries the response was YES. [2025-02-08 05:37:15,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 940 conditions, 726 events. 38/726 cut-off events. For 21/48 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2929 event pairs, 2 based on Foata normal form. 3/658 useless extension candidates. Maximal degree in co-relation 686. Up to 44 conditions per place. [2025-02-08 05:37:15,872 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/323 dead transitions. [2025-02-08 05:37:15,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 321 places, 323 transitions, 862 flow [2025-02-08 05:37:15,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:15,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:15,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2025-02-08 05:37:15,875 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2025-02-08 05:37:15,875 INFO L175 Difference]: Start difference. First operand has 318 places, 319 transitions, 784 flow. Second operand 6 states and 1870 transitions. [2025-02-08 05:37:15,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 321 places, 323 transitions, 862 flow [2025-02-08 05:37:15,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 838 flow, removed 4 selfloop flow, removed 3 redundant places. [2025-02-08 05:37:15,881 INFO L231 Difference]: Finished difference. Result has 318 places, 317 transitions, 766 flow [2025-02-08 05:37:15,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=756, PETRI_DIFFERENCE_MINUEND_PLACES=313, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=766, PETRI_PLACES=318, PETRI_TRANSITIONS=317} [2025-02-08 05:37:15,882 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places. [2025-02-08 05:37:15,882 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 317 transitions, 766 flow [2025-02-08 05:37:15,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 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-08 05:37:15,883 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:15,883 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:15,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:37:15,883 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:15,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:15,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1336024616, now seen corresponding path program 1 times [2025-02-08 05:37:15,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:15,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068880284] [2025-02-08 05:37:15,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:15,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:15,898 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-02-08 05:37:15,908 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-02-08 05:37:15,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:15,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-02-08 05:37:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068880284] [2025-02-08 05:37:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068880284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003461600] [2025-02-08 05:37:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:15,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:15,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:15,971 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 344 [2025-02-08 05:37:15,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 317 transitions, 766 flow. Second operand has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-08 05:37:15,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:15,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 344 [2025-02-08 05:37:15,976 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:16,223 INFO L124 PetriNetUnfolderBase]: 90/1210 cut-off events. [2025-02-08 05:37:16,224 INFO L125 PetriNetUnfolderBase]: For 34/45 co-relation queries the response was YES. [2025-02-08 05:37:16,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 1210 events. 90/1210 cut-off events. For 34/45 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 6391 event pairs, 16 based on Foata normal form. 0/1091 useless extension candidates. Maximal degree in co-relation 1266. Up to 116 conditions per place. [2025-02-08 05:37:16,229 INFO L140 encePairwiseOnDemand]: 338/344 looper letters, 16 selfloop transitions, 2 changer transitions 0/318 dead transitions. [2025-02-08 05:37:16,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 316 places, 318 transitions, 807 flow [2025-02-08 05:37:16,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:16,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:16,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 973 transitions. [2025-02-08 05:37:16,232 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9428294573643411 [2025-02-08 05:37:16,232 INFO L175 Difference]: Start difference. First operand has 318 places, 317 transitions, 766 flow. Second operand 3 states and 973 transitions. [2025-02-08 05:37:16,232 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 316 places, 318 transitions, 807 flow [2025-02-08 05:37:16,235 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 311 places, 318 transitions, 797 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:16,238 INFO L231 Difference]: Finished difference. Result has 312 places, 315 transitions, 762 flow [2025-02-08 05:37:16,238 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=309, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=311, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=762, PETRI_PLACES=312, PETRI_TRANSITIONS=315} [2025-02-08 05:37:16,239 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -4 predicate places. [2025-02-08 05:37:16,239 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 315 transitions, 762 flow [2025-02-08 05:37:16,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.6666666666667) internal successors, (956), 3 states have internal predecessors, (956), 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-08 05:37:16,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:16,240 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:16,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:37:16,240 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:16,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:16,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1923537307, now seen corresponding path program 1 times [2025-02-08 05:37:16,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:16,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293501731] [2025-02-08 05:37:16,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:16,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 05:37:16,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 05:37:16,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,502 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:16,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:16,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293501731] [2025-02-08 05:37:16,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293501731] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:37:16,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [399535349] [2025-02-08 05:37:16,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:16,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:16,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:37:16,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:37:16,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 05:37:16,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-02-08 05:37:16,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-02-08 05:37:16,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:16,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:16,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-08 05:37:16,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:37:16,872 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:16,872 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:37:17,047 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-02-08 05:37:17,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [399535349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:37:17,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:37:17,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 22 [2025-02-08 05:37:17,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806697510] [2025-02-08 05:37:17,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:37:17,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-02-08 05:37:17,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:17,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-02-08 05:37:17,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2025-02-08 05:37:17,379 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:17,383 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 312 places, 315 transitions, 762 flow. Second operand has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 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-08 05:37:17,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:17,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:17,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:17,669 INFO L124 PetriNetUnfolderBase]: 31/739 cut-off events. [2025-02-08 05:37:17,670 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2025-02-08 05:37:17,672 INFO L83 FinitePrefix]: Finished finitePrefix Result has 946 conditions, 739 events. 31/739 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2518 event pairs, 0 based on Foata normal form. 4/690 useless extension candidates. Maximal degree in co-relation 589. Up to 17 conditions per place. [2025-02-08 05:37:17,673 INFO L140 encePairwiseOnDemand]: 324/344 looper letters, 24 selfloop transitions, 38 changer transitions 0/335 dead transitions. [2025-02-08 05:37:17,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 328 places, 335 transitions, 982 flow [2025-02-08 05:37:17,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:37:17,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:37:17,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 5268 transitions. [2025-02-08 05:37:17,681 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9008207934336525 [2025-02-08 05:37:17,681 INFO L175 Difference]: Start difference. First operand has 312 places, 315 transitions, 762 flow. Second operand 17 states and 5268 transitions. [2025-02-08 05:37:17,681 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 328 places, 335 transitions, 982 flow [2025-02-08 05:37:17,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 328 places, 335 transitions, 982 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:17,685 INFO L231 Difference]: Finished difference. Result has 331 places, 329 transitions, 946 flow [2025-02-08 05:37:17,686 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=762, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=946, PETRI_PLACES=331, PETRI_TRANSITIONS=329} [2025-02-08 05:37:17,686 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 15 predicate places. [2025-02-08 05:37:17,686 INFO L471 AbstractCegarLoop]: Abstraction has has 331 places, 329 transitions, 946 flow [2025-02-08 05:37:17,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 308.59090909090907) internal successors, (6789), 22 states have internal predecessors, (6789), 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-08 05:37:17,688 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:17,689 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:17,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:37:17,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:37:17,889 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:17,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1278097851, now seen corresponding path program 2 times [2025-02-08 05:37:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:17,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024270002] [2025-02-08 05:37:17,890 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:37:17,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:17,922 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 278 statements into 2 equivalence classes. [2025-02-08 05:37:17,925 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 278 statements. [2025-02-08 05:37:17,926 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:37:17,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:18,260 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:18,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:18,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024270002] [2025-02-08 05:37:18,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024270002] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:18,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:18,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:18,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13099709] [2025-02-08 05:37:18,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:18,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:18,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:18,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:18,261 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:18,598 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:18,599 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 331 places, 329 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 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-08 05:37:18,599 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:18,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:18,599 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:18,730 INFO L124 PetriNetUnfolderBase]: 61/838 cut-off events. [2025-02-08 05:37:18,730 INFO L125 PetriNetUnfolderBase]: For 87/89 co-relation queries the response was YES. [2025-02-08 05:37:18,733 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1185 conditions, 838 events. 61/838 cut-off events. For 87/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3601 event pairs, 3 based on Foata normal form. 0/777 useless extension candidates. Maximal degree in co-relation 781. Up to 64 conditions per place. [2025-02-08 05:37:18,735 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/332 dead transitions. [2025-02-08 05:37:18,735 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 334 places, 332 transitions, 1019 flow [2025-02-08 05:37:18,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:18,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:18,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2025-02-08 05:37:18,738 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055232558139535 [2025-02-08 05:37:18,738 INFO L175 Difference]: Start difference. First operand has 331 places, 329 transitions, 946 flow. Second operand 6 states and 1869 transitions. [2025-02-08 05:37:18,738 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 334 places, 332 transitions, 1019 flow [2025-02-08 05:37:18,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 326 places, 332 transitions, 967 flow, removed 8 selfloop flow, removed 8 redundant places. [2025-02-08 05:37:18,743 INFO L231 Difference]: Finished difference. Result has 326 places, 327 transitions, 900 flow [2025-02-08 05:37:18,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=890, PETRI_DIFFERENCE_MINUEND_PLACES=321, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=322, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=900, PETRI_PLACES=326, PETRI_TRANSITIONS=327} [2025-02-08 05:37:18,745 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 10 predicate places. [2025-02-08 05:37:18,746 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 327 transitions, 900 flow [2025-02-08 05:37:18,746 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 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-08 05:37:18,746 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:18,747 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:18,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:37:18,747 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:18,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash -64526617, now seen corresponding path program 1 times [2025-02-08 05:37:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:18,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268382551] [2025-02-08 05:37:18,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:18,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:18,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 280 statements into 1 equivalence classes. [2025-02-08 05:37:18,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 280 of 280 statements. [2025-02-08 05:37:18,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:18,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:19,355 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-02-08 05:37:19,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:19,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268382551] [2025-02-08 05:37:19,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268382551] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:19,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:19,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:19,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377267197] [2025-02-08 05:37:19,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:19,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:19,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:19,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:19,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:19,674 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:19,675 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 327 transitions, 900 flow. Second operand has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 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-08 05:37:19,675 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:19,675 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:19,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:19,799 INFO L124 PetriNetUnfolderBase]: 41/860 cut-off events. [2025-02-08 05:37:19,800 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2025-02-08 05:37:19,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1197 conditions, 860 events. 41/860 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3522 event pairs, 2 based on Foata normal form. 0/808 useless extension candidates. Maximal degree in co-relation 925. Up to 64 conditions per place. [2025-02-08 05:37:19,805 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 27 selfloop transitions, 5 changer transitions 0/331 dead transitions. [2025-02-08 05:37:19,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 329 places, 331 transitions, 978 flow [2025-02-08 05:37:19,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:19,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:19,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1870 transitions. [2025-02-08 05:37:19,808 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9060077519379846 [2025-02-08 05:37:19,808 INFO L175 Difference]: Start difference. First operand has 326 places, 327 transitions, 900 flow. Second operand 6 states and 1870 transitions. [2025-02-08 05:37:19,808 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 329 places, 331 transitions, 978 flow [2025-02-08 05:37:19,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 331 transitions, 968 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:19,813 INFO L231 Difference]: Finished difference. Result has 324 places, 325 transitions, 896 flow [2025-02-08 05:37:19,813 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=896, PETRI_PLACES=324, PETRI_TRANSITIONS=325} [2025-02-08 05:37:19,814 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 8 predicate places. [2025-02-08 05:37:19,814 INFO L471 AbstractCegarLoop]: Abstraction has has 324 places, 325 transitions, 896 flow [2025-02-08 05:37:19,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 308.8333333333333) internal successors, (1853), 6 states have internal predecessors, (1853), 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-08 05:37:19,814 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:19,815 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:19,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:37:19,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err5ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:19,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:19,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1109270431, now seen corresponding path program 1 times [2025-02-08 05:37:19,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:19,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359611547] [2025-02-08 05:37:19,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:19,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:19,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 286 statements into 1 equivalence classes. [2025-02-08 05:37:19,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 286 of 286 statements. [2025-02-08 05:37:19,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:19,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,406 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:20,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359611547] [2025-02-08 05:37:20,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359611547] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:37:20,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007846290] [2025-02-08 05:37:20,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:37:20,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,407 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:37:20,407 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:37:20,740 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 306 out of 344 [2025-02-08 05:37:20,741 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 324 places, 325 transitions, 896 flow. Second operand has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 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-08 05:37:20,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,741 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 306 of 344 [2025-02-08 05:37:20,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:20,867 INFO L124 PetriNetUnfolderBase]: 68/893 cut-off events. [2025-02-08 05:37:20,867 INFO L125 PetriNetUnfolderBase]: For 103/106 co-relation queries the response was YES. [2025-02-08 05:37:20,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1244 conditions, 893 events. 68/893 cut-off events. For 103/106 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3977 event pairs, 5 based on Foata normal form. 0/833 useless extension candidates. Maximal degree in co-relation 864. Up to 73 conditions per place. [2025-02-08 05:37:20,872 INFO L140 encePairwiseOnDemand]: 337/344 looper letters, 26 selfloop transitions, 5 changer transitions 0/328 dead transitions. [2025-02-08 05:37:20,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 328 transitions, 969 flow [2025-02-08 05:37:20,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:37:20,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:37:20,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1869 transitions. [2025-02-08 05:37:20,876 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055232558139535 [2025-02-08 05:37:20,876 INFO L175 Difference]: Start difference. First operand has 324 places, 325 transitions, 896 flow. Second operand 6 states and 1869 transitions. [2025-02-08 05:37:20,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 328 transitions, 969 flow [2025-02-08 05:37:20,878 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 328 transitions, 959 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:20,880 INFO L231 Difference]: Finished difference. Result has 322 places, 323 transitions, 892 flow [2025-02-08 05:37:20,881 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=882, PETRI_DIFFERENCE_MINUEND_PLACES=317, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=323, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=318, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=892, PETRI_PLACES=322, PETRI_TRANSITIONS=323} [2025-02-08 05:37:20,881 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 6 predicate places. [2025-02-08 05:37:20,881 INFO L471 AbstractCegarLoop]: Abstraction has has 322 places, 323 transitions, 892 flow [2025-02-08 05:37:20,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 309.0) internal successors, (1854), 6 states have internal predecessors, (1854), 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-08 05:37:20,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:20,882 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:20,882 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:37:20,882 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:20,883 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:20,883 INFO L85 PathProgramCache]: Analyzing trace with hash 1763241983, now seen corresponding path program 1 times [2025-02-08 05:37:20,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:20,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1845147350] [2025-02-08 05:37:20,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:20,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:20,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-02-08 05:37:20,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-02-08 05:37:20,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:20,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:20,952 INFO L134 CoverageAnalysis]: Checked inductivity of 311 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-02-08 05:37:20,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:20,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1845147350] [2025-02-08 05:37:20,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1845147350] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:20,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:20,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:20,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851165692] [2025-02-08 05:37:20,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:20,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:20,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:20,954 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:20,954 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:20,964 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344 [2025-02-08 05:37:20,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 322 places, 323 transitions, 892 flow. Second operand has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-08 05:37:20,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:20,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344 [2025-02-08 05:37:20,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,040 INFO L124 PetriNetUnfolderBase]: 34/746 cut-off events. [2025-02-08 05:37:21,040 INFO L125 PetriNetUnfolderBase]: For 63/66 co-relation queries the response was YES. [2025-02-08 05:37:21,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 978 conditions, 746 events. 34/746 cut-off events. For 63/66 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2658 event pairs, 2 based on Foata normal form. 0/712 useless extension candidates. Maximal degree in co-relation 754. Up to 27 conditions per place. [2025-02-08 05:37:21,044 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 8 selfloop transitions, 2 changer transitions 0/323 dead transitions. [2025-02-08 05:37:21,044 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 323 places, 323 transitions, 913 flow [2025-02-08 05:37:21,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 983 transitions. [2025-02-08 05:37:21,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9525193798449613 [2025-02-08 05:37:21,046 INFO L175 Difference]: Start difference. First operand has 322 places, 323 transitions, 892 flow. Second operand 3 states and 983 transitions. [2025-02-08 05:37:21,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 323 places, 323 transitions, 913 flow [2025-02-08 05:37:21,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 318 places, 323 transitions, 903 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:37:21,053 INFO L231 Difference]: Finished difference. Result has 318 places, 322 transitions, 884 flow [2025-02-08 05:37:21,053 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=880, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=322, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=884, PETRI_PLACES=318, PETRI_TRANSITIONS=322} [2025-02-08 05:37:21,054 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 2 predicate places. [2025-02-08 05:37:21,054 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 322 transitions, 884 flow [2025-02-08 05:37:21,058 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.3333333333333) internal successors, (976), 3 states have internal predecessors, (976), 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-08 05:37:21,058 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,058 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:21,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:37:21,058 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:21,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1050969855, now seen corresponding path program 1 times [2025-02-08 05:37:21,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4732743] [2025-02-08 05:37:21,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 294 statements into 1 equivalence classes. [2025-02-08 05:37:21,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 294 of 294 statements. [2025-02-08 05:37:21,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,130 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:21,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4732743] [2025-02-08 05:37:21,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4732743] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871601155] [2025-02-08 05:37:21,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,138 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344 [2025-02-08 05:37:21,139 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 322 transitions, 884 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08 05:37:21,140 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,140 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344 [2025-02-08 05:37:21,140 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,219 INFO L124 PetriNetUnfolderBase]: 33/723 cut-off events. [2025-02-08 05:37:21,219 INFO L125 PetriNetUnfolderBase]: For 66/68 co-relation queries the response was YES. [2025-02-08 05:37:21,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 928 conditions, 723 events. 33/723 cut-off events. For 66/68 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2404 event pairs, 1 based on Foata normal form. 0/693 useless extension candidates. Maximal degree in co-relation 861. Up to 17 conditions per place. [2025-02-08 05:37:21,225 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 6 selfloop transitions, 1 changer transitions 0/321 dead transitions. [2025-02-08 05:37:21,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 319 places, 321 transitions, 896 flow [2025-02-08 05:37:21,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 986 transitions. [2025-02-08 05:37:21,229 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9554263565891473 [2025-02-08 05:37:21,229 INFO L175 Difference]: Start difference. First operand has 318 places, 322 transitions, 884 flow. Second operand 3 states and 986 transitions. [2025-02-08 05:37:21,229 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 319 places, 321 transitions, 896 flow [2025-02-08 05:37:21,231 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 321 transitions, 892 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:37:21,233 INFO L231 Difference]: Finished difference. Result has 317 places, 321 transitions, 880 flow [2025-02-08 05:37:21,233 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=878, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=321, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=880, PETRI_PLACES=317, PETRI_TRANSITIONS=321} [2025-02-08 05:37:21,234 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-02-08 05:37:21,234 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 321 transitions, 880 flow [2025-02-08 05:37:21,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08 05:37:21,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,234 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:21,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:37:21,235 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:21,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 664728112, now seen corresponding path program 1 times [2025-02-08 05:37:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160220638] [2025-02-08 05:37:21,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-02-08 05:37:21,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-02-08 05:37:21,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,297 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2025-02-08 05:37:21,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160220638] [2025-02-08 05:37:21,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160220638] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886382533] [2025-02-08 05:37:21,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,304 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 344 [2025-02-08 05:37:21,304 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 321 transitions, 880 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08 05:37:21,304 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 344 [2025-02-08 05:37:21,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,367 INFO L124 PetriNetUnfolderBase]: 33/716 cut-off events. [2025-02-08 05:37:21,367 INFO L125 PetriNetUnfolderBase]: For 63/65 co-relation queries the response was YES. [2025-02-08 05:37:21,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 913 conditions, 716 events. 33/716 cut-off events. For 63/65 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2372 event pairs, 1 based on Foata normal form. 2/687 useless extension candidates. Maximal degree in co-relation 889. Up to 18 conditions per place. [2025-02-08 05:37:21,371 INFO L140 encePairwiseOnDemand]: 342/344 looper letters, 4 selfloop transitions, 0 changer transitions 4/320 dead transitions. [2025-02-08 05:37:21,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 318 places, 320 transitions, 890 flow [2025-02-08 05:37:21,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 985 transitions. [2025-02-08 05:37:21,373 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9544573643410853 [2025-02-08 05:37:21,373 INFO L175 Difference]: Start difference. First operand has 317 places, 321 transitions, 880 flow. Second operand 3 states and 985 transitions. [2025-02-08 05:37:21,373 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 318 places, 320 transitions, 890 flow [2025-02-08 05:37:21,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 320 transitions, 889 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:37:21,378 INFO L231 Difference]: Finished difference. Result has 317 places, 316 transitions, 867 flow [2025-02-08 05:37:21,378 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=877, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=320, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=867, PETRI_PLACES=317, PETRI_TRANSITIONS=316} [2025-02-08 05:37:21,379 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, 1 predicate places. [2025-02-08 05:37:21,379 INFO L471 AbstractCegarLoop]: Abstraction has has 317 places, 316 transitions, 867 flow [2025-02-08 05:37:21,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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-08 05:37:21,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:37:21,379 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 05:37:21,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:37:21,380 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE (and 50 more)] === [2025-02-08 05:37:21,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:37:21,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1989077926, now seen corresponding path program 1 times [2025-02-08 05:37:21,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:37:21,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252502071] [2025-02-08 05:37:21,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:37:21,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:37:21,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-08 05:37:21,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-08 05:37:21,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:37:21,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:37:21,446 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-02-08 05:37:21,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:37:21,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252502071] [2025-02-08 05:37:21,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252502071] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:37:21,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:37:21,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:37:21,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575828508] [2025-02-08 05:37:21,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:37:21,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:37:21,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:37:21,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:37:21,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:37:21,454 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 324 out of 344 [2025-02-08 05:37:21,455 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 317 places, 316 transitions, 867 flow. Second operand has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 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-08 05:37:21,455 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:37:21,455 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 324 of 344 [2025-02-08 05:37:21,455 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:37:21,509 INFO L124 PetriNetUnfolderBase]: 38/715 cut-off events. [2025-02-08 05:37:21,510 INFO L125 PetriNetUnfolderBase]: For 69/71 co-relation queries the response was YES. [2025-02-08 05:37:21,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 923 conditions, 715 events. 38/715 cut-off events. For 69/71 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2363 event pairs, 2 based on Foata normal form. 0/685 useless extension candidates. Maximal degree in co-relation 909. Up to 21 conditions per place. [2025-02-08 05:37:21,512 INFO L140 encePairwiseOnDemand]: 341/344 looper letters, 0 selfloop transitions, 0 changer transitions 316/316 dead transitions. [2025-02-08 05:37:21,512 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 312 places, 316 transitions, 884 flow [2025-02-08 05:37:21,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:37:21,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:37:21,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 981 transitions. [2025-02-08 05:37:21,514 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9505813953488372 [2025-02-08 05:37:21,514 INFO L175 Difference]: Start difference. First operand has 317 places, 316 transitions, 867 flow. Second operand 3 states and 981 transitions. [2025-02-08 05:37:21,514 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 312 places, 316 transitions, 884 flow [2025-02-08 05:37:21,516 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 312 places, 316 transitions, 884 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:37:21,517 INFO L231 Difference]: Finished difference. Result has 312 places, 0 transitions, 0 flow [2025-02-08 05:37:21,517 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=344, PETRI_DIFFERENCE_MINUEND_FLOW=865, PETRI_DIFFERENCE_MINUEND_PLACES=310, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=315, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=315, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=312, PETRI_TRANSITIONS=0} [2025-02-08 05:37:21,518 INFO L279 CegarLoopForPetriNet]: 316 programPoint places, -4 predicate places. [2025-02-08 05:37:21,518 INFO L471 AbstractCegarLoop]: Abstraction has has 312 places, 0 transitions, 0 flow [2025-02-08 05:37:21,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 325.6666666666667) internal successors, (977), 3 states have internal predecessors, (977), 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-08 05:37:21,520 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (53 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (52 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (51 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (50 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (49 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (48 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (47 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (46 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (45 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (44 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (43 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (42 of 54 remaining) [2025-02-08 05:37:21,521 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (41 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (39 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (38 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (37 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (36 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (35 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (34 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (33 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (32 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (31 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (30 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (29 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (28 of 54 remaining) [2025-02-08 05:37:21,522 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (27 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (26 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (25 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (24 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (21 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (20 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (19 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (18 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (17 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (16 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (15 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (14 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (13 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (11 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (1 of 54 remaining) [2025-02-08 05:37:21,523 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (0 of 54 remaining) [2025-02-08 05:37:21,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:37:21,524 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:37:21,527 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:37:21,527 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:37:21,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:37:21 BasicIcfg [2025-02-08 05:37:21,534 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:37:21,535 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:37:21,535 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:37:21,535 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:37:21,536 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:37:10" (3/4) ... [2025-02-08 05:37:21,537 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-08 05:37:21,539 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-08 05:37:21,539 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-08 05:37:21,542 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2025-02-08 05:37:21,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-08 05:37:21,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-08 05:37:21,543 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-08 05:37:21,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:37:21,623 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:37:21,623 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:37:21,624 INFO L158 Benchmark]: Toolchain (without parser) took 11964.29ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 113.6MB in the beginning and 184.5MB in the end (delta: -71.0MB). Peak memory consumption was 250.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:21,624 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:21,624 INFO L158 Benchmark]: CACSL2BoogieTranslator took 191.14ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:21,625 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.64ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:37:21,625 INFO L158 Benchmark]: Boogie Preprocessor took 32.13ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:21,625 INFO L158 Benchmark]: IcfgBuilder took 513.53ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 66.3MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:21,625 INFO L158 Benchmark]: TraceAbstraction took 11081.71ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.8MB in the beginning and 188.7MB in the end (delta: -122.9MB). Peak memory consumption was 208.2MB. Max. memory is 16.1GB. [2025-02-08 05:37:21,625 INFO L158 Benchmark]: Witness Printer took 88.73ms. Allocated memory is still 469.8MB. Free memory was 188.7MB in the beginning and 184.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:37:21,626 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 191.14ms. Allocated memory is still 142.6MB. Free memory was 113.1MB in the beginning and 100.4MB in the end (delta: 12.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.64ms. Allocated memory is still 142.6MB. Free memory was 100.4MB in the beginning and 97.7MB in the end (delta: 2.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.13ms. Allocated memory is still 142.6MB. Free memory was 97.7MB in the beginning and 95.7MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 513.53ms. Allocated memory is still 142.6MB. Free memory was 95.7MB in the beginning and 66.3MB in the end (delta: 29.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 11081.71ms. Allocated memory was 142.6MB in the beginning and 469.8MB in the end (delta: 327.2MB). Free memory was 65.8MB in the beginning and 188.7MB in the end (delta: -122.9MB). Peak memory consumption was 208.2MB. Max. memory is 16.1GB. * Witness Printer took 88.73ms. Allocated memory is still 469.8MB. Free memory was 188.7MB in the beginning and 184.5MB in the end (delta: 4.2MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 69]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 104]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 82]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 83]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 92]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 488 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 10.9s, OverallIterations: 20, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2549 SdHoareTripleChecker+Valid, 2.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1653 mSDsluCounter, 1050 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 770 mSDsCounter, 593 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4210 IncrementalHoareTripleChecker+Invalid, 4803 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 593 mSolverCounterUnsat, 280 mSDtfsCounter, 4210 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 837 GetRequests, 740 SyntacticMatches, 5 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=946occurred in iteration=13, InterpolantAutomatonStates: 99, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 3994 NumberOfCodeBlocks, 3754 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 4340 ConstructedInterpolants, 0 QuantifiedInterpolants, 6127 SizeOfPredicates, 14 NumberOfNonLiveVariables, 840 ConjunctsInSsa, 16 ConjunctsInUnsatCore, 24 InterpolantComputations, 18 PerfectInterpolantSequences, 2517/2664 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-08 05:37:21,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE