./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/bench-exp2x4.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/bench-exp2x4.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 f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:27:51,641 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:27:51,701 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:27:51,704 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:27:51,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:27:51,726 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:27:51,727 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:27:51,727 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:27:51,728 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:27:51,728 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:27:51,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:27:51,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:27:51,729 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:27:51,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:27:51,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:27:51,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:51,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:27:51,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:27:51,732 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:27:51,732 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:27:51,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:27:51,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:27:51,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:27:51,732 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 -> f64e270e7d8e8fe7bf3b7cd641a237e1a4059fd56c14ffbabdcef7751fd05704 [2025-02-06 09:27:51,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:27:51,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:27:51,964 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:27:51,965 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:27:51,965 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:27:51,967 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2025-02-06 09:27:53,144 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f84b02a0b/81697b6caa8045628e88d0d567bf13be/FLAG80d3f671c [2025-02-06 09:27:53,352 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:27:53,361 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/weaver/bench-exp2x4.wvr.c [2025-02-06 09:27:53,373 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f84b02a0b/81697b6caa8045628e88d0d567bf13be/FLAG80d3f671c [2025-02-06 09:27:53,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f84b02a0b/81697b6caa8045628e88d0d567bf13be [2025-02-06 09:27:53,716 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:27:53,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:27:53,718 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:53,718 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:27:53,721 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:27:53,721 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,722 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44fbf285 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53, skipping insertion in model container [2025-02-06 09:27:53,722 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,732 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:27:53,858 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:53,867 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:27:53,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:27:53,902 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:27:53,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53 WrapperNode [2025-02-06 09:27:53,903 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:27:53,904 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:53,905 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:27:53,905 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:27:53,909 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:27:53" (1/1) ... [2025-02-06 09:27:53,914 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:27:53" (1/1) ... [2025-02-06 09:27:53,928 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 129 [2025-02-06 09:27:53,929 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:27:53,930 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:27:53,930 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:27:53,930 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:27:53,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,941 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,941 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,949 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,950 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,951 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:27:53,957 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:27:53,957 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:27:53,957 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:27:53,958 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (1/1) ... [2025-02-06 09:27:53,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:27:53,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:27:53,991 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:27:53,994 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:27:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:27:54,013 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-06 09:27:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-06 09:27:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-02-06 09:27:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-02-06 09:27:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-02-06 09:27:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-02-06 09:27:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2025-02-06 09:27:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2025-02-06 09:27:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:27:54,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:27:54,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:27:54,015 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:27:54,097 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:27:54,099 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:27:54,422 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:27:54,422 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:27:54,441 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:27:54,441 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:27:54,442 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:54 BoogieIcfgContainer [2025-02-06 09:27:54,442 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:27:54,444 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:27:54,444 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:27:54,447 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:27:54,447 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:27:53" (1/3) ... [2025-02-06 09:27:54,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:54, skipping insertion in model container [2025-02-06 09:27:54,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:27:53" (2/3) ... [2025-02-06 09:27:54,448 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a2e560a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:27:54, skipping insertion in model container [2025-02-06 09:27:54,448 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:54" (3/3) ... [2025-02-06 09:27:54,449 INFO L128 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2025-02-06 09:27:54,459 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:27:54,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bench-exp2x4.wvr.c that has 5 procedures, 294 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2025-02-06 09:27:54,460 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:27:54,558 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-02-06 09:27:54,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 306 places, 307 transitions, 642 flow [2025-02-06 09:27:54,684 INFO L124 PetriNetUnfolderBase]: 14/303 cut-off events. [2025-02-06 09:27:54,686 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:27:54,692 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 303 events. 14/303 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 664 event pairs, 0 based on Foata normal form. 0/242 useless extension candidates. Maximal degree in co-relation 233. Up to 2 conditions per place. [2025-02-06 09:27:54,692 INFO L82 GeneralOperation]: Start removeDead. Operand has 306 places, 307 transitions, 642 flow [2025-02-06 09:27:54,697 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 284 places, 283 transitions, 590 flow [2025-02-06 09:27:54,703 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:27:54,714 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;@75c9cdb3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:27:54,714 INFO L334 AbstractCegarLoop]: Starting to check reachability of 83 error locations. [2025-02-06 09:27:54,724 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:27:54,724 INFO L124 PetriNetUnfolderBase]: 0/22 cut-off events. [2025-02-06 09:27:54,724 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:27:54,724 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:54,725 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:54,729 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:54,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:54,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1205272165, now seen corresponding path program 1 times [2025-02-06 09:27:54,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:54,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447317183] [2025-02-06 09:27:54,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:54,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:54,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-02-06 09:27:54,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-02-06 09:27:54,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:54,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:54,871 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:27:54,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:54,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447317183] [2025-02-06 09:27:54,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447317183] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:54,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:54,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:54,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073370664] [2025-02-06 09:27:54,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:54,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:54,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:54,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:54,895 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:54,965 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 307 [2025-02-06 09:27:54,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 284 places, 283 transitions, 590 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:27:54,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:54,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 307 [2025-02-06 09:27:54,971 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,084 INFO L124 PetriNetUnfolderBase]: 31/403 cut-off events. [2025-02-06 09:27:55,084 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2025-02-06 09:27:55,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 403 events. 31/403 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1630 event pairs, 21 based on Foata normal form. 55/375 useless extension candidates. Maximal degree in co-relation 389. Up to 67 conditions per place. [2025-02-06 09:27:55,090 INFO L140 encePairwiseOnDemand]: 299/307 looper letters, 21 selfloop transitions, 2 changer transitions 1/277 dead transitions. [2025-02-06 09:27:55,090 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 285 places, 277 transitions, 624 flow [2025-02-06 09:27:55,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 854 transitions. [2025-02-06 09:27:55,100 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9272529858849077 [2025-02-06 09:27:55,101 INFO L175 Difference]: Start difference. First operand has 284 places, 283 transitions, 590 flow. Second operand 3 states and 854 transitions. [2025-02-06 09:27:55,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 285 places, 277 transitions, 624 flow [2025-02-06 09:27:55,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 277 places, 277 transitions, 608 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-06 09:27:55,109 INFO L231 Difference]: Finished difference. Result has 277 places, 276 transitions, 564 flow [2025-02-06 09:27:55,110 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=277, PETRI_TRANSITIONS=276} [2025-02-06 09:27:55,113 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -7 predicate places. [2025-02-06 09:27:55,113 INFO L471 AbstractCegarLoop]: Abstraction has has 277 places, 276 transitions, 564 flow [2025-02-06 09:27:55,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:27:55,114 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,114 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] [2025-02-06 09:27:55,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:27:55,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,115 INFO L85 PathProgramCache]: Analyzing trace with hash 442275317, now seen corresponding path program 1 times [2025-02-06 09:27:55,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680641917] [2025-02-06 09:27:55,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-06 09:27:55,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-06 09:27:55,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,143 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:27:55,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680641917] [2025-02-06 09:27:55,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680641917] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930229360] [2025-02-06 09:27:55,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,194 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 307 [2025-02-06 09:27:55,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 277 places, 276 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:27:55,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 307 [2025-02-06 09:27:55,195 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,255 INFO L124 PetriNetUnfolderBase]: 31/401 cut-off events. [2025-02-06 09:27:55,255 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-02-06 09:27:55,258 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 401 events. 31/401 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 1598 event pairs, 21 based on Foata normal form. 0/320 useless extension candidates. Maximal degree in co-relation 461. Up to 66 conditions per place. [2025-02-06 09:27:55,261 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 20 selfloop transitions, 2 changer transitions 0/275 dead transitions. [2025-02-06 09:27:55,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 275 transitions, 606 flow [2025-02-06 09:27:55,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-06 09:27:55,266 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239956568946797 [2025-02-06 09:27:55,267 INFO L175 Difference]: Start difference. First operand has 277 places, 276 transitions, 564 flow. Second operand 3 states and 851 transitions. [2025-02-06 09:27:55,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 275 transitions, 606 flow [2025-02-06 09:27:55,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 275 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:55,271 INFO L231 Difference]: Finished difference. Result has 275 places, 275 transitions, 562 flow [2025-02-06 09:27:55,271 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=275, PETRI_TRANSITIONS=275} [2025-02-06 09:27:55,272 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -9 predicate places. [2025-02-06 09:27:55,272 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 275 transitions, 562 flow [2025-02-06 09:27:55,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:27:55,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,273 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] [2025-02-06 09:27:55,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:27:55,273 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,274 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,274 INFO L85 PathProgramCache]: Analyzing trace with hash 1788620760, now seen corresponding path program 1 times [2025-02-06 09:27:55,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527814874] [2025-02-06 09:27:55,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-02-06 09:27:55,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-02-06 09:27:55,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,302 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:27:55,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527814874] [2025-02-06 09:27:55,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527814874] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265049019] [2025-02-06 09:27:55,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,348 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 307 [2025-02-06 09:27:55,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 275 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:27:55,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 307 [2025-02-06 09:27:55,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,414 INFO L124 PetriNetUnfolderBase]: 31/373 cut-off events. [2025-02-06 09:27:55,415 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:27:55,416 INFO L83 FinitePrefix]: Finished finitePrefix Result has 457 conditions, 373 events. 31/373 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1357 event pairs, 21 based on Foata normal form. 0/303 useless extension candidates. Maximal degree in co-relation 420. Up to 67 conditions per place. [2025-02-06 09:27:55,418 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/274 dead transitions. [2025-02-06 09:27:55,419 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 274 transitions, 606 flow [2025-02-06 09:27:55,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 849 transitions. [2025-02-06 09:27:55,421 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9218241042345277 [2025-02-06 09:27:55,421 INFO L175 Difference]: Start difference. First operand has 275 places, 275 transitions, 562 flow. Second operand 3 states and 849 transitions. [2025-02-06 09:27:55,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 274 transitions, 606 flow [2025-02-06 09:27:55,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 274 transitions, 602 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:55,425 INFO L231 Difference]: Finished difference. Result has 274 places, 274 transitions, 560 flow [2025-02-06 09:27:55,425 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=556, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=274, PETRI_TRANSITIONS=274} [2025-02-06 09:27:55,426 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -10 predicate places. [2025-02-06 09:27:55,426 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 274 transitions, 560 flow [2025-02-06 09:27:55,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 276.3333333333333) internal successors, (829), 3 states have internal predecessors, (829), 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:27:55,426 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,427 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] [2025-02-06 09:27:55,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:27:55,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,427 INFO L85 PathProgramCache]: Analyzing trace with hash 1292009270, now seen corresponding path program 1 times [2025-02-06 09:27:55,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991238758] [2025-02-06 09:27:55,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-06 09:27:55,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-06 09:27:55,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,470 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:27:55,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991238758] [2025-02-06 09:27:55,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991238758] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228579769] [2025-02-06 09:27:55,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 276 out of 307 [2025-02-06 09:27:55,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 274 transitions, 560 flow. Second operand has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:27:55,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 276 of 307 [2025-02-06 09:27:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,556 INFO L124 PetriNetUnfolderBase]: 31/345 cut-off events. [2025-02-06 09:27:55,557 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2025-02-06 09:27:55,558 INFO L83 FinitePrefix]: Finished finitePrefix Result has 421 conditions, 345 events. 31/345 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1156 event pairs, 21 based on Foata normal form. 0/286 useless extension candidates. Maximal degree in co-relation 377. Up to 66 conditions per place. [2025-02-06 09:27:55,560 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 20 selfloop transitions, 2 changer transitions 0/273 dead transitions. [2025-02-06 09:27:55,560 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 273 transitions, 602 flow [2025-02-06 09:27:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 851 transitions. [2025-02-06 09:27:55,563 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9239956568946797 [2025-02-06 09:27:55,563 INFO L175 Difference]: Start difference. First operand has 274 places, 274 transitions, 560 flow. Second operand 3 states and 851 transitions. [2025-02-06 09:27:55,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 273 transitions, 602 flow [2025-02-06 09:27:55,564 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 273 transitions, 598 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:55,566 INFO L231 Difference]: Finished difference. Result has 273 places, 273 transitions, 558 flow [2025-02-06 09:27:55,567 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=558, PETRI_PLACES=273, PETRI_TRANSITIONS=273} [2025-02-06 09:27:55,567 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -11 predicate places. [2025-02-06 09:27:55,567 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 273 transitions, 558 flow [2025-02-06 09:27:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 277.3333333333333) internal successors, (832), 3 states have internal predecessors, (832), 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:27:55,568 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,568 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] [2025-02-06 09:27:55,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:27:55,568 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,569 INFO L85 PathProgramCache]: Analyzing trace with hash 723076156, now seen corresponding path program 1 times [2025-02-06 09:27:55,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446957830] [2025-02-06 09:27:55,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-06 09:27:55,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-06 09:27:55,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,618 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:27:55,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446957830] [2025-02-06 09:27:55,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446957830] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674133559] [2025-02-06 09:27:55,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,657 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 307 [2025-02-06 09:27:55,658 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 273 transitions, 558 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:27:55,658 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,658 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 307 [2025-02-06 09:27:55,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,839 INFO L124 PetriNetUnfolderBase]: 102/1390 cut-off events. [2025-02-06 09:27:55,839 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-02-06 09:27:55,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1555 conditions, 1390 events. 102/1390 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 10365 event pairs, 51 based on Foata normal form. 0/1052 useless extension candidates. Maximal degree in co-relation 1504. Up to 144 conditions per place. [2025-02-06 09:27:55,857 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 15 selfloop transitions, 2 changer transitions 0/272 dead transitions. [2025-02-06 09:27:55,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 272 transitions, 590 flow [2025-02-06 09:27:55,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 861 transitions. [2025-02-06 09:27:55,860 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9348534201954397 [2025-02-06 09:27:55,860 INFO L175 Difference]: Start difference. First operand has 273 places, 273 transitions, 558 flow. Second operand 3 states and 861 transitions. [2025-02-06 09:27:55,860 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 272 transitions, 590 flow [2025-02-06 09:27:55,861 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 272 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:55,863 INFO L231 Difference]: Finished difference. Result has 272 places, 272 transitions, 556 flow [2025-02-06 09:27:55,865 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=272, PETRI_TRANSITIONS=272} [2025-02-06 09:27:55,866 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -12 predicate places. [2025-02-06 09:27:55,867 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 272 transitions, 556 flow [2025-02-06 09:27:55,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:27:55,868 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,868 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:55,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:27:55,868 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1189560271, now seen corresponding path program 1 times [2025-02-06 09:27:55,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334575677] [2025-02-06 09:27:55,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:55,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-06 09:27:55,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-06 09:27:55,882 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:55,882 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:55,903 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:27:55,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:55,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334575677] [2025-02-06 09:27:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334575677] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738580131] [2025-02-06 09:27:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:55,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:55,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:55,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:55,938 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 307 [2025-02-06 09:27:55,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 272 transitions, 556 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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:27:55,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:55,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 307 [2025-02-06 09:27:55,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:55,986 INFO L124 PetriNetUnfolderBase]: 46/391 cut-off events. [2025-02-06 09:27:55,986 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:27:55,988 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 391 events. 46/391 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1702 event pairs, 30 based on Foata normal form. 0/333 useless extension candidates. Maximal degree in co-relation 481. Up to 88 conditions per place. [2025-02-06 09:27:55,990 INFO L140 encePairwiseOnDemand]: 294/307 looper letters, 26 selfloop transitions, 5 changer transitions 0/268 dead transitions. [2025-02-06 09:27:55,990 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 268 transitions, 613 flow [2025-02-06 09:27:55,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:55,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 834 transitions. [2025-02-06 09:27:55,991 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9055374592833876 [2025-02-06 09:27:55,992 INFO L175 Difference]: Start difference. First operand has 272 places, 272 transitions, 556 flow. Second operand 3 states and 834 transitions. [2025-02-06 09:27:55,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 268 transitions, 613 flow [2025-02-06 09:27:55,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 264 places, 268 transitions, 609 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:55,995 INFO L231 Difference]: Finished difference. Result has 265 places, 265 transitions, 555 flow [2025-02-06 09:27:55,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=262, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=265, PETRI_TRANSITIONS=265} [2025-02-06 09:27:55,996 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -19 predicate places. [2025-02-06 09:27:55,996 INFO L471 AbstractCegarLoop]: Abstraction has has 265 places, 265 transitions, 555 flow [2025-02-06 09:27:55,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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:27:55,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:55,997 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:27:55,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:27:55,997 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:55,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:55,998 INFO L85 PathProgramCache]: Analyzing trace with hash -706106923, now seen corresponding path program 1 times [2025-02-06 09:27:55,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:55,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814376823] [2025-02-06 09:27:55,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:55,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-02-06 09:27:56,004 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-02-06 09:27:56,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,018 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:27:56,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814376823] [2025-02-06 09:27:56,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814376823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176592607] [2025-02-06 09:27:56,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,019 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 307 [2025-02-06 09:27:56,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 265 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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:27:56,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,065 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 307 [2025-02-06 09:27:56,065 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,121 INFO L124 PetriNetUnfolderBase]: 46/385 cut-off events. [2025-02-06 09:27:56,121 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2025-02-06 09:27:56,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 385 events. 46/385 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1657 event pairs, 30 based on Foata normal form. 0/335 useless extension candidates. Maximal degree in co-relation 446. Up to 86 conditions per place. [2025-02-06 09:27:56,128 INFO L140 encePairwiseOnDemand]: 295/307 looper letters, 24 selfloop transitions, 5 changer transitions 0/262 dead transitions. [2025-02-06 09:27:56,128 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 260 places, 262 transitions, 610 flow [2025-02-06 09:27:56,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 840 transitions. [2025-02-06 09:27:56,131 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9120521172638436 [2025-02-06 09:27:56,131 INFO L175 Difference]: Start difference. First operand has 265 places, 265 transitions, 555 flow. Second operand 3 states and 840 transitions. [2025-02-06 09:27:56,131 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 260 places, 262 transitions, 610 flow [2025-02-06 09:27:56,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 262 transitions, 605 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:56,135 INFO L231 Difference]: Finished difference. Result has 260 places, 259 transitions, 555 flow [2025-02-06 09:27:56,135 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=536, PETRI_DIFFERENCE_MINUEND_PLACES=257, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=258, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=253, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=555, PETRI_PLACES=260, PETRI_TRANSITIONS=259} [2025-02-06 09:27:56,136 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -24 predicate places. [2025-02-06 09:27:56,136 INFO L471 AbstractCegarLoop]: Abstraction has has 260 places, 259 transitions, 555 flow [2025-02-06 09:27:56,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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:27:56,137 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,137 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:56,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:27:56,138 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 720252657, now seen corresponding path program 1 times [2025-02-06 09:27:56,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578111545] [2025-02-06 09:27:56,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-06 09:27:56,153 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-06 09:27:56,153 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,153 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,189 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:27:56,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578111545] [2025-02-06 09:27:56,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578111545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169158024] [2025-02-06 09:27:56,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,189 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,223 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 265 out of 307 [2025-02-06 09:27:56,226 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 260 places, 259 transitions, 555 flow. Second operand has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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:27:56,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,226 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 265 of 307 [2025-02-06 09:27:56,226 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,279 INFO L124 PetriNetUnfolderBase]: 54/534 cut-off events. [2025-02-06 09:27:56,279 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2025-02-06 09:27:56,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 698 conditions, 534 events. 54/534 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2660 event pairs, 21 based on Foata normal form. 0/474 useless extension candidates. Maximal degree in co-relation 593. Up to 92 conditions per place. [2025-02-06 09:27:56,284 INFO L140 encePairwiseOnDemand]: 293/307 looper letters, 29 selfloop transitions, 6 changer transitions 0/259 dead transitions. [2025-02-06 09:27:56,284 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 254 places, 259 transitions, 631 flow [2025-02-06 09:27:56,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 838 transitions. [2025-02-06 09:27:56,286 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9098805646036916 [2025-02-06 09:27:56,286 INFO L175 Difference]: Start difference. First operand has 260 places, 259 transitions, 555 flow. Second operand 3 states and 838 transitions. [2025-02-06 09:27:56,286 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 254 places, 259 transitions, 631 flow [2025-02-06 09:27:56,288 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 259 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:56,289 INFO L231 Difference]: Finished difference. Result has 254 places, 253 transitions, 560 flow [2025-02-06 09:27:56,290 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=534, PETRI_DIFFERENCE_MINUEND_PLACES=251, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=251, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=560, PETRI_PLACES=254, PETRI_TRANSITIONS=253} [2025-02-06 09:27:56,290 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -30 predicate places. [2025-02-06 09:27:56,290 INFO L471 AbstractCegarLoop]: Abstraction has has 254 places, 253 transitions, 560 flow [2025-02-06 09:27:56,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 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:27:56,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,291 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:56,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:27:56,291 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:56,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,292 INFO L85 PathProgramCache]: Analyzing trace with hash 673086587, now seen corresponding path program 1 times [2025-02-06 09:27:56,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658392645] [2025-02-06 09:27:56,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-02-06 09:27:56,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-02-06 09:27:56,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,332 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:27:56,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658392645] [2025-02-06 09:27:56,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658392645] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 09:27:56,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009610620] [2025-02-06 09:27:56,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 09:27:56,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 09:27:56,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 09:27:56,351 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 280 out of 307 [2025-02-06 09:27:56,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 254 places, 253 transitions, 560 flow. Second operand has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 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:27:56,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 280 of 307 [2025-02-06 09:27:56,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,403 INFO L124 PetriNetUnfolderBase]: 12/421 cut-off events. [2025-02-06 09:27:56,404 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:27:56,405 INFO L83 FinitePrefix]: Finished finitePrefix Result has 503 conditions, 421 events. 12/421 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1580 event pairs, 0 based on Foata normal form. 0/377 useless extension candidates. Maximal degree in co-relation 352. Up to 26 conditions per place. [2025-02-06 09:27:56,407 INFO L140 encePairwiseOnDemand]: 301/307 looper letters, 19 selfloop transitions, 5 changer transitions 0/258 dead transitions. [2025-02-06 09:27:56,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 258 places, 258 transitions, 618 flow [2025-02-06 09:27:56,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 09:27:56,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-02-06 09:27:56,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1425 transitions. [2025-02-06 09:27:56,410 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-02-06 09:27:56,410 INFO L175 Difference]: Start difference. First operand has 254 places, 253 transitions, 560 flow. Second operand 5 states and 1425 transitions. [2025-02-06 09:27:56,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 258 places, 258 transitions, 618 flow [2025-02-06 09:27:56,411 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 257 places, 258 transitions, 612 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:56,414 INFO L231 Difference]: Finished difference. Result has 261 places, 257 transitions, 592 flow [2025-02-06 09:27:56,414 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=554, PETRI_DIFFERENCE_MINUEND_PLACES=253, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=253, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=248, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=592, PETRI_PLACES=261, PETRI_TRANSITIONS=257} [2025-02-06 09:27:56,414 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -23 predicate places. [2025-02-06 09:27:56,414 INFO L471 AbstractCegarLoop]: Abstraction has has 261 places, 257 transitions, 592 flow [2025-02-06 09:27:56,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 281.25) internal successors, (1125), 4 states have internal predecessors, (1125), 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:27:56,415 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,415 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] [2025-02-06 09:27:56,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 09:27:56,415 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:56,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,416 INFO L85 PathProgramCache]: Analyzing trace with hash 2143408225, now seen corresponding path program 1 times [2025-02-06 09:27:56,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088881959] [2025-02-06 09:27:56,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-06 09:27:56,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-06 09:27:56,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,443 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:27:56,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088881959] [2025-02-06 09:27:56,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088881959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192427008] [2025-02-06 09:27:56,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,473 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 268 out of 307 [2025-02-06 09:27:56,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 261 places, 257 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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:27:56,475 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,475 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 268 of 307 [2025-02-06 09:27:56,475 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:56,570 INFO L124 PetriNetUnfolderBase]: 83/727 cut-off events. [2025-02-06 09:27:56,570 INFO L125 PetriNetUnfolderBase]: For 66/66 co-relation queries the response was YES. [2025-02-06 09:27:56,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 993 conditions, 727 events. 83/727 cut-off events. For 66/66 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 4195 event pairs, 10 based on Foata normal form. 1/671 useless extension candidates. Maximal degree in co-relation 703. Up to 140 conditions per place. [2025-02-06 09:27:56,576 INFO L140 encePairwiseOnDemand]: 295/307 looper letters, 25 selfloop transitions, 5 changer transitions 10/258 dead transitions. [2025-02-06 09:27:56,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 258 transitions, 665 flow [2025-02-06 09:27:56,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:56,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:56,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 843 transitions. [2025-02-06 09:27:56,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9153094462540716 [2025-02-06 09:27:56,579 INFO L175 Difference]: Start difference. First operand has 261 places, 257 transitions, 592 flow. Second operand 3 states and 843 transitions. [2025-02-06 09:27:56,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 258 transitions, 665 flow [2025-02-06 09:27:56,581 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 258 transitions, 665 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:56,583 INFO L231 Difference]: Finished difference. Result has 257 places, 241 transitions, 576 flow [2025-02-06 09:27:56,583 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=578, PETRI_DIFFERENCE_MINUEND_PLACES=254, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=245, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=576, PETRI_PLACES=257, PETRI_TRANSITIONS=241} [2025-02-06 09:27:56,583 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -27 predicate places. [2025-02-06 09:27:56,584 INFO L471 AbstractCegarLoop]: Abstraction has has 257 places, 241 transitions, 576 flow [2025-02-06 09:27:56,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 269.0) internal successors, (807), 3 states have internal predecessors, (807), 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:27:56,584 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:56,585 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] [2025-02-06 09:27:56,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:27:56,585 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:56,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:56,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1856803660, now seen corresponding path program 1 times [2025-02-06 09:27:56,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:56,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80391155] [2025-02-06 09:27:56,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:56,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:56,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-06 09:27:56,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-06 09:27:56,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:56,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:56,617 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:27:56,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:56,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80391155] [2025-02-06 09:27:56,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80391155] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:56,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:56,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:56,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806732653] [2025-02-06 09:27:56,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:56,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:56,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:56,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:56,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:56,633 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 279 out of 307 [2025-02-06 09:27:56,634 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 257 places, 241 transitions, 576 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:27:56,634 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:56,634 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 279 of 307 [2025-02-06 09:27:56,634 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,160 INFO L124 PetriNetUnfolderBase]: 746/5762 cut-off events. [2025-02-06 09:27:57,161 INFO L125 PetriNetUnfolderBase]: For 174/174 co-relation queries the response was YES. [2025-02-06 09:27:57,255 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7755 conditions, 5762 events. 746/5762 cut-off events. For 174/174 co-relation queries the response was YES. Maximal size of possible extension queue 206. Compared 64935 event pairs, 276 based on Foata normal form. 0/5098 useless extension candidates. Maximal degree in co-relation 5800. Up to 1027 conditions per place. [2025-02-06 09:27:57,270 INFO L140 encePairwiseOnDemand]: 299/307 looper letters, 19 selfloop transitions, 4 changer transitions 0/244 dead transitions. [2025-02-06 09:27:57,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 244 transitions, 631 flow [2025-02-06 09:27:57,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 864 transitions. [2025-02-06 09:27:57,272 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9381107491856677 [2025-02-06 09:27:57,272 INFO L175 Difference]: Start difference. First operand has 257 places, 241 transitions, 576 flow. Second operand 3 states and 864 transitions. [2025-02-06 09:27:57,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 244 transitions, 631 flow [2025-02-06 09:27:57,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 244 transitions, 626 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:27:57,281 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 591 flow [2025-02-06 09:27:57,282 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=563, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2025-02-06 09:27:57,283 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -39 predicate places. [2025-02-06 09:27:57,283 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 591 flow [2025-02-06 09:27:57,283 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:27:57,283 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,283 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:27:57,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 09:27:57,284 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:57,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,284 INFO L85 PathProgramCache]: Analyzing trace with hash -48064349, now seen corresponding path program 1 times [2025-02-06 09:27:57,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802486586] [2025-02-06 09:27:57,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-02-06 09:27:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-02-06 09:27:57,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,338 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:27:57,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802486586] [2025-02-06 09:27:57,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802486586] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463957583] [2025-02-06 09:27:57,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:57,386 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-02-06 09:27:57,387 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:27:57,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-02-06 09:27:57,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,528 INFO L124 PetriNetUnfolderBase]: 230/1820 cut-off events. [2025-02-06 09:27:57,529 INFO L125 PetriNetUnfolderBase]: For 47/59 co-relation queries the response was YES. [2025-02-06 09:27:57,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2630 conditions, 1820 events. 230/1820 cut-off events. For 47/59 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 15464 event pairs, 91 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 1755. Up to 213 conditions per place. [2025-02-06 09:27:57,549 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 22 selfloop transitions, 2 changer transitions 0/243 dead transitions. [2025-02-06 09:27:57,549 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 243 transitions, 646 flow [2025-02-06 09:27:57,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-06 09:27:57,551 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-02-06 09:27:57,551 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 591 flow. Second operand 3 states and 855 transitions. [2025-02-06 09:27:57,552 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 243 transitions, 646 flow [2025-02-06 09:27:57,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 243 transitions, 646 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:27:57,556 INFO L231 Difference]: Finished difference. Result has 246 places, 240 transitions, 593 flow [2025-02-06 09:27:57,557 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=240, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=238, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=593, PETRI_PLACES=246, PETRI_TRANSITIONS=240} [2025-02-06 09:27:57,557 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -38 predicate places. [2025-02-06 09:27:57,558 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 240 transitions, 593 flow [2025-02-06 09:27:57,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.0) internal successors, (840), 3 states have internal predecessors, (840), 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:27:57,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,559 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] [2025-02-06 09:27:57,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:27:57,559 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:57,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,560 INFO L85 PathProgramCache]: Analyzing trace with hash -785495872, now seen corresponding path program 1 times [2025-02-06 09:27:57,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912861072] [2025-02-06 09:27:57,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,565 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-06 09:27:57,571 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-06 09:27:57,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,617 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:27:57,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912861072] [2025-02-06 09:27:57,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912861072] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394658045] [2025-02-06 09:27:57,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:57,651 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-02-06 09:27:57,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 240 transitions, 593 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:27:57,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:57,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-02-06 09:27:57,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:57,893 INFO L124 PetriNetUnfolderBase]: 397/2305 cut-off events. [2025-02-06 09:27:57,895 INFO L125 PetriNetUnfolderBase]: For 185/193 co-relation queries the response was YES. [2025-02-06 09:27:57,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 2305 events. 397/2305 cut-off events. For 185/193 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 20768 event pairs, 200 based on Foata normal form. 0/2103 useless extension candidates. Maximal degree in co-relation 3541. Up to 526 conditions per place. [2025-02-06 09:27:57,919 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/242 dead transitions. [2025-02-06 09:27:57,919 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 242 transitions, 646 flow [2025-02-06 09:27:57,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:57,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:57,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-06 09:27:57,921 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-02-06 09:27:57,921 INFO L175 Difference]: Start difference. First operand has 246 places, 240 transitions, 593 flow. Second operand 3 states and 857 transitions. [2025-02-06 09:27:57,921 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 242 transitions, 646 flow [2025-02-06 09:27:57,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 242 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:57,926 INFO L231 Difference]: Finished difference. Result has 245 places, 239 transitions, 591 flow [2025-02-06 09:27:57,926 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=587, PETRI_DIFFERENCE_MINUEND_PLACES=243, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=239, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=237, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=591, PETRI_PLACES=245, PETRI_TRANSITIONS=239} [2025-02-06 09:27:57,926 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -39 predicate places. [2025-02-06 09:27:57,927 INFO L471 AbstractCegarLoop]: Abstraction has has 245 places, 239 transitions, 591 flow [2025-02-06 09:27:57,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:27:57,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:57,928 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:57,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 09:27:57,928 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:57,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:57,928 INFO L85 PathProgramCache]: Analyzing trace with hash -1114436039, now seen corresponding path program 1 times [2025-02-06 09:27:57,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:57,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765072276] [2025-02-06 09:27:57,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:57,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:57,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-06 09:27:57,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-06 09:27:57,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:57,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:57,985 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:27:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:57,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765072276] [2025-02-06 09:27:57,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765072276] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:57,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:57,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058499508] [2025-02-06 09:27:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:57,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:57,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:57,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,031 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-02-06 09:27:58,032 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 239 transitions, 591 flow. Second operand has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:27:58,032 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,032 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-02-06 09:27:58,032 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,209 INFO L124 PetriNetUnfolderBase]: 230/1796 cut-off events. [2025-02-06 09:27:58,209 INFO L125 PetriNetUnfolderBase]: For 59/68 co-relation queries the response was YES. [2025-02-06 09:27:58,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2631 conditions, 1796 events. 230/1796 cut-off events. For 59/68 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 15143 event pairs, 91 based on Foata normal form. 0/1631 useless extension candidates. Maximal degree in co-relation 2319. Up to 213 conditions per place. [2025-02-06 09:27:58,225 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 22 selfloop transitions, 2 changer transitions 0/241 dead transitions. [2025-02-06 09:27:58,225 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 241 transitions, 646 flow [2025-02-06 09:27:58,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-06 09:27:58,227 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-02-06 09:27:58,227 INFO L175 Difference]: Start difference. First operand has 245 places, 239 transitions, 591 flow. Second operand 3 states and 855 transitions. [2025-02-06 09:27:58,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 241 transitions, 646 flow [2025-02-06 09:27:58,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 241 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:58,231 INFO L231 Difference]: Finished difference. Result has 244 places, 238 transitions, 589 flow [2025-02-06 09:27:58,231 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=242, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=589, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2025-02-06 09:27:58,232 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -40 predicate places. [2025-02-06 09:27:58,232 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 589 flow [2025-02-06 09:27:58,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 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:27:58,232 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,232 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] [2025-02-06 09:27:58,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:27:58,232 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting thread3Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:58,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,233 INFO L85 PathProgramCache]: Analyzing trace with hash 430708695, now seen corresponding path program 1 times [2025-02-06 09:27:58,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838272302] [2025-02-06 09:27:58,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-02-06 09:27:58,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-02-06 09:27:58,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,265 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:27:58,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838272302] [2025-02-06 09:27:58,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838272302] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777171487] [2025-02-06 09:27:58,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,300 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-02-06 09:27:58,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:27:58,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,301 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-02-06 09:27:58,301 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,468 INFO L124 PetriNetUnfolderBase]: 247/1765 cut-off events. [2025-02-06 09:27:58,469 INFO L125 PetriNetUnfolderBase]: For 139/142 co-relation queries the response was YES. [2025-02-06 09:27:58,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2583 conditions, 1765 events. 247/1765 cut-off events. For 139/142 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 14309 event pairs, 103 based on Foata normal form. 0/1609 useless extension candidates. Maximal degree in co-relation 2504. Up to 272 conditions per place. [2025-02-06 09:27:58,481 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 23 selfloop transitions, 2 changer transitions 0/240 dead transitions. [2025-02-06 09:27:58,481 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 240 transitions, 646 flow [2025-02-06 09:27:58,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-06 09:27:58,483 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-02-06 09:27:58,483 INFO L175 Difference]: Start difference. First operand has 244 places, 238 transitions, 589 flow. Second operand 3 states and 855 transitions. [2025-02-06 09:27:58,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 240 transitions, 646 flow [2025-02-06 09:27:58,485 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 240 transitions, 642 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:58,486 INFO L231 Difference]: Finished difference. Result has 243 places, 237 transitions, 587 flow [2025-02-06 09:27:58,487 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=235, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=587, PETRI_PLACES=243, PETRI_TRANSITIONS=237} [2025-02-06 09:27:58,487 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -41 predicate places. [2025-02-06 09:27:58,487 INFO L471 AbstractCegarLoop]: Abstraction has has 243 places, 237 transitions, 587 flow [2025-02-06 09:27:58,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 280.3333333333333) internal successors, (841), 3 states have internal predecessors, (841), 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:27:58,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,488 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:58,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:27:58,488 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:58,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1792795424, now seen corresponding path program 1 times [2025-02-06 09:27:58,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376957705] [2025-02-06 09:27:58,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-02-06 09:27:58,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-02-06 09:27:58,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,517 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:27:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376957705] [2025-02-06 09:27:58,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376957705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483589003] [2025-02-06 09:27:58,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,519 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,556 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-02-06 09:27:58,557 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 237 transitions, 587 flow. Second operand has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:27:58,557 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,557 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-02-06 09:27:58,557 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:58,826 INFO L124 PetriNetUnfolderBase]: 409/2329 cut-off events. [2025-02-06 09:27:58,826 INFO L125 PetriNetUnfolderBase]: For 190/196 co-relation queries the response was YES. [2025-02-06 09:27:58,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3732 conditions, 2329 events. 409/2329 cut-off events. For 190/196 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 20579 event pairs, 200 based on Foata normal form. 0/2170 useless extension candidates. Maximal degree in co-relation 3460. Up to 526 conditions per place. [2025-02-06 09:27:58,852 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/239 dead transitions. [2025-02-06 09:27:58,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 239 transitions, 640 flow [2025-02-06 09:27:58,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:58,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:58,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-06 09:27:58,854 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-02-06 09:27:58,854 INFO L175 Difference]: Start difference. First operand has 243 places, 237 transitions, 587 flow. Second operand 3 states and 857 transitions. [2025-02-06 09:27:58,854 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 239 transitions, 640 flow [2025-02-06 09:27:58,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 239 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:58,859 INFO L231 Difference]: Finished difference. Result has 242 places, 236 transitions, 585 flow [2025-02-06 09:27:58,859 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=585, PETRI_PLACES=242, PETRI_TRANSITIONS=236} [2025-02-06 09:27:58,859 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -42 predicate places. [2025-02-06 09:27:58,859 INFO L471 AbstractCegarLoop]: Abstraction has has 242 places, 236 transitions, 585 flow [2025-02-06 09:27:58,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.3333333333333) internal successors, (847), 3 states have internal predecessors, (847), 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:27:58,860 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:58,860 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:58,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:27:58,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting thread4Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:58,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:58,861 INFO L85 PathProgramCache]: Analyzing trace with hash -2137821775, now seen corresponding path program 1 times [2025-02-06 09:27:58,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:58,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584075853] [2025-02-06 09:27:58,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:58,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:58,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-06 09:27:58,871 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-06 09:27:58,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:58,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:58,892 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:27:58,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:58,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584075853] [2025-02-06 09:27:58,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584075853] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:58,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:58,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:58,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464131324] [2025-02-06 09:27:58,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:58,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:58,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:58,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:58,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:58,939 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-02-06 09:27:58,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 236 transitions, 585 flow. Second operand has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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:27:58,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:58,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-02-06 09:27:58,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,102 INFO L124 PetriNetUnfolderBase]: 160/1381 cut-off events. [2025-02-06 09:27:59,103 INFO L125 PetriNetUnfolderBase]: For 115/122 co-relation queries the response was YES. [2025-02-06 09:27:59,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1972 conditions, 1381 events. 160/1381 cut-off events. For 115/122 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10240 event pairs, 54 based on Foata normal form. 1/1278 useless extension candidates. Maximal degree in co-relation 1769. Up to 164 conditions per place. [2025-02-06 09:27:59,117 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 21 selfloop transitions, 2 changer transitions 0/238 dead transitions. [2025-02-06 09:27:59,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 238 transitions, 638 flow [2025-02-06 09:27:59,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-06 09:27:59,119 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-02-06 09:27:59,120 INFO L175 Difference]: Start difference. First operand has 242 places, 236 transitions, 585 flow. Second operand 3 states and 857 transitions. [2025-02-06 09:27:59,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 238 transitions, 638 flow [2025-02-06 09:27:59,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 238 transitions, 634 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:59,124 INFO L231 Difference]: Finished difference. Result has 241 places, 235 transitions, 583 flow [2025-02-06 09:27:59,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=235, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=583, PETRI_PLACES=241, PETRI_TRANSITIONS=235} [2025-02-06 09:27:59,125 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -43 predicate places. [2025-02-06 09:27:59,125 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 235 transitions, 583 flow [2025-02-06 09:27:59,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.6666666666667) internal successors, (845), 3 states have internal predecessors, (845), 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:27:59,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:59,126 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:59,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-06 09:27:59,126 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread3Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:59,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:59,127 INFO L85 PathProgramCache]: Analyzing trace with hash 58541517, now seen corresponding path program 1 times [2025-02-06 09:27:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518569713] [2025-02-06 09:27:59,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:59,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:59,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-06 09:27:59,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-06 09:27:59,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:59,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:59,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:27:59,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:59,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518569713] [2025-02-06 09:27:59,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518569713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:59,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:59,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:59,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072411834] [2025-02-06 09:27:59,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:59,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:59,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:59,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:59,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:59,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 277 out of 307 [2025-02-06 09:27:59,201 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 235 transitions, 583 flow. Second operand has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:27:59,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:59,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 277 of 307 [2025-02-06 09:27:59,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,358 INFO L124 PetriNetUnfolderBase]: 247/1708 cut-off events. [2025-02-06 09:27:59,358 INFO L125 PetriNetUnfolderBase]: For 141/144 co-relation queries the response was YES. [2025-02-06 09:27:59,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2536 conditions, 1708 events. 247/1708 cut-off events. For 141/144 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 13566 event pairs, 103 based on Foata normal form. 0/1597 useless extension candidates. Maximal degree in co-relation 2326. Up to 272 conditions per place. [2025-02-06 09:27:59,375 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 23 selfloop transitions, 2 changer transitions 0/237 dead transitions. [2025-02-06 09:27:59,375 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 237 transitions, 640 flow [2025-02-06 09:27:59,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 855 transitions. [2025-02-06 09:27:59,379 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9283387622149837 [2025-02-06 09:27:59,379 INFO L175 Difference]: Start difference. First operand has 241 places, 235 transitions, 583 flow. Second operand 3 states and 855 transitions. [2025-02-06 09:27:59,379 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 237 transitions, 640 flow [2025-02-06 09:27:59,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 237 transitions, 636 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:59,382 INFO L231 Difference]: Finished difference. Result has 240 places, 234 transitions, 581 flow [2025-02-06 09:27:59,383 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=234, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=240, PETRI_TRANSITIONS=234} [2025-02-06 09:27:59,383 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -44 predicate places. [2025-02-06 09:27:59,383 INFO L471 AbstractCegarLoop]: Abstraction has has 240 places, 234 transitions, 581 flow [2025-02-06 09:27:59,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 281.3333333333333) internal successors, (844), 3 states have internal predecessors, (844), 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:27:59,384 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:27:59,384 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:27:59,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-06 09:27:59,384 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting thread4Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE, thread1Err5ASSERT_VIOLATIONDATA_RACE, thread1Err4ASSERT_VIOLATIONDATA_RACE (and 79 more)] === [2025-02-06 09:27:59,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:27:59,384 INFO L85 PathProgramCache]: Analyzing trace with hash -21703849, now seen corresponding path program 1 times [2025-02-06 09:27:59,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:27:59,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089050831] [2025-02-06 09:27:59,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:27:59,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:27:59,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-02-06 09:27:59,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-02-06 09:27:59,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:27:59,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:27:59,438 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:27:59,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:27:59,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089050831] [2025-02-06 09:27:59,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089050831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:27:59,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:27:59,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-06 09:27:59,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862075349] [2025-02-06 09:27:59,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:27:59,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:27:59,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:27:59,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:27:59,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:27:59,491 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 307 [2025-02-06 09:27:59,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 240 places, 234 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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:27:59,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:27:59,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 307 [2025-02-06 09:27:59,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:27:59,595 INFO L124 PetriNetUnfolderBase]: 160/1364 cut-off events. [2025-02-06 09:27:59,596 INFO L125 PetriNetUnfolderBase]: For 106/110 co-relation queries the response was YES. [2025-02-06 09:27:59,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1937 conditions, 1364 events. 160/1364 cut-off events. For 106/110 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10024 event pairs, 54 based on Foata normal form. 0/1277 useless extension candidates. Maximal degree in co-relation 1825. Up to 164 conditions per place. [2025-02-06 09:27:59,605 INFO L140 encePairwiseOnDemand]: 304/307 looper letters, 0 selfloop transitions, 0 changer transitions 236/236 dead transitions. [2025-02-06 09:27:59,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 236 transitions, 634 flow [2025-02-06 09:27:59,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:27:59,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:27:59,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 857 transitions. [2025-02-06 09:27:59,607 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9305103148751357 [2025-02-06 09:27:59,608 INFO L175 Difference]: Start difference. First operand has 240 places, 234 transitions, 581 flow. Second operand 3 states and 857 transitions. [2025-02-06 09:27:59,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 236 transitions, 634 flow [2025-02-06 09:27:59,609 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 239 places, 236 transitions, 630 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-06 09:27:59,610 INFO L231 Difference]: Finished difference. Result has 239 places, 0 transitions, 0 flow [2025-02-06 09:27:59,610 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=307, PETRI_DIFFERENCE_MINUEND_FLOW=575, PETRI_DIFFERENCE_MINUEND_PLACES=237, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=239, PETRI_TRANSITIONS=0} [2025-02-06 09:27:59,611 INFO L279 CegarLoopForPetriNet]: 284 programPoint places, -45 predicate places. [2025-02-06 09:27:59,611 INFO L471 AbstractCegarLoop]: Abstraction has has 239 places, 0 transitions, 0 flow [2025-02-06 09:27:59,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.6666666666667) internal successors, (848), 3 states have internal predecessors, (848), 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:27:59,613 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (82 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (81 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (80 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (79 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (78 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (77 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (76 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (75 of 83 remaining) [2025-02-06 09:27:59,614 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (74 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (73 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (72 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (71 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (70 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (69 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (68 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (67 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (66 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (65 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (64 of 83 remaining) [2025-02-06 09:27:59,615 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (63 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (62 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (61 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (60 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (59 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE (58 of 83 remaining) [2025-02-06 09:27:59,616 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE (57 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (56 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (55 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (54 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (53 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (52 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (51 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (50 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (49 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (48 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (47 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (46 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (45 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (44 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (43 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (42 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (41 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (40 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (39 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (38 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (37 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (36 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (35 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (34 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (33 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (32 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (31 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (30 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (29 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (28 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (27 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (26 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (25 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (24 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (23 of 83 remaining) [2025-02-06 09:27:59,617 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (22 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (21 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (20 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (19 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (18 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (17 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (16 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err7ASSERT_VIOLATIONDATA_RACE (15 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err6ASSERT_VIOLATIONDATA_RACE (14 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err5ASSERT_VIOLATIONDATA_RACE (13 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err4ASSERT_VIOLATIONDATA_RACE (12 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err3ASSERT_VIOLATIONDATA_RACE (11 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err2ASSERT_VIOLATIONDATA_RACE (10 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err1ASSERT_VIOLATIONDATA_RACE (9 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread3Err0ASSERT_VIOLATIONDATA_RACE (8 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err7ASSERT_VIOLATIONDATA_RACE (7 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err6ASSERT_VIOLATIONDATA_RACE (6 of 83 remaining) [2025-02-06 09:27:59,618 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err5ASSERT_VIOLATIONDATA_RACE (5 of 83 remaining) [2025-02-06 09:27:59,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err4ASSERT_VIOLATIONDATA_RACE (4 of 83 remaining) [2025-02-06 09:27:59,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err3ASSERT_VIOLATIONDATA_RACE (3 of 83 remaining) [2025-02-06 09:27:59,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err2ASSERT_VIOLATIONDATA_RACE (2 of 83 remaining) [2025-02-06 09:27:59,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err1ASSERT_VIOLATIONDATA_RACE (1 of 83 remaining) [2025-02-06 09:27:59,619 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread4Err0ASSERT_VIOLATIONDATA_RACE (0 of 83 remaining) [2025-02-06 09:27:59,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-06 09:27:59,620 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] [2025-02-06 09:27:59,624 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-06 09:27:59,624 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-06 09:27:59,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.02 09:27:59 BasicIcfg [2025-02-06 09:27:59,630 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-06 09:27:59,630 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-06 09:27:59,630 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-06 09:27:59,630 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-06 09:27:59,631 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:27:54" (3/4) ... [2025-02-06 09:27:59,632 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-06 09:27:59,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2025-02-06 09:27:59,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2025-02-06 09:27:59,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread3 [2025-02-06 09:27:59,634 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure thread4 [2025-02-06 09:27:59,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 16 nodes and edges [2025-02-06 09:27:59,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2025-02-06 09:27:59,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-06 09:27:59,639 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-06 09:27:59,700 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-06 09:27:59,701 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-06 09:27:59,701 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-06 09:27:59,701 INFO L158 Benchmark]: Toolchain (without parser) took 5984.70ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 122.2MB in the beginning and 306.2MB in the end (delta: -184.0MB). Peak memory consumption was 213.5MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,702 INFO L158 Benchmark]: CDTParser took 0.49ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:59,702 INFO L158 Benchmark]: CACSL2BoogieTranslator took 185.70ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,702 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.23ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.7MB in the end (delta: 676.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-06 09:27:59,704 INFO L158 Benchmark]: Boogie Preprocessor took 26.24ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,704 INFO L158 Benchmark]: IcfgBuilder took 485.35ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 84.9MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,705 INFO L158 Benchmark]: TraceAbstraction took 5186.16ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 84.0MB in the beginning and 314.6MB in the end (delta: -230.7MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,705 INFO L158 Benchmark]: Witness Printer took 70.48ms. Allocated memory is still 570.4MB. Free memory was 314.6MB in the beginning and 306.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-06 09:27:59,706 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.49ms. Allocated memory is still 226.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 185.70ms. Allocated memory is still 167.8MB. Free memory was 122.2MB in the beginning and 109.4MB in the end (delta: 12.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.23ms. Allocated memory is still 167.8MB. Free memory was 109.4MB in the beginning and 108.7MB in the end (delta: 676.1kB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.24ms. Allocated memory is still 167.8MB. Free memory was 108.7MB in the beginning and 106.8MB in the end (delta: 1.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 485.35ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 84.9MB in the end (delta: 21.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 5186.16ms. Allocated memory was 167.8MB in the beginning and 570.4MB in the end (delta: 402.7MB). Free memory was 84.0MB in the beginning and 314.6MB in the end (delta: -230.7MB). Peak memory consumption was 171.6MB. Max. memory is 16.1GB. * Witness Printer took 70.48ms. Allocated memory is still 570.4MB. Free memory was 314.6MB in the beginning and 306.2MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 38]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 39]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 40]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 47]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 48]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 49]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 56]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 57]: 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: 77]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 78]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 79]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 80]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 81]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 84]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 95]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 65]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 66]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 67]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 438 locations, 83 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: 5.0s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1140 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 388 mSDsluCounter, 239 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 11 mSDsCounter, 121 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1171 IncrementalHoareTripleChecker+Invalid, 1292 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 121 mSolverCounterUnsat, 228 mSDtfsCounter, 1171 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=593occurred in iteration=12, InterpolantAutomatonStates: 59, 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.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 1383 NumberOfCodeBlocks, 1383 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1364 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 47 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-06 09:27:59,724 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