./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.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 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:32:03,002 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:32:03,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:32:03,078 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:32:03,079 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:32:03,100 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:32:03,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:32:03,101 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:32:03,101 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:32:03,101 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:32:03,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:32:03,101 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:32:03,101 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:32:03,102 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:32:03,102 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:32:03,103 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:32:03,103 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:32:03,103 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:32:03,103 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:32:03,103 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:32:03,103 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:03,104 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:32:03,104 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:32:03,104 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 -> 613bf9314e4e3fb6e64527ec38c7e6b39400e524de37a5103e9f06d9db406d3d [2025-02-06 09:32:03,418 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:32:03,427 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:32:03,431 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:32:03,433 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:32:03,433 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:32:03,434 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-02-06 09:32:04,786 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8a292649/c782a0e64a154426b592ee71c2e72ada/FLAG9cc5fd4d7 [2025-02-06 09:32:05,131 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:32:05,134 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/popl20-more-queue-add-2-nl.wvr.c [2025-02-06 09:32:05,144 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8a292649/c782a0e64a154426b592ee71c2e72ada/FLAG9cc5fd4d7 [2025-02-06 09:32:05,390 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b8a292649/c782a0e64a154426b592ee71c2e72ada [2025-02-06 09:32:05,392 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:32:05,393 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:32:05,395 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:05,395 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:32:05,398 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:32:05,399 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,400 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@601179c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05, skipping insertion in model container [2025-02-06 09:32:05,401 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,419 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:32:05,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:05,625 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:32:05,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:32:05,677 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:32:05,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05 WrapperNode [2025-02-06 09:32:05,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:32:05,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:05,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:32:05,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:32:05,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,696 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,720 INFO L138 Inliner]: procedures = 24, calls = 30, calls flagged for inlining = 13, calls inlined = 13, statements flattened = 322 [2025-02-06 09:32:05,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:32:05,722 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:32:05,722 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:32:05,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:32:05,728 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,728 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,731 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,742 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,743 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,745 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,745 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,748 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:32:05,749 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:32:05,749 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:32:05,749 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:32:05,749 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (1/1) ... [2025-02-06 09:32:05,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:32:05,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:32:05,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 09:32:05,795 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 09:32:05,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:32:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:32:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:32:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:32:05,812 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:32:05,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:32:05,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:32:05,813 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:32:05,814 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:32:05,900 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:32:05,902 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:32:06,444 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:32:06,444 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:32:06,690 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:32:06,690 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:32:06,690 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:06 BoogieIcfgContainer [2025-02-06 09:32:06,690 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:32:06,697 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:32:06,697 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:32:06,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:32:06,702 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:32:05" (1/3) ... [2025-02-06 09:32:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bf8f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:06, skipping insertion in model container [2025-02-06 09:32:06,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:32:05" (2/3) ... [2025-02-06 09:32:06,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@42bf8f6d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:32:06, skipping insertion in model container [2025-02-06 09:32:06,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:06" (3/3) ... [2025-02-06 09:32:06,705 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-more-queue-add-2-nl.wvr.c [2025-02-06 09:32:06,721 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:32:06,722 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-more-queue-add-2-nl.wvr.c that has 3 procedures, 272 locations, 1 initial locations, 3 loop locations, and 53 error locations. [2025-02-06 09:32:06,722 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:32:06,842 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-06 09:32:06,888 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 278 places, 281 transitions, 576 flow [2025-02-06 09:32:06,978 INFO L124 PetriNetUnfolderBase]: 10/279 cut-off events. [2025-02-06 09:32:06,982 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:32:06,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 288 conditions, 279 events. 10/279 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 489 event pairs, 0 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 197. Up to 2 conditions per place. [2025-02-06 09:32:06,989 INFO L82 GeneralOperation]: Start removeDead. Operand has 278 places, 281 transitions, 576 flow [2025-02-06 09:32:06,996 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 258 places, 259 transitions, 530 flow [2025-02-06 09:32:07,002 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:32:07,016 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;@1a03cfa2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:32:07,016 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2025-02-06 09:32:07,025 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:32:07,025 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-06 09:32:07,025 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:32:07,025 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:07,026 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] [2025-02-06 09:32:07,026 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1018313002, now seen corresponding path program 1 times [2025-02-06 09:32:07,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [442217727] [2025-02-06 09:32:07,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:07,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:07,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-06 09:32:07,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-06 09:32:07,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:07,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:07,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:07,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:07,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [442217727] [2025-02-06 09:32:07,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [442217727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:07,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:07,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:07,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682344286] [2025-02-06 09:32:07,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:07,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:07,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:07,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:07,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:07,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 281 [2025-02-06 09:32:07,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 259 transitions, 530 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:07,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 281 [2025-02-06 09:32:07,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:07,455 INFO L124 PetriNetUnfolderBase]: 25/391 cut-off events. [2025-02-06 09:32:07,456 INFO L125 PetriNetUnfolderBase]: For 16/17 co-relation queries the response was YES. [2025-02-06 09:32:07,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 391 events. 25/391 cut-off events. For 16/17 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1207 event pairs, 14 based on Foata normal form. 15/342 useless extension candidates. Maximal degree in co-relation 289. Up to 48 conditions per place. [2025-02-06 09:32:07,464 INFO L140 encePairwiseOnDemand]: 247/281 looper letters, 13 selfloop transitions, 2 changer transitions 3/227 dead transitions. [2025-02-06 09:32:07,467 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 227 transitions, 496 flow [2025-02-06 09:32:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:07,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:07,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 740 transitions. [2025-02-06 09:32:07,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8778173190984578 [2025-02-06 09:32:07,484 INFO L175 Difference]: Start difference. First operand has 258 places, 259 transitions, 530 flow. Second operand 3 states and 740 transitions. [2025-02-06 09:32:07,484 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 227 transitions, 496 flow [2025-02-06 09:32:07,490 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 229 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-02-06 09:32:07,495 INFO L231 Difference]: Finished difference. Result has 229 places, 224 transitions, 456 flow [2025-02-06 09:32:07,498 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=458, PETRI_DIFFERENCE_MINUEND_PLACES=227, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=225, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=456, PETRI_PLACES=229, PETRI_TRANSITIONS=224} [2025-02-06 09:32:07,502 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -29 predicate places. [2025-02-06 09:32:07,502 INFO L471 AbstractCegarLoop]: Abstraction has has 229 places, 224 transitions, 456 flow [2025-02-06 09:32:07,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,503 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:07,503 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] [2025-02-06 09:32:07,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:32:07,503 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:07,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:07,504 INFO L85 PathProgramCache]: Analyzing trace with hash 2004305409, now seen corresponding path program 1 times [2025-02-06 09:32:07,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:07,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774721656] [2025-02-06 09:32:07,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:07,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:07,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-02-06 09:32:07,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-02-06 09:32:07,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:07,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:07,572 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:07,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:07,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774721656] [2025-02-06 09:32:07,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774721656] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:07,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:07,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:07,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523328502] [2025-02-06 09:32:07,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:07,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:07,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:07,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:07,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:07,606 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 281 [2025-02-06 09:32:07,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 229 places, 224 transitions, 456 flow. Second operand has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:07,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 281 [2025-02-06 09:32:07,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:07,700 INFO L124 PetriNetUnfolderBase]: 12/307 cut-off events. [2025-02-06 09:32:07,700 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:32:07,703 INFO L83 FinitePrefix]: Finished finitePrefix Result has 348 conditions, 307 events. 12/307 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 746 event pairs, 7 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 316. Up to 30 conditions per place. [2025-02-06 09:32:07,707 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 13 selfloop transitions, 2 changer transitions 0/223 dead transitions. [2025-02-06 09:32:07,707 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 227 places, 223 transitions, 484 flow [2025-02-06 09:32:07,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:07,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:07,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2025-02-06 09:32:07,710 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410438908659549 [2025-02-06 09:32:07,710 INFO L175 Difference]: Start difference. First operand has 229 places, 224 transitions, 456 flow. Second operand 3 states and 709 transitions. [2025-02-06 09:32:07,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 227 places, 223 transitions, 484 flow [2025-02-06 09:32:07,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 225 places, 223 transitions, 480 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:07,718 INFO L231 Difference]: Finished difference. Result has 225 places, 223 transitions, 454 flow [2025-02-06 09:32:07,720 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=223, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=225, PETRI_TRANSITIONS=223} [2025-02-06 09:32:07,720 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -33 predicate places. [2025-02-06 09:32:07,721 INFO L471 AbstractCegarLoop]: Abstraction has has 225 places, 223 transitions, 454 flow [2025-02-06 09:32:07,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.33333333333334) internal successors, (697), 3 states have internal predecessors, (697), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,721 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:07,721 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] [2025-02-06 09:32:07,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:32:07,722 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:07,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:07,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1795026044, now seen corresponding path program 1 times [2025-02-06 09:32:07,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:07,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430905430] [2025-02-06 09:32:07,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:07,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:07,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 40 statements into 1 equivalence classes. [2025-02-06 09:32:07,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 40 of 40 statements. [2025-02-06 09:32:07,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:07,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:07,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:07,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:07,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430905430] [2025-02-06 09:32:07,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430905430] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:07,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:07,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:07,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199846357] [2025-02-06 09:32:07,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:07,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:07,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:07,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:07,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-02-06 09:32:07,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 225 places, 223 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:07,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-02-06 09:32:07,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:07,862 INFO L124 PetriNetUnfolderBase]: 14/341 cut-off events. [2025-02-06 09:32:07,862 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-06 09:32:07,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 378 conditions, 341 events. 14/341 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 752 event pairs, 5 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 338. Up to 27 conditions per place. [2025-02-06 09:32:07,866 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 11 selfloop transitions, 2 changer transitions 0/222 dead transitions. [2025-02-06 09:32:07,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 222 transitions, 478 flow [2025-02-06 09:32:07,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:07,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-02-06 09:32:07,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457888493475683 [2025-02-06 09:32:07,869 INFO L175 Difference]: Start difference. First operand has 225 places, 223 transitions, 454 flow. Second operand 3 states and 713 transitions. [2025-02-06 09:32:07,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 222 transitions, 478 flow [2025-02-06 09:32:07,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 222 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:07,876 INFO L231 Difference]: Finished difference. Result has 224 places, 222 transitions, 452 flow [2025-02-06 09:32:07,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=222, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=222, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=452, PETRI_PLACES=224, PETRI_TRANSITIONS=222} [2025-02-06 09:32:07,877 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -34 predicate places. [2025-02-06 09:32:07,877 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 222 transitions, 452 flow [2025-02-06 09:32:07,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:07,878 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] [2025-02-06 09:32:07,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:32:07,878 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:07,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:07,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1965853964, now seen corresponding path program 1 times [2025-02-06 09:32:07,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:07,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016983327] [2025-02-06 09:32:07,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:07,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:07,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-06 09:32:07,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-06 09:32:07,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:07,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:07,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:07,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016983327] [2025-02-06 09:32:07,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016983327] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:07,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:07,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:07,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14172240] [2025-02-06 09:32:07,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:07,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:07,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:07,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:07,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:07,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-02-06 09:32:07,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 222 transitions, 452 flow. Second operand has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:07,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:07,977 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-02-06 09:32:07,977 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,039 INFO L124 PetriNetUnfolderBase]: 14/340 cut-off events. [2025-02-06 09:32:08,039 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2025-02-06 09:32:08,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377 conditions, 340 events. 14/340 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 748 event pairs, 5 based on Foata normal form. 0/290 useless extension candidates. Maximal degree in co-relation 329. Up to 27 conditions per place. [2025-02-06 09:32:08,042 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 11 selfloop transitions, 2 changer transitions 0/221 dead transitions. [2025-02-06 09:32:08,042 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 225 places, 221 transitions, 476 flow [2025-02-06 09:32:08,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 713 transitions. [2025-02-06 09:32:08,044 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457888493475683 [2025-02-06 09:32:08,044 INFO L175 Difference]: Start difference. First operand has 224 places, 222 transitions, 452 flow. Second operand 3 states and 713 transitions. [2025-02-06 09:32:08,044 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 225 places, 221 transitions, 476 flow [2025-02-06 09:32:08,045 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 221 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:08,048 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 450 flow [2025-02-06 09:32:08,048 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-02-06 09:32:08,048 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2025-02-06 09:32:08,049 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 450 flow [2025-02-06 09:32:08,049 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.33333333333334) internal successors, (703), 3 states have internal predecessors, (703), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,049 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,050 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] [2025-02-06 09:32:08,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:32:08,050 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:08,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,050 INFO L85 PathProgramCache]: Analyzing trace with hash 1051158997, now seen corresponding path program 1 times [2025-02-06 09:32:08,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749553395] [2025-02-06 09:32:08,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-06 09:32:08,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-06 09:32:08,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749553395] [2025-02-06 09:32:08,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [749553395] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991043306] [2025-02-06 09:32:08,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-02-06 09:32:08,108 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,108 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,108 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-02-06 09:32:08,108 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,167 INFO L124 PetriNetUnfolderBase]: 15/349 cut-off events. [2025-02-06 09:32:08,167 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2025-02-06 09:32:08,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 386 conditions, 349 events. 15/349 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 797 event pairs, 2 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 330. Up to 16 conditions per place. [2025-02-06 09:32:08,170 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 12 selfloop transitions, 2 changer transitions 0/224 dead transitions. [2025-02-06 09:32:08,170 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 224 transitions, 485 flow [2025-02-06 09:32:08,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-02-06 09:32:08,172 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-02-06 09:32:08,172 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 450 flow. Second operand 3 states and 726 transitions. [2025-02-06 09:32:08,172 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 224 transitions, 485 flow [2025-02-06 09:32:08,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 224 transitions, 481 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:08,177 INFO L231 Difference]: Finished difference. Result has 223 places, 221 transitions, 454 flow [2025-02-06 09:32:08,177 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=444, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=221} [2025-02-06 09:32:08,178 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2025-02-06 09:32:08,178 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 221 transitions, 454 flow [2025-02-06 09:32:08,178 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,178 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,178 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] [2025-02-06 09:32:08,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:32:08,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:08,179 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,179 INFO L85 PathProgramCache]: Analyzing trace with hash 1738623598, now seen corresponding path program 1 times [2025-02-06 09:32:08,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530734920] [2025-02-06 09:32:08,179 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,186 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:32:08,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:32:08,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530734920] [2025-02-06 09:32:08,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530734920] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521440763] [2025-02-06 09:32:08,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:32:08,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 221 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:32:08,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,354 INFO L124 PetriNetUnfolderBase]: 15/343 cut-off events. [2025-02-06 09:32:08,354 INFO L125 PetriNetUnfolderBase]: For 12/13 co-relation queries the response was YES. [2025-02-06 09:32:08,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 394 conditions, 343 events. 15/343 cut-off events. For 12/13 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 762 event pairs, 5 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 185. Up to 29 conditions per place. [2025-02-06 09:32:08,358 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 11 selfloop transitions, 2 changer transitions 0/220 dead transitions. [2025-02-06 09:32:08,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 220 transitions, 478 flow [2025-02-06 09:32:08,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-02-06 09:32:08,360 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481613285883749 [2025-02-06 09:32:08,360 INFO L175 Difference]: Start difference. First operand has 223 places, 221 transitions, 454 flow. Second operand 3 states and 715 transitions. [2025-02-06 09:32:08,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 220 transitions, 478 flow [2025-02-06 09:32:08,362 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 223 places, 220 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:08,365 INFO L231 Difference]: Finished difference. Result has 223 places, 220 transitions, 454 flow [2025-02-06 09:32:08,366 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=221, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=454, PETRI_PLACES=223, PETRI_TRANSITIONS=220} [2025-02-06 09:32:08,367 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -35 predicate places. [2025-02-06 09:32:08,368 INFO L471 AbstractCegarLoop]: Abstraction has has 223 places, 220 transitions, 454 flow [2025-02-06 09:32:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,368 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] [2025-02-06 09:32:08,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:32:08,369 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:08,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,369 INFO L85 PathProgramCache]: Analyzing trace with hash -1969278220, now seen corresponding path program 1 times [2025-02-06 09:32:08,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045548904] [2025-02-06 09:32:08,370 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-02-06 09:32:08,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-02-06 09:32:08,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045548904] [2025-02-06 09:32:08,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045548904] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666916159] [2025-02-06 09:32:08,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,423 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,423 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,433 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-02-06 09:32:08,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 223 places, 220 transitions, 454 flow. Second operand has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-02-06 09:32:08,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,493 INFO L124 PetriNetUnfolderBase]: 15/342 cut-off events. [2025-02-06 09:32:08,494 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-06 09:32:08,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 342 events. 15/342 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 760 event pairs, 5 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 324. Up to 27 conditions per place. [2025-02-06 09:32:08,496 INFO L140 encePairwiseOnDemand]: 279/281 looper letters, 10 selfloop transitions, 1 changer transitions 0/219 dead transitions. [2025-02-06 09:32:08,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 224 places, 219 transitions, 474 flow [2025-02-06 09:32:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 722 transitions. [2025-02-06 09:32:08,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8564650059311981 [2025-02-06 09:32:08,499 INFO L175 Difference]: Start difference. First operand has 223 places, 220 transitions, 454 flow. Second operand 3 states and 722 transitions. [2025-02-06 09:32:08,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 224 places, 219 transitions, 474 flow [2025-02-06 09:32:08,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 219 transitions, 470 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:08,503 INFO L231 Difference]: Finished difference. Result has 222 places, 219 transitions, 450 flow [2025-02-06 09:32:08,504 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=448, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=219, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=450, PETRI_PLACES=222, PETRI_TRANSITIONS=219} [2025-02-06 09:32:08,505 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-02-06 09:32:08,506 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 219 transitions, 450 flow [2025-02-06 09:32:08,506 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 238.0) internal successors, (714), 3 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,506 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,506 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:08,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:32:08,507 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:08,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,507 INFO L85 PathProgramCache]: Analyzing trace with hash 486873700, now seen corresponding path program 1 times [2025-02-06 09:32:08,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744652632] [2025-02-06 09:32:08,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:32:08,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:32:08,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:08,584 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:08,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:08,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744652632] [2025-02-06 09:32:08,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744652632] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:08,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:08,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:08,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955082634] [2025-02-06 09:32:08,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:08,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:08,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:08,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:08,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:08,600 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:32:08,601 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 219 transitions, 450 flow. Second operand has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,601 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:08,601 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:32:08,601 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:08,659 INFO L124 PetriNetUnfolderBase]: 15/341 cut-off events. [2025-02-06 09:32:08,660 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-06 09:32:08,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 389 conditions, 341 events. 15/341 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 750 event pairs, 5 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 324. Up to 29 conditions per place. [2025-02-06 09:32:08,662 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 11 selfloop transitions, 2 changer transitions 0/218 dead transitions. [2025-02-06 09:32:08,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 218 transitions, 474 flow [2025-02-06 09:32:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 715 transitions. [2025-02-06 09:32:08,669 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8481613285883749 [2025-02-06 09:32:08,670 INFO L175 Difference]: Start difference. First operand has 222 places, 219 transitions, 450 flow. Second operand 3 states and 715 transitions. [2025-02-06 09:32:08,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 218 transitions, 474 flow [2025-02-06 09:32:08,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 222 places, 218 transitions, 473 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:08,675 INFO L231 Difference]: Finished difference. Result has 222 places, 218 transitions, 451 flow [2025-02-06 09:32:08,676 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=220, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=218, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=216, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=451, PETRI_PLACES=222, PETRI_TRANSITIONS=218} [2025-02-06 09:32:08,677 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -36 predicate places. [2025-02-06 09:32:08,677 INFO L471 AbstractCegarLoop]: Abstraction has has 222 places, 218 transitions, 451 flow [2025-02-06 09:32:08,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.33333333333334) internal successors, (706), 3 states have internal predecessors, (706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:08,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:08,679 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] [2025-02-06 09:32:08,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:32:08,679 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:08,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:08,680 INFO L85 PathProgramCache]: Analyzing trace with hash 919410607, now seen corresponding path program 1 times [2025-02-06 09:32:08,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:08,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750426056] [2025-02-06 09:32:08,680 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:08,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:08,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:32:08,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:32:08,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:08,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750426056] [2025-02-06 09:32:09,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750426056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:32:09,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286509666] [2025-02-06 09:32:09,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:32:09,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:32:09,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:32:09,390 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 281 [2025-02-06 09:32:09,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 222 places, 218 transitions, 451 flow. Second operand has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 281 [2025-02-06 09:32:09,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,472 INFO L124 PetriNetUnfolderBase]: 15/340 cut-off events. [2025-02-06 09:32:09,472 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2025-02-06 09:32:09,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 398 conditions, 340 events. 15/340 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 744 event pairs, 5 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 334. Up to 34 conditions per place. [2025-02-06 09:32:09,475 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 16 selfloop transitions, 5 changer transitions 0/217 dead transitions. [2025-02-06 09:32:09,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 217 transitions, 491 flow [2025-02-06 09:32:09,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:32:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:32:09,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1383 transitions. [2025-02-06 09:32:09,479 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8202846975088968 [2025-02-06 09:32:09,480 INFO L175 Difference]: Start difference. First operand has 222 places, 218 transitions, 451 flow. Second operand 6 states and 1383 transitions. [2025-02-06 09:32:09,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 217 transitions, 491 flow [2025-02-06 09:32:09,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 217 transitions, 487 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,484 INFO L231 Difference]: Finished difference. Result has 224 places, 217 transitions, 455 flow [2025-02-06 09:32:09,485 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=219, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=212, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=455, PETRI_PLACES=224, PETRI_TRANSITIONS=217} [2025-02-06 09:32:09,486 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -34 predicate places. [2025-02-06 09:32:09,486 INFO L471 AbstractCegarLoop]: Abstraction has has 224 places, 217 transitions, 455 flow [2025-02-06 09:32:09,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 228.5) internal successors, (1371), 6 states have internal predecessors, (1371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,487 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] [2025-02-06 09:32:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:32:09,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:09,489 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,489 INFO L85 PathProgramCache]: Analyzing trace with hash -2018535005, now seen corresponding path program 1 times [2025-02-06 09:32:09,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695305990] [2025-02-06 09:32:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:32:09,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:32:09,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695305990] [2025-02-06 09:32:09,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695305990] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1926902720] [2025-02-06 09:32:09,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,563 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 281 [2025-02-06 09:32:09,564 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 217 transitions, 455 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,565 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,565 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 281 [2025-02-06 09:32:09,565 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,615 INFO L124 PetriNetUnfolderBase]: 19/304 cut-off events. [2025-02-06 09:32:09,615 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:32:09,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 372 conditions, 304 events. 19/304 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 737 event pairs, 9 based on Foata normal form. 1/263 useless extension candidates. Maximal degree in co-relation 353. Up to 38 conditions per place. [2025-02-06 09:32:09,618 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 12 selfloop transitions, 1 changer transitions 2/214 dead transitions. [2025-02-06 09:32:09,618 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 214 transitions, 477 flow [2025-02-06 09:32:09,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 709 transitions. [2025-02-06 09:32:09,622 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8410438908659549 [2025-02-06 09:32:09,622 INFO L175 Difference]: Start difference. First operand has 224 places, 217 transitions, 455 flow. Second operand 3 states and 709 transitions. [2025-02-06 09:32:09,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 214 transitions, 477 flow [2025-02-06 09:32:09,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 214 transitions, 467 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:32:09,628 INFO L231 Difference]: Finished difference. Result has 218 places, 212 transitions, 437 flow [2025-02-06 09:32:09,630 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=216, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=437, PETRI_PLACES=218, PETRI_TRANSITIONS=212} [2025-02-06 09:32:09,631 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -40 predicate places. [2025-02-06 09:32:09,631 INFO L471 AbstractCegarLoop]: Abstraction has has 218 places, 212 transitions, 437 flow [2025-02-06 09:32:09,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,632 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,632 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-06 09:32:09,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:32:09,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err13ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:09,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,633 INFO L85 PathProgramCache]: Analyzing trace with hash -582140955, now seen corresponding path program 1 times [2025-02-06 09:32:09,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069325352] [2025-02-06 09:32:09,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-02-06 09:32:09,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-02-06 09:32:09,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069325352] [2025-02-06 09:32:09,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069325352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030632867] [2025-02-06 09:32:09,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,720 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 281 [2025-02-06 09:32:09,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 218 places, 212 transitions, 437 flow. Second operand has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 281 [2025-02-06 09:32:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,796 INFO L124 PetriNetUnfolderBase]: 33/398 cut-off events. [2025-02-06 09:32:09,796 INFO L125 PetriNetUnfolderBase]: For 23/26 co-relation queries the response was YES. [2025-02-06 09:32:09,797 INFO L83 FinitePrefix]: Finished finitePrefix Result has 498 conditions, 398 events. 33/398 cut-off events. For 23/26 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1331 event pairs, 8 based on Foata normal form. 1/347 useless extension candidates. Maximal degree in co-relation 434. Up to 38 conditions per place. [2025-02-06 09:32:09,800 INFO L140 encePairwiseOnDemand]: 273/281 looper letters, 14 selfloop transitions, 5 changer transitions 0/212 dead transitions. [2025-02-06 09:32:09,801 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 212 transitions, 480 flow [2025-02-06 09:32:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 710 transitions. [2025-02-06 09:32:09,803 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8422301304863582 [2025-02-06 09:32:09,803 INFO L175 Difference]: Start difference. First operand has 218 places, 212 transitions, 437 flow. Second operand 3 states and 710 transitions. [2025-02-06 09:32:09,803 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 212 transitions, 480 flow [2025-02-06 09:32:09,806 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 212 transitions, 479 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:09,810 INFO L231 Difference]: Finished difference. Result has 214 places, 209 transitions, 440 flow [2025-02-06 09:32:09,811 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=430, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=209, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=440, PETRI_PLACES=214, PETRI_TRANSITIONS=209} [2025-02-06 09:32:09,811 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -44 predicate places. [2025-02-06 09:32:09,811 INFO L471 AbstractCegarLoop]: Abstraction has has 214 places, 209 transitions, 440 flow [2025-02-06 09:32:09,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,812 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:09,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:09,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:32:09,812 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err12ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -1091680440, now seen corresponding path program 1 times [2025-02-06 09:32:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964625138] [2025-02-06 09:32:09,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:09,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-02-06 09:32:09,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-02-06 09:32:09,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:09,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:09,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:09,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:09,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964625138] [2025-02-06 09:32:09,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [964625138] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:09,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:09,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:09,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698721671] [2025-02-06 09:32:09,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:09,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:09,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:09,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:09,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:09,891 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 281 [2025-02-06 09:32:09,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 214 places, 209 transitions, 440 flow. Second operand has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:09,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:09,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 281 [2025-02-06 09:32:09,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:09,986 INFO L124 PetriNetUnfolderBase]: 54/492 cut-off events. [2025-02-06 09:32:09,987 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-06 09:32:09,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647 conditions, 492 events. 54/492 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1910 event pairs, 10 based on Foata normal form. 0/442 useless extension candidates. Maximal degree in co-relation 582. Up to 87 conditions per place. [2025-02-06 09:32:09,991 INFO L140 encePairwiseOnDemand]: 275/281 looper letters, 19 selfloop transitions, 3 changer transitions 0/213 dead transitions. [2025-02-06 09:32:09,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 213 transitions, 495 flow [2025-02-06 09:32:09,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:09,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:09,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-02-06 09:32:09,993 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505338078291815 [2025-02-06 09:32:09,993 INFO L175 Difference]: Start difference. First operand has 214 places, 209 transitions, 440 flow. Second operand 3 states and 717 transitions. [2025-02-06 09:32:09,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 213 transitions, 495 flow [2025-02-06 09:32:09,996 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 213 transitions, 485 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:09,998 INFO L231 Difference]: Finished difference. Result has 212 places, 209 transitions, 445 flow [2025-02-06 09:32:09,998 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=424, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=209} [2025-02-06 09:32:10,000 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2025-02-06 09:32:10,001 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 209 transitions, 445 flow [2025-02-06 09:32:10,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.66666666666666) internal successors, (698), 3 states have internal predecessors, (698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,001 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,001 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] [2025-02-06 09:32:10,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:32:10,002 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err15ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,002 INFO L85 PathProgramCache]: Analyzing trace with hash 2089570819, now seen corresponding path program 1 times [2025-02-06 09:32:10,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527662949] [2025-02-06 09:32:10,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-06 09:32:10,017 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-06 09:32:10,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,049 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527662949] [2025-02-06 09:32:10,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527662949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,050 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751789283] [2025-02-06 09:32:10,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,072 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-02-06 09:32:10,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 209 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-02-06 09:32:10,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,160 INFO L124 PetriNetUnfolderBase]: 78/560 cut-off events. [2025-02-06 09:32:10,160 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-02-06 09:32:10,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 745 conditions, 560 events. 78/560 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2444 event pairs, 29 based on Foata normal form. 0/491 useless extension candidates. Maximal degree in co-relation 681. Up to 106 conditions per place. [2025-02-06 09:32:10,165 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 16 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2025-02-06 09:32:10,165 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 211 transitions, 486 flow [2025-02-06 09:32:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-02-06 09:32:10,167 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505338078291815 [2025-02-06 09:32:10,167 INFO L175 Difference]: Start difference. First operand has 212 places, 209 transitions, 445 flow. Second operand 3 states and 717 transitions. [2025-02-06 09:32:10,167 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 211 transitions, 486 flow [2025-02-06 09:32:10,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 213 places, 211 transitions, 486 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:32:10,172 INFO L231 Difference]: Finished difference. Result has 213 places, 208 transitions, 447 flow [2025-02-06 09:32:10,172 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=208, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=447, PETRI_PLACES=213, PETRI_TRANSITIONS=208} [2025-02-06 09:32:10,173 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -45 predicate places. [2025-02-06 09:32:10,173 INFO L471 AbstractCegarLoop]: Abstraction has has 213 places, 208 transitions, 447 flow [2025-02-06 09:32:10,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.66666666666666) internal successors, (704), 3 states have internal predecessors, (704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,174 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,174 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] [2025-02-06 09:32:10,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:32:10,174 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err11ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2045544947, now seen corresponding path program 1 times [2025-02-06 09:32:10,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765318195] [2025-02-06 09:32:10,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-02-06 09:32:10,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-02-06 09:32:10,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765318195] [2025-02-06 09:32:10,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765318195] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653207210] [2025-02-06 09:32:10,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,263 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 281 [2025-02-06 09:32:10,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 208 transitions, 447 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 281 [2025-02-06 09:32:10,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,329 INFO L124 PetriNetUnfolderBase]: 57/420 cut-off events. [2025-02-06 09:32:10,330 INFO L125 PetriNetUnfolderBase]: For 35/37 co-relation queries the response was YES. [2025-02-06 09:32:10,331 INFO L83 FinitePrefix]: Finished finitePrefix Result has 600 conditions, 420 events. 57/420 cut-off events. For 35/37 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1431 event pairs, 23 based on Foata normal form. 0/375 useless extension candidates. Maximal degree in co-relation 535. Up to 81 conditions per place. [2025-02-06 09:32:10,333 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 17 selfloop transitions, 2 changer transitions 0/210 dead transitions. [2025-02-06 09:32:10,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 210 transitions, 494 flow [2025-02-06 09:32:10,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-02-06 09:32:10,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8469750889679716 [2025-02-06 09:32:10,335 INFO L175 Difference]: Start difference. First operand has 213 places, 208 transitions, 447 flow. Second operand 3 states and 714 transitions. [2025-02-06 09:32:10,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 210 transitions, 494 flow [2025-02-06 09:32:10,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 210 transitions, 490 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:10,339 INFO L231 Difference]: Finished difference. Result has 212 places, 207 transitions, 445 flow [2025-02-06 09:32:10,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=441, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=205, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=445, PETRI_PLACES=212, PETRI_TRANSITIONS=207} [2025-02-06 09:32:10,341 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -46 predicate places. [2025-02-06 09:32:10,341 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 207 transitions, 445 flow [2025-02-06 09:32:10,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,342 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:10,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:32:10,342 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash -1384953393, now seen corresponding path program 1 times [2025-02-06 09:32:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396723806] [2025-02-06 09:32:10,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-06 09:32:10,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-06 09:32:10,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396723806] [2025-02-06 09:32:10,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396723806] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826558000] [2025-02-06 09:32:10,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,391 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 232 out of 281 [2025-02-06 09:32:10,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 207 transitions, 445 flow. Second operand has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,421 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 232 of 281 [2025-02-06 09:32:10,421 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,496 INFO L124 PetriNetUnfolderBase]: 57/417 cut-off events. [2025-02-06 09:32:10,496 INFO L125 PetriNetUnfolderBase]: For 38/43 co-relation queries the response was YES. [2025-02-06 09:32:10,497 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 417 events. 57/417 cut-off events. For 38/43 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 1428 event pairs, 23 based on Foata normal form. 1/376 useless extension candidates. Maximal degree in co-relation 534. Up to 81 conditions per place. [2025-02-06 09:32:10,499 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 17 selfloop transitions, 2 changer transitions 0/209 dead transitions. [2025-02-06 09:32:10,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 209 transitions, 492 flow [2025-02-06 09:32:10,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 714 transitions. [2025-02-06 09:32:10,501 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8469750889679716 [2025-02-06 09:32:10,501 INFO L175 Difference]: Start difference. First operand has 212 places, 207 transitions, 445 flow. Second operand 3 states and 714 transitions. [2025-02-06 09:32:10,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 209 transitions, 492 flow [2025-02-06 09:32:10,504 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 209 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:10,506 INFO L231 Difference]: Finished difference. Result has 211 places, 206 transitions, 443 flow [2025-02-06 09:32:10,507 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=439, PETRI_DIFFERENCE_MINUEND_PLACES=209, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=206, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=443, PETRI_PLACES=211, PETRI_TRANSITIONS=206} [2025-02-06 09:32:10,507 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -47 predicate places. [2025-02-06 09:32:10,507 INFO L471 AbstractCegarLoop]: Abstraction has has 211 places, 206 transitions, 443 flow [2025-02-06 09:32:10,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 234.0) internal successors, (702), 3 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,508 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,508 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:10,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:32:10,508 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,509 INFO L85 PathProgramCache]: Analyzing trace with hash -1571005939, now seen corresponding path program 1 times [2025-02-06 09:32:10,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739239215] [2025-02-06 09:32:10,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-02-06 09:32:10,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-02-06 09:32:10,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,560 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739239215] [2025-02-06 09:32:10,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739239215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764521623] [2025-02-06 09:32:10,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-02-06 09:32:10,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 206 transitions, 443 flow. Second operand has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-02-06 09:32:10,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,681 INFO L124 PetriNetUnfolderBase]: 60/519 cut-off events. [2025-02-06 09:32:10,681 INFO L125 PetriNetUnfolderBase]: For 25/26 co-relation queries the response was YES. [2025-02-06 09:32:10,683 INFO L83 FinitePrefix]: Finished finitePrefix Result has 681 conditions, 519 events. 60/519 cut-off events. For 25/26 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2130 event pairs, 19 based on Foata normal form. 1/478 useless extension candidates. Maximal degree in co-relation 616. Up to 65 conditions per place. [2025-02-06 09:32:10,684 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 13 selfloop transitions, 2 changer transitions 4/207 dead transitions. [2025-02-06 09:32:10,684 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 211 places, 207 transitions, 478 flow [2025-02-06 09:32:10,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-02-06 09:32:10,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493475682087782 [2025-02-06 09:32:10,686 INFO L175 Difference]: Start difference. First operand has 211 places, 206 transitions, 443 flow. Second operand 3 states and 716 transitions. [2025-02-06 09:32:10,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 211 places, 207 transitions, 478 flow [2025-02-06 09:32:10,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 207 transitions, 474 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:10,690 INFO L231 Difference]: Finished difference. Result has 209 places, 200 transitions, 431 flow [2025-02-06 09:32:10,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=431, PETRI_PLACES=209, PETRI_TRANSITIONS=200} [2025-02-06 09:32:10,691 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -49 predicate places. [2025-02-06 09:32:10,691 INFO L471 AbstractCegarLoop]: Abstraction has has 209 places, 200 transitions, 431 flow [2025-02-06 09:32:10,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.0) internal successors, (705), 3 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,693 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] [2025-02-06 09:32:10,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:32:10,693 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash 185881807, now seen corresponding path program 1 times [2025-02-06 09:32:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390877051] [2025-02-06 09:32:10,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-06 09:32:10,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-06 09:32:10,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:10,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:10,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390877051] [2025-02-06 09:32:10,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390877051] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:10,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:10,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:10,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199953160] [2025-02-06 09:32:10,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:10,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:10,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:10,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:10,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:10,768 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 281 [2025-02-06 09:32:10,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 200 transitions, 431 flow. Second operand has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,769 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:10,769 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 281 [2025-02-06 09:32:10,769 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:10,855 INFO L124 PetriNetUnfolderBase]: 76/524 cut-off events. [2025-02-06 09:32:10,855 INFO L125 PetriNetUnfolderBase]: For 32/33 co-relation queries the response was YES. [2025-02-06 09:32:10,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 721 conditions, 524 events. 76/524 cut-off events. For 32/33 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 2342 event pairs, 29 based on Foata normal form. 0/484 useless extension candidates. Maximal degree in co-relation 656. Up to 95 conditions per place. [2025-02-06 09:32:10,859 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 15 selfloop transitions, 2 changer transitions 0/202 dead transitions. [2025-02-06 09:32:10,859 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 470 flow [2025-02-06 09:32:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:10,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:10,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 716 transitions. [2025-02-06 09:32:10,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8493475682087782 [2025-02-06 09:32:10,861 INFO L175 Difference]: Start difference. First operand has 209 places, 200 transitions, 431 flow. Second operand 3 states and 716 transitions. [2025-02-06 09:32:10,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 470 flow [2025-02-06 09:32:10,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 466 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:10,865 INFO L231 Difference]: Finished difference. Result has 204 places, 199 transitions, 429 flow [2025-02-06 09:32:10,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=429, PETRI_PLACES=204, PETRI_TRANSITIONS=199} [2025-02-06 09:32:10,867 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2025-02-06 09:32:10,867 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 199 transitions, 429 flow [2025-02-06 09:32:10,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 235.66666666666666) internal successors, (707), 3 states have internal predecessors, (707), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:10,867 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:10,867 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] [2025-02-06 09:32:10,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:32:10,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:10,868 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:10,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1393015148, now seen corresponding path program 1 times [2025-02-06 09:32:10,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:10,868 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969448636] [2025-02-06 09:32:10,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:10,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:10,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-02-06 09:32:10,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-02-06 09:32:10,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:10,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969448636] [2025-02-06 09:32:11,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969448636] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:32:11,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262396274] [2025-02-06 09:32:11,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,084 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 281 [2025-02-06 09:32:11,085 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 199 transitions, 429 flow. Second operand has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 281 [2025-02-06 09:32:11,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,141 INFO L124 PetriNetUnfolderBase]: 24/384 cut-off events. [2025-02-06 09:32:11,141 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:32:11,142 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 384 events. 24/384 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1047 event pairs, 3 based on Foata normal form. 1/359 useless extension candidates. Maximal degree in co-relation 414. Up to 34 conditions per place. [2025-02-06 09:32:11,143 INFO L140 encePairwiseOnDemand]: 277/281 looper letters, 12 selfloop transitions, 3 changer transitions 0/202 dead transitions. [2025-02-06 09:32:11,143 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 202 transitions, 466 flow [2025-02-06 09:32:11,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 726 transitions. [2025-02-06 09:32:11,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8612099644128114 [2025-02-06 09:32:11,146 INFO L175 Difference]: Start difference. First operand has 204 places, 199 transitions, 429 flow. Second operand 3 states and 726 transitions. [2025-02-06 09:32:11,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 202 transitions, 466 flow [2025-02-06 09:32:11,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 462 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:11,150 INFO L231 Difference]: Finished difference. Result has 205 places, 201 transitions, 444 flow [2025-02-06 09:32:11,150 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=425, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=444, PETRI_PLACES=205, PETRI_TRANSITIONS=201} [2025-02-06 09:32:11,151 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -53 predicate places. [2025-02-06 09:32:11,151 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 201 transitions, 444 flow [2025-02-06 09:32:11,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.33333333333334) internal successors, (718), 3 states have internal predecessors, (718), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,151 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:11,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:32:11,151 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:11,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1384281410, now seen corresponding path program 1 times [2025-02-06 09:32:11,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928852082] [2025-02-06 09:32:11,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,165 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-06 09:32:11,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-06 09:32:11,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:11,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928852082] [2025-02-06 09:32:11,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928852082] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:11,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769072548] [2025-02-06 09:32:11,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,210 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:32:11,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 201 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:32:11,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,292 INFO L124 PetriNetUnfolderBase]: 43/403 cut-off events. [2025-02-06 09:32:11,292 INFO L125 PetriNetUnfolderBase]: For 53/59 co-relation queries the response was YES. [2025-02-06 09:32:11,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 555 conditions, 403 events. 43/403 cut-off events. For 53/59 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1273 event pairs, 8 based on Foata normal form. 1/385 useless extension candidates. Maximal degree in co-relation 488. Up to 43 conditions per place. [2025-02-06 09:32:11,295 INFO L140 encePairwiseOnDemand]: 276/281 looper letters, 13 selfloop transitions, 2 changer transitions 4/202 dead transitions. [2025-02-06 09:32:11,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 205 places, 202 transitions, 485 flow [2025-02-06 09:32:11,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 718 transitions. [2025-02-06 09:32:11,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8517200474495848 [2025-02-06 09:32:11,297 INFO L175 Difference]: Start difference. First operand has 205 places, 201 transitions, 444 flow. Second operand 3 states and 718 transitions. [2025-02-06 09:32:11,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 205 places, 202 transitions, 485 flow [2025-02-06 09:32:11,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 202 transitions, 482 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:32:11,302 INFO L231 Difference]: Finished difference. Result has 204 places, 195 transitions, 432 flow [2025-02-06 09:32:11,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=437, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=199, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=432, PETRI_PLACES=204, PETRI_TRANSITIONS=195} [2025-02-06 09:32:11,302 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -54 predicate places. [2025-02-06 09:32:11,302 INFO L471 AbstractCegarLoop]: Abstraction has has 204 places, 195 transitions, 432 flow [2025-02-06 09:32:11,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.0) internal successors, (708), 3 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,303 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:32:11,303 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] [2025-02-06 09:32:11,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:32:11,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err22ASSERT_VIOLATIONDATA_RACE, thread1Err10ASSERT_VIOLATIONDATA_RACE, thread1Err9ASSERT_VIOLATIONDATA_RACE, thread1Err8ASSERT_VIOLATIONDATA_RACE (and 90 more)] === [2025-02-06 09:32:11,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:32:11,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1484128837, now seen corresponding path program 1 times [2025-02-06 09:32:11,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:32:11,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941291703] [2025-02-06 09:32:11,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:32:11,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:32:11,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-02-06 09:32:11,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-02-06 09:32:11,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:32:11,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:32:11,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:32:11,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:32:11,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941291703] [2025-02-06 09:32:11,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941291703] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:32:11,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:32:11,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:32:11,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936411882] [2025-02-06 09:32:11,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:32:11,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:32:11,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:32:11,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:32:11,368 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:32:11,380 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 234 out of 281 [2025-02-06 09:32:11,382 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 204 places, 195 transitions, 432 flow. Second operand has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,382 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:32:11,382 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 234 of 281 [2025-02-06 09:32:11,382 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:32:11,469 INFO L124 PetriNetUnfolderBase]: 45/396 cut-off events. [2025-02-06 09:32:11,470 INFO L125 PetriNetUnfolderBase]: For 60/66 co-relation queries the response was YES. [2025-02-06 09:32:11,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 566 conditions, 396 events. 45/396 cut-off events. For 60/66 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1241 event pairs, 12 based on Foata normal form. 0/382 useless extension candidates. Maximal degree in co-relation 499. Up to 64 conditions per place. [2025-02-06 09:32:11,472 INFO L140 encePairwiseOnDemand]: 278/281 looper letters, 0 selfloop transitions, 0 changer transitions 197/197 dead transitions. [2025-02-06 09:32:11,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 197 transitions, 475 flow [2025-02-06 09:32:11,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:32:11,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:32:11,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 717 transitions. [2025-02-06 09:32:11,475 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505338078291815 [2025-02-06 09:32:11,475 INFO L175 Difference]: Start difference. First operand has 204 places, 195 transitions, 432 flow. Second operand 3 states and 717 transitions. [2025-02-06 09:32:11,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 197 transitions, 475 flow [2025-02-06 09:32:11,477 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 197 transitions, 471 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:32:11,478 INFO L231 Difference]: Finished difference. Result has 199 places, 0 transitions, 0 flow [2025-02-06 09:32:11,478 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=426, PETRI_DIFFERENCE_MINUEND_PLACES=197, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=194, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=199, PETRI_TRANSITIONS=0} [2025-02-06 09:32:11,479 INFO L279 CegarLoopForPetriNet]: 258 programPoint places, -59 predicate places. [2025-02-06 09:32:11,479 INFO L471 AbstractCegarLoop]: Abstraction has has 199 places, 0 transitions, 0 flow [2025-02-06 09:32:11,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 236.66666666666666) internal successors, (710), 3 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-06 09:32:11,482 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (93 of 94 remaining) [2025-02-06 09:32:11,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (92 of 94 remaining) [2025-02-06 09:32:11,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (91 of 94 remaining) [2025-02-06 09:32:11,483 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (90 of 94 remaining) [2025-02-06 09:32:11,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (89 of 94 remaining) [2025-02-06 09:32:11,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (88 of 94 remaining) [2025-02-06 09:32:11,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (87 of 94 remaining) [2025-02-06 09:32:11,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (86 of 94 remaining) [2025-02-06 09:32:11,485 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (85 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (84 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (83 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (82 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (81 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (80 of 94 remaining) [2025-02-06 09:32:11,486 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (79 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (78 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (77 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (76 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (75 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (74 of 94 remaining) [2025-02-06 09:32:11,487 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (73 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (72 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (71 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (70 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (69 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (68 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (67 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (66 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (65 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (64 of 94 remaining) [2025-02-06 09:32:11,488 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (63 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (62 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (61 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (60 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (59 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (58 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (57 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (56 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (55 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (54 of 94 remaining) [2025-02-06 09:32:11,489 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (53 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (52 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (51 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (50 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (49 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (48 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (47 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (46 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (45 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (44 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (43 of 94 remaining) [2025-02-06 09:32:11,490 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (42 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (41 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err22ASSERT_VIOLATIONDATA_RACE (38 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err10ASSERT_VIOLATIONDATA_RACE (37 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err9ASSERT_VIOLATIONDATA_RACE (36 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (35 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (34 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (33 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (32 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (31 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (30 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err21ASSERT_VIOLATIONDATA_RACE (29 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err20ASSERT_VIOLATIONDATA_RACE (28 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err19ASSERT_VIOLATIONDATA_RACE (27 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err18ASSERT_VIOLATIONDATA_RACE (26 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err17ASSERT_VIOLATIONDATA_RACE (25 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err16ASSERT_VIOLATIONDATA_RACE (24 of 94 remaining) [2025-02-06 09:32:11,491 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err15ASSERT_VIOLATIONDATA_RACE (23 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err14ASSERT_VIOLATIONDATA_RACE (22 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (21 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err13ASSERT_VIOLATIONDATA_RACE (20 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (19 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err12ASSERT_VIOLATIONDATA_RACE (18 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (17 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err11ASSERT_VIOLATIONDATA_RACE (16 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err15ASSERT_VIOLATIONDATA_RACE (15 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err14ASSERT_VIOLATIONDATA_RACE (14 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err13ASSERT_VIOLATIONDATA_RACE (13 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err12ASSERT_VIOLATIONDATA_RACE (12 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err11ASSERT_VIOLATIONDATA_RACE (11 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err10ASSERT_VIOLATIONDATA_RACE (10 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err9ASSERT_VIOLATIONDATA_RACE (9 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 94 remaining) [2025-02-06 09:32:11,492 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (7 of 94 remaining) [2025-02-06 09:32:11,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (6 of 94 remaining) [2025-02-06 09:32:11,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (5 of 94 remaining) [2025-02-06 09:32:11,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (4 of 94 remaining) [2025-02-06 09:32:11,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (3 of 94 remaining) [2025-02-06 09:32:11,493 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (2 of 94 remaining) [2025-02-06 09:32:11,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (1 of 94 remaining) [2025-02-06 09:32:11,494 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (0 of 94 remaining) [2025-02-06 09:32:11,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-06 09:32:11,494 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:32:11,500 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:32:11,500 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:32:11,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:32:11 BasicIcfg [2025-02-06 09:32:11,506 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:32:11,506 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:32:11,507 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:32:11,507 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:32:11,507 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:32:06" (3/4) ... [2025-02-06 09:32:11,509 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:32:11,511 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:32:11,511 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:32:11,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 17 nodes and edges [2025-02-06 09:32:11,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:32:11,517 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-06 09:32:11,518 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:32:11,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:32:11,601 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:32:11,601 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:32:11,602 INFO L158 Benchmark]: Toolchain (without parser) took 6208.45ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 133.1MB in the beginning and 188.5MB in the end (delta: -55.4MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,602 INFO L158 Benchmark]: CDTParser took 0.82ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:11,602 INFO L158 Benchmark]: CACSL2BoogieTranslator took 284.18ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 120.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,603 INFO L158 Benchmark]: Boogie Preprocessor took 26.35ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 116.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:32:11,603 INFO L158 Benchmark]: IcfgBuilder took 941.94ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 51.9MB in the end (delta: 64.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,603 INFO L158 Benchmark]: TraceAbstraction took 4809.14ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 51.0MB in the beginning and 195.2MB in the end (delta: -144.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,603 INFO L158 Benchmark]: Witness Printer took 94.76ms. Allocated memory is still 251.7MB. Free memory was 195.2MB in the beginning and 188.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:32:11,605 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.82ms. Allocated memory is still 201.3MB. Free memory is still 128.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 284.18ms. Allocated memory is still 167.8MB. Free memory was 133.1MB in the beginning and 120.3MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 41.74ms. Allocated memory is still 167.8MB. Free memory was 120.3MB in the beginning and 117.7MB in the end (delta: 2.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.35ms. Allocated memory is still 167.8MB. Free memory was 117.7MB in the beginning and 116.3MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 941.94ms. Allocated memory is still 167.8MB. Free memory was 116.3MB in the beginning and 51.9MB in the end (delta: 64.5MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 4809.14ms. Allocated memory was 167.8MB in the beginning and 251.7MB in the end (delta: 83.9MB). Free memory was 51.0MB in the beginning and 195.2MB in the end (delta: -144.2MB). Peak memory consumption was 29.9MB. Max. memory is 16.1GB. * Witness Printer took 94.76ms. Allocated memory is still 251.7MB. Free memory was 195.2MB in the beginning and 188.5MB in the end (delta: 6.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 51]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 52]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 53]: 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: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 55]: 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: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 74]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 76]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 89]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 90]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 91]: 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: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 93]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 116]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 94]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 96]: 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: 104]: 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: 104]: 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, 374 locations, 94 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: 4.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 414 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 156 mSDsluCounter, 79 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 634 IncrementalHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 79 mSDtfsCounter, 634 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 45 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=530occurred in iteration=0, InterpolantAutomatonStates: 63, 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, 1.5s InterpolantComputationTime, 1799 NumberOfCodeBlocks, 1799 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 1779 ConstructedInterpolants, 0 QuantifiedInterpolants, 2060 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 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 53 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:32:11,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE