./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-deagle/airline-25.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-deagle/airline-25.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:26:52,472 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:26:52,537 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:26:52,541 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:26:52,544 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:26:52,561 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:26:52,561 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:26:52,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:26:52,562 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:26:52,562 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:26:52,562 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:26:52,562 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:26:52,562 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:26:52,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:26:52,563 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:26:52,564 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:26:52,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:52,564 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:26:52,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:26:52,565 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/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 -> a0d81069750f24e52e04bdb7efecd6d77b64aec41e058c154f75fbba11e6c11d [2025-03-13 22:26:52,791 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:26:52,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:26:52,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:26:52,802 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:26:52,803 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:26:52,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-deagle/airline-25.i [2025-03-13 22:26:53,908 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9948cbc9e/9e424534177840d494f0656a263005dc/FLAG0916a9e86 [2025-03-13 22:26:54,169 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:26:54,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-deagle/airline-25.i [2025-03-13 22:26:54,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9948cbc9e/9e424534177840d494f0656a263005dc/FLAG0916a9e86 [2025-03-13 22:26:54,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9948cbc9e/9e424534177840d494f0656a263005dc [2025-03-13 22:26:54,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:26:54,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:26:54,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:54,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:26:54,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:26:54,204 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57f944bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54, skipping insertion in model container [2025-03-13 22:26:54,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:26:54,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:54,488 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:26:54,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:26:54,549 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:26:54,550 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54 WrapperNode [2025-03-13 22:26:54,550 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:26:54,551 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:54,551 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:26:54,551 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:26:54,555 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,575 INFO L138 Inliner]: procedures = 162, calls = 24, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-03-13 22:26:54,575 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:26:54,575 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:26:54,575 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:26:54,575 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:26:54,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,591 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,593 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,595 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:26:54,597 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:26:54,597 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:26:54,597 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:26:54,598 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (1/1) ... [2025-03-13 22:26:54,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:26:54,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:26:54,626 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-13 22:26:54,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-13 22:26:54,648 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure salethread [2025-03-13 22:26:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure salethread [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-03-13 22:26:54,649 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:26:54,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:26:54,650 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:26:54,736 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:26:54,737 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:26:54,887 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L736: havoc main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset; [2025-03-13 22:26:54,887 INFO L1326 $ProcedureCfgBuilder]: dead code at ProgramPoint L736-1: SUMMARY for call ULTIMATE.dealloc(main_~#salethreads~0#1.base, main_~#salethreads~0#1.offset); srcloc: null [2025-03-13 22:26:54,888 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:26:54,889 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:26:54,889 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:26:54,917 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:26:54,917 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:54 BoogieIcfgContainer [2025-03-13 22:26:54,918 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:26:54,919 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:26:54,919 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:26:54,923 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:26:54,923 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:26:54" (1/3) ... [2025-03-13 22:26:54,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7743d123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:54, skipping insertion in model container [2025-03-13 22:26:54,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:26:54" (2/3) ... [2025-03-13 22:26:54,924 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7743d123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:26:54, skipping insertion in model container [2025-03-13 22:26:54,924 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:54" (3/3) ... [2025-03-13 22:26:54,925 INFO L128 eAbstractionObserver]: Analyzing ICFG airline-25.i [2025-03-13 22:26:54,936 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:26:54,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG airline-25.i that has 2 procedures, 92 locations, 1 initial locations, 2 loop locations, and 10 error locations. [2025-03-13 22:26:54,937 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:26:54,981 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-13 22:26:55,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 95 places, 97 transitions, 201 flow [2025-03-13 22:26:55,063 INFO L124 PetriNetUnfolderBase]: 7/140 cut-off events. [2025-03-13 22:26:55,064 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:26:55,070 INFO L83 FinitePrefix]: Finished finitePrefix Result has 145 conditions, 140 events. 7/140 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 297 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 68. Up to 4 conditions per place. [2025-03-13 22:26:55,070 INFO L82 GeneralOperation]: Start removeDead. Operand has 95 places, 97 transitions, 201 flow [2025-03-13 22:26:55,076 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 95 places, 97 transitions, 201 flow [2025-03-13 22:26:55,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:55,092 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;@625e40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:55,093 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2025-03-13 22:26:55,098 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:55,100 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:26:55,101 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:55,101 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:55,102 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:55,102 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:55,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:55,106 INFO L85 PathProgramCache]: Analyzing trace with hash 704519650, now seen corresponding path program 1 times [2025-03-13 22:26:55,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:55,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120439066] [2025-03-13 22:26:55,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:55,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:26:55,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:26:55,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:55,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:55,236 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:55,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:55,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120439066] [2025-03-13 22:26:55,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120439066] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:55,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:55,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:26:55,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754309175] [2025-03-13 22:26:55,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:55,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:26:55,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:55,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:26:55,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:26:55,261 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 97 [2025-03-13 22:26:55,263 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 97 transitions, 201 flow. Second operand has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-03-13 22:26:55,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:55,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 97 [2025-03-13 22:26:55,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:55,312 INFO L124 PetriNetUnfolderBase]: 3/127 cut-off events. [2025-03-13 22:26:55,313 INFO L125 PetriNetUnfolderBase]: For 5/6 co-relation queries the response was YES. [2025-03-13 22:26:55,313 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 127 events. 3/127 cut-off events. For 5/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 261 event pairs, 0 based on Foata normal form. 4/115 useless extension candidates. Maximal degree in co-relation 64. Up to 8 conditions per place. [2025-03-13 22:26:55,314 INFO L140 encePairwiseOnDemand]: 90/97 looper letters, 7 selfloop transitions, 0 changer transitions 0/88 dead transitions. [2025-03-13 22:26:55,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 88 transitions, 197 flow [2025-03-13 22:26:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:26:55,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:26:55,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 178 transitions. [2025-03-13 22:26:55,325 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9175257731958762 [2025-03-13 22:26:55,327 INFO L175 Difference]: Start difference. First operand has 95 places, 97 transitions, 201 flow. Second operand 2 states and 178 transitions. [2025-03-13 22:26:55,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 88 transitions, 197 flow [2025-03-13 22:26:55,332 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 88 transitions, 197 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:55,337 INFO L231 Difference]: Finished difference. Result has 89 places, 88 transitions, 183 flow [2025-03-13 22:26:55,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=183, PETRI_PLACES=89, PETRI_TRANSITIONS=88} [2025-03-13 22:26:55,343 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -6 predicate places. [2025-03-13 22:26:55,345 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 88 transitions, 183 flow [2025-03-13 22:26:55,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 82.5) internal successors, (165), 2 states have internal predecessors, (165), 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-03-13 22:26:55,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:55,346 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] [2025-03-13 22:26:55,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:26:55,347 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:55,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:55,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1997247111, now seen corresponding path program 1 times [2025-03-13 22:26:55,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:55,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409734785] [2025-03-13 22:26:55,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:55,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:55,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:26:55,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:26:55,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:55,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:55,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:55,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409734785] [2025-03-13 22:26:55,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409734785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:55,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:55,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:26:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44556822] [2025-03-13 22:26:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:55,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:55,448 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:55,471 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-13 22:26:55,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 88 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-03-13 22:26:55,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:55,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-13 22:26:55,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:55,515 INFO L124 PetriNetUnfolderBase]: 10/174 cut-off events. [2025-03-13 22:26:55,515 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:26:55,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 174 events. 10/174 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 459 event pairs, 0 based on Foata normal form. 1/152 useless extension candidates. Maximal degree in co-relation 203. Up to 23 conditions per place. [2025-03-13 22:26:55,516 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 13 selfloop transitions, 2 changer transitions 0/90 dead transitions. [2025-03-13 22:26:55,516 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 217 flow [2025-03-13 22:26:55,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:55,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:55,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 244 transitions. [2025-03-13 22:26:55,520 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384879725085911 [2025-03-13 22:26:55,520 INFO L175 Difference]: Start difference. First operand has 89 places, 88 transitions, 183 flow. Second operand 3 states and 244 transitions. [2025-03-13 22:26:55,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 217 flow [2025-03-13 22:26:55,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 90 transitions, 217 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:55,544 INFO L231 Difference]: Finished difference. Result has 92 places, 88 transitions, 191 flow [2025-03-13 22:26:55,544 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=191, PETRI_PLACES=92, PETRI_TRANSITIONS=88} [2025-03-13 22:26:55,545 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -3 predicate places. [2025-03-13 22:26:55,548 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 88 transitions, 191 flow [2025-03-13 22:26:55,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 3 states have internal predecessors, (235), 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-03-13 22:26:55,550 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:55,550 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-03-13 22:26:55,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-13 22:26:55,551 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:55,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:55,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1443432560, now seen corresponding path program 1 times [2025-03-13 22:26:55,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:55,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-03-13 22:26:55,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:55,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:55,568 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:26:55,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:26:55,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:55,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:55,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:55,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:55,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959344526] [2025-03-13 22:26:55,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959344526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:55,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:55,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:55,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996848681] [2025-03-13 22:26:55,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:55,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:55,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:55,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:55,936 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:56,028 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 97 [2025-03-13 22:26:56,029 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 88 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-03-13 22:26:56,029 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,030 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 97 [2025-03-13 22:26:56,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,115 INFO L124 PetriNetUnfolderBase]: 33/198 cut-off events. [2025-03-13 22:26:56,116 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2025-03-13 22:26:56,117 INFO L83 FinitePrefix]: Finished finitePrefix Result has 298 conditions, 198 events. 33/198 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 656 event pairs, 9 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 292. Up to 56 conditions per place. [2025-03-13 22:26:56,117 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 28 selfloop transitions, 5 changer transitions 0/95 dead transitions. [2025-03-13 22:26:56,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 271 flow [2025-03-13 22:26:56,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:56,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 412 transitions. [2025-03-13 22:26:56,122 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7079037800687286 [2025-03-13 22:26:56,122 INFO L175 Difference]: Start difference. First operand has 92 places, 88 transitions, 191 flow. Second operand 6 states and 412 transitions. [2025-03-13 22:26:56,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 271 flow [2025-03-13 22:26:56,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:56,123 INFO L231 Difference]: Finished difference. Result has 94 places, 87 transitions, 195 flow [2025-03-13 22:26:56,124 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=195, PETRI_PLACES=94, PETRI_TRANSITIONS=87} [2025-03-13 22:26:56,124 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -1 predicate places. [2025-03-13 22:26:56,124 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 87 transitions, 195 flow [2025-03-13 22:26:56,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 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-03-13 22:26:56,126 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,127 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] [2025-03-13 22:26:56,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:26:56,127 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:56,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1595949315, now seen corresponding path program 1 times [2025-03-13 22:26:56,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330145705] [2025-03-13 22:26:56,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:26:56,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:26:56,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:56,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330145705] [2025-03-13 22:26:56,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330145705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,164 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:56,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267115298] [2025-03-13 22:26:56,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:56,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:56,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:56,168 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 97 [2025-03-13 22:26:56,169 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 87 transitions, 195 flow. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-03-13 22:26:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 97 [2025-03-13 22:26:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,194 INFO L124 PetriNetUnfolderBase]: 1/154 cut-off events. [2025-03-13 22:26:56,195 INFO L125 PetriNetUnfolderBase]: For 10/18 co-relation queries the response was YES. [2025-03-13 22:26:56,196 INFO L83 FinitePrefix]: Finished finitePrefix Result has 185 conditions, 154 events. 1/154 cut-off events. For 10/18 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 301 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 179. Up to 7 conditions per place. [2025-03-13 22:26:56,196 INFO L140 encePairwiseOnDemand]: 94/97 looper letters, 8 selfloop transitions, 2 changer transitions 0/87 dead transitions. [2025-03-13 22:26:56,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 87 transitions, 218 flow [2025-03-13 22:26:56,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:56,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:56,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2025-03-13 22:26:56,197 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.852233676975945 [2025-03-13 22:26:56,197 INFO L175 Difference]: Start difference. First operand has 94 places, 87 transitions, 195 flow. Second operand 3 states and 248 transitions. [2025-03-13 22:26:56,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 87 transitions, 218 flow [2025-03-13 22:26:56,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 87 transitions, 208 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:56,199 INFO L231 Difference]: Finished difference. Result has 90 places, 86 transitions, 187 flow [2025-03-13 22:26:56,199 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=183, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=187, PETRI_PLACES=90, PETRI_TRANSITIONS=86} [2025-03-13 22:26:56,199 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -5 predicate places. [2025-03-13 22:26:56,199 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 86 transitions, 187 flow [2025-03-13 22:26:56,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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-03-13 22:26:56,200 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,200 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-03-13 22:26:56,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:26:56,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:56,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,200 INFO L85 PathProgramCache]: Analyzing trace with hash 362146053, now seen corresponding path program 1 times [2025-03-13 22:26:56,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685848237] [2025-03-13 22:26:56,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:26:56,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:26:56,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,233 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:56,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685848237] [2025-03-13 22:26:56,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685848237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:56,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896472388] [2025-03-13 22:26:56,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:56,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:56,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:56,241 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 97 [2025-03-13 22:26:56,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 86 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-03-13 22:26:56,242 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,242 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 97 [2025-03-13 22:26:56,242 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,267 INFO L124 PetriNetUnfolderBase]: 8/228 cut-off events. [2025-03-13 22:26:56,268 INFO L125 PetriNetUnfolderBase]: For 13/21 co-relation queries the response was YES. [2025-03-13 22:26:56,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 278 conditions, 228 events. 8/228 cut-off events. For 13/21 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 823 event pairs, 4 based on Foata normal form. 0/206 useless extension candidates. Maximal degree in co-relation 272. Up to 25 conditions per place. [2025-03-13 22:26:56,269 INFO L140 encePairwiseOnDemand]: 91/97 looper letters, 12 selfloop transitions, 4 changer transitions 0/89 dead transitions. [2025-03-13 22:26:56,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 228 flow [2025-03-13 22:26:56,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:56,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:56,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2025-03-13 22:26:56,270 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.845360824742268 [2025-03-13 22:26:56,270 INFO L175 Difference]: Start difference. First operand has 90 places, 86 transitions, 187 flow. Second operand 3 states and 246 transitions. [2025-03-13 22:26:56,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 228 flow [2025-03-13 22:26:56,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 89 transitions, 224 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:56,272 INFO L231 Difference]: Finished difference. Result has 91 places, 88 transitions, 211 flow [2025-03-13 22:26:56,273 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=181, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=211, PETRI_PLACES=91, PETRI_TRANSITIONS=88} [2025-03-13 22:26:56,274 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -4 predicate places. [2025-03-13 22:26:56,274 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 88 transitions, 211 flow [2025-03-13 22:26:56,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 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-03-13 22:26:56,275 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,275 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:56,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-13 22:26:56,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1136417201, now seen corresponding path program 1 times [2025-03-13 22:26:56,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274491777] [2025-03-13 22:26:56,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:26:56,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:26:56,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:56,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274491777] [2025-03-13 22:26:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1274491777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709258417] [2025-03-13 22:26:56,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:26:56,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,367 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:26:56,367 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:26:56,398 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 97 [2025-03-13 22:26:56,398 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 88 transitions, 211 flow. Second operand has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-03-13 22:26:56,398 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,398 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 97 [2025-03-13 22:26:56,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,440 INFO L124 PetriNetUnfolderBase]: 7/99 cut-off events. [2025-03-13 22:26:56,441 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-03-13 22:26:56,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 144 conditions, 99 events. 7/99 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 172 event pairs, 0 based on Foata normal form. 3/100 useless extension candidates. Maximal degree in co-relation 137. Up to 8 conditions per place. [2025-03-13 22:26:56,441 INFO L140 encePairwiseOnDemand]: 92/97 looper letters, 13 selfloop transitions, 4 changer transitions 0/58 dead transitions. [2025-03-13 22:26:56,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 58 transitions, 176 flow [2025-03-13 22:26:56,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:56,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:56,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 462 transitions. [2025-03-13 22:26:56,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7938144329896907 [2025-03-13 22:26:56,444 INFO L175 Difference]: Start difference. First operand has 91 places, 88 transitions, 211 flow. Second operand 6 states and 462 transitions. [2025-03-13 22:26:56,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 58 transitions, 176 flow [2025-03-13 22:26:56,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 154 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:56,445 INFO L231 Difference]: Finished difference. Result has 59 places, 52 transitions, 116 flow [2025-03-13 22:26:56,446 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=97, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=116, PETRI_PLACES=59, PETRI_TRANSITIONS=52} [2025-03-13 22:26:56,446 INFO L279 CegarLoopForPetriNet]: 95 programPoint places, -36 predicate places. [2025-03-13 22:26:56,446 INFO L471 AbstractCegarLoop]: Abstraction has has 59 places, 52 transitions, 116 flow [2025-03-13 22:26:56,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.2) internal successors, (381), 5 states have internal predecessors, (381), 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-03-13 22:26:56,448 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,448 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-03-13 22:26:56,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:26:56,448 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 12 more)] === [2025-03-13 22:26:56,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1542204118, now seen corresponding path program 1 times [2025-03-13 22:26:56,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68240066] [2025-03-13 22:26:56,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:26:56,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:26:56,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:26:56,470 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:26:56,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-13 22:26:56,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-13 22:26:56,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:26:56,500 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:26:56,500 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:26:56,501 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (14 of 15 remaining) [2025-03-13 22:26:56,503 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (13 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (12 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (11 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (10 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (9 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (7 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 15 remaining) [2025-03-13 22:26:56,504 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 15 remaining) [2025-03-13 22:26:56,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 15 remaining) [2025-03-13 22:26:56,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (3 of 15 remaining) [2025-03-13 22:26:56,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (2 of 15 remaining) [2025-03-13 22:26:56,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 15 remaining) [2025-03-13 22:26:56,505 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 15 remaining) [2025-03-13 22:26:56,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-13 22:26:56,506 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:56,508 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-13 22:26:56,510 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-13 22:26:56,525 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-13 22:26:56,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 115 places, 118 transitions, 252 flow [2025-03-13 22:26:56,562 INFO L124 PetriNetUnfolderBase]: 15/249 cut-off events. [2025-03-13 22:26:56,562 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-13 22:26:56,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 261 conditions, 249 events. 15/249 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 597 event pairs, 0 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 142. Up to 8 conditions per place. [2025-03-13 22:26:56,563 INFO L82 GeneralOperation]: Start removeDead. Operand has 115 places, 118 transitions, 252 flow [2025-03-13 22:26:56,564 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 115 places, 118 transitions, 252 flow [2025-03-13 22:26:56,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:26:56,566 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;@625e40f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:26:56,566 INFO L334 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2025-03-13 22:26:56,567 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:26:56,567 INFO L124 PetriNetUnfolderBase]: 0/15 cut-off events. [2025-03-13 22:26:56,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:26:56,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:56,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:56,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,568 INFO L85 PathProgramCache]: Analyzing trace with hash -844409886, now seen corresponding path program 1 times [2025-03-13 22:26:56,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112188008] [2025-03-13 22:26:56,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,572 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-13 22:26:56,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-13 22:26:56,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:56,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112188008] [2025-03-13 22:26:56,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112188008] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-13 22:26:56,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238915141] [2025-03-13 22:26:56,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-13 22:26:56,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-13 22:26:56,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-13 22:26:56,580 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 118 [2025-03-13 22:26:56,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 118 transitions, 252 flow. Second operand has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-03-13 22:26:56,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 118 [2025-03-13 22:26:56,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,610 INFO L124 PetriNetUnfolderBase]: 19/254 cut-off events. [2025-03-13 22:26:56,611 INFO L125 PetriNetUnfolderBase]: For 38/44 co-relation queries the response was YES. [2025-03-13 22:26:56,612 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 254 events. 19/254 cut-off events. For 38/44 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 748 event pairs, 4 based on Foata normal form. 10/230 useless extension candidates. Maximal degree in co-relation 144. Up to 30 conditions per place. [2025-03-13 22:26:56,613 INFO L140 encePairwiseOnDemand]: 109/118 looper letters, 11 selfloop transitions, 0 changer transitions 0/107 dead transitions. [2025-03-13 22:26:56,613 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 107 transitions, 252 flow [2025-03-13 22:26:56,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-13 22:26:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-03-13 22:26:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 214 transitions. [2025-03-13 22:26:56,614 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9067796610169492 [2025-03-13 22:26:56,614 INFO L175 Difference]: Start difference. First operand has 115 places, 118 transitions, 252 flow. Second operand 2 states and 214 transitions. [2025-03-13 22:26:56,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 107 transitions, 252 flow [2025-03-13 22:26:56,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 107 transitions, 252 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:56,615 INFO L231 Difference]: Finished difference. Result has 107 places, 107 transitions, 230 flow [2025-03-13 22:26:56,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=230, PETRI_PLACES=107, PETRI_TRANSITIONS=107} [2025-03-13 22:26:56,616 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -8 predicate places. [2025-03-13 22:26:56,616 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 107 transitions, 230 flow [2025-03-13 22:26:56,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 97.5) internal successors, (195), 2 states have internal predecessors, (195), 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-03-13 22:26:56,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,617 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] [2025-03-13 22:26:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:26:56,617 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:56,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1770959431, now seen corresponding path program 1 times [2025-03-13 22:26:56,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484601284] [2025-03-13 22:26:56,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-13 22:26:56,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-13 22:26:56,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,640 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:56,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484601284] [2025-03-13 22:26:56,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484601284] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:26:56,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647218926] [2025-03-13 22:26:56,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:56,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:56,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:56,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2025-03-13 22:26:56,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 107 transitions, 230 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-03-13 22:26:56,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:56,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2025-03-13 22:26:56,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:56,717 INFO L124 PetriNetUnfolderBase]: 60/451 cut-off events. [2025-03-13 22:26:56,717 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:26:56,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 573 conditions, 451 events. 60/451 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 2083 event pairs, 24 based on Foata normal form. 1/397 useless extension candidates. Maximal degree in co-relation 568. Up to 97 conditions per place. [2025-03-13 22:26:56,720 INFO L140 encePairwiseOnDemand]: 115/118 looper letters, 18 selfloop transitions, 2 changer transitions 0/110 dead transitions. [2025-03-13 22:26:56,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 110 transitions, 276 flow [2025-03-13 22:26:56,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:56,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:56,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2025-03-13 22:26:56,723 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8305084745762712 [2025-03-13 22:26:56,723 INFO L175 Difference]: Start difference. First operand has 107 places, 107 transitions, 230 flow. Second operand 3 states and 294 transitions. [2025-03-13 22:26:56,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 110 transitions, 276 flow [2025-03-13 22:26:56,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 110 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:26:56,725 INFO L231 Difference]: Finished difference. Result has 110 places, 108 transitions, 242 flow [2025-03-13 22:26:56,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=242, PETRI_PLACES=110, PETRI_TRANSITIONS=108} [2025-03-13 22:26:56,725 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -5 predicate places. [2025-03-13 22:26:56,725 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 108 transitions, 242 flow [2025-03-13 22:26:56,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 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-03-13 22:26:56,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:56,726 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-03-13 22:26:56,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:26:56,726 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:56,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:56,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1089037722, now seen corresponding path program 1 times [2025-03-13 22:26:56,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:56,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931195344] [2025-03-13 22:26:56,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:56,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:56,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-13 22:26:56,736 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-13 22:26:56,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:56,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:56,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:56,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:56,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931195344] [2025-03-13 22:26:56,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931195344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:56,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:56,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:56,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508628144] [2025-03-13 22:26:56,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:56,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:26:56,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:56,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:26:56,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:26:57,026 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 118 [2025-03-13 22:26:57,027 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 108 transitions, 242 flow. Second operand has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-03-13 22:26:57,027 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,027 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 118 [2025-03-13 22:26:57,027 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,134 INFO L124 PetriNetUnfolderBase]: 185/628 cut-off events. [2025-03-13 22:26:57,134 INFO L125 PetriNetUnfolderBase]: For 49/49 co-relation queries the response was YES. [2025-03-13 22:26:57,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 981 conditions, 628 events. 185/628 cut-off events. For 49/49 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3511 event pairs, 55 based on Foata normal form. 0/570 useless extension candidates. Maximal degree in co-relation 974. Up to 214 conditions per place. [2025-03-13 22:26:57,138 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 41 selfloop transitions, 5 changer transitions 0/123 dead transitions. [2025-03-13 22:26:57,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 123 transitions, 364 flow [2025-03-13 22:26:57,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:57,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:57,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 514 transitions. [2025-03-13 22:26:57,141 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7259887005649718 [2025-03-13 22:26:57,141 INFO L175 Difference]: Start difference. First operand has 110 places, 108 transitions, 242 flow. Second operand 6 states and 514 transitions. [2025-03-13 22:26:57,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 123 transitions, 364 flow [2025-03-13 22:26:57,142 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 123 transitions, 362 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:57,144 INFO L231 Difference]: Finished difference. Result has 113 places, 107 transitions, 248 flow [2025-03-13 22:26:57,144 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=113, PETRI_TRANSITIONS=107} [2025-03-13 22:26:57,145 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -2 predicate places. [2025-03-13 22:26:57,145 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 107 transitions, 248 flow [2025-03-13 22:26:57,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.0) internal successors, (480), 6 states have internal predecessors, (480), 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-03-13 22:26:57,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,145 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] [2025-03-13 22:26:57,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:26:57,146 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:57,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,146 INFO L85 PathProgramCache]: Analyzing trace with hash -997755264, now seen corresponding path program 1 times [2025-03-13 22:26:57,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637535157] [2025-03-13 22:26:57,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-13 22:26:57,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-13 22:26:57,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:57,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637535157] [2025-03-13 22:26:57,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637535157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:57,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868660905] [2025-03-13 22:26:57,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:57,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:57,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:57,180 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 118 [2025-03-13 22:26:57,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 107 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-03-13 22:26:57,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 118 [2025-03-13 22:26:57,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,258 INFO L124 PetriNetUnfolderBase]: 60/772 cut-off events. [2025-03-13 22:26:57,259 INFO L125 PetriNetUnfolderBase]: For 122/386 co-relation queries the response was YES. [2025-03-13 22:26:57,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 772 events. 60/772 cut-off events. For 122/386 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 5016 event pairs, 9 based on Foata normal form. 0/651 useless extension candidates. Maximal degree in co-relation 951. Up to 62 conditions per place. [2025-03-13 22:26:57,264 INFO L140 encePairwiseOnDemand]: 110/118 looper letters, 22 selfloop transitions, 6 changer transitions 0/118 dead transitions. [2025-03-13 22:26:57,264 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 118 transitions, 337 flow [2025-03-13 22:26:57,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:57,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:57,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 303 transitions. [2025-03-13 22:26:57,265 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8559322033898306 [2025-03-13 22:26:57,265 INFO L175 Difference]: Start difference. First operand has 113 places, 107 transitions, 248 flow. Second operand 3 states and 303 transitions. [2025-03-13 22:26:57,265 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 118 transitions, 337 flow [2025-03-13 22:26:57,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 118 transitions, 327 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:26:57,268 INFO L231 Difference]: Finished difference. Result has 112 places, 113 transitions, 290 flow [2025-03-13 22:26:57,268 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=290, PETRI_PLACES=112, PETRI_TRANSITIONS=113} [2025-03-13 22:26:57,268 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -3 predicate places. [2025-03-13 22:26:57,268 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 113 transitions, 290 flow [2025-03-13 22:26:57,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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-03-13 22:26:57,270 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,270 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-03-13 22:26:57,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:26:57,270 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:57,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1341925464, now seen corresponding path program 1 times [2025-03-13 22:26:57,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174092705] [2025-03-13 22:26:57,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-13 22:26:57,298 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-13 22:26:57,298 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,298 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:26:57,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174092705] [2025-03-13 22:26:57,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174092705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-13 22:26:57,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844386923] [2025-03-13 22:26:57,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:26:57,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:26:57,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:26:57,321 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 118 [2025-03-13 22:26:57,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 113 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03-13 22:26:57,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 118 [2025-03-13 22:26:57,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,479 INFO L124 PetriNetUnfolderBase]: 273/1920 cut-off events. [2025-03-13 22:26:57,480 INFO L125 PetriNetUnfolderBase]: For 374/820 co-relation queries the response was YES. [2025-03-13 22:26:57,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2710 conditions, 1920 events. 273/1920 cut-off events. For 374/820 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 16693 event pairs, 93 based on Foata normal form. 1/1650 useless extension candidates. Maximal degree in co-relation 2702. Up to 395 conditions per place. [2025-03-13 22:26:57,488 INFO L140 encePairwiseOnDemand]: 107/118 looper letters, 27 selfloop transitions, 8 changer transitions 0/126 dead transitions. [2025-03-13 22:26:57,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 126 transitions, 405 flow [2025-03-13 22:26:57,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:26:57,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:26:57,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-03-13 22:26:57,489 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.847457627118644 [2025-03-13 22:26:57,489 INFO L175 Difference]: Start difference. First operand has 112 places, 113 transitions, 290 flow. Second operand 3 states and 300 transitions. [2025-03-13 22:26:57,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 126 transitions, 405 flow [2025-03-13 22:26:57,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 126 transitions, 389 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:57,493 INFO L231 Difference]: Finished difference. Result has 114 places, 121 transitions, 348 flow [2025-03-13 22:26:57,493 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=348, PETRI_PLACES=114, PETRI_TRANSITIONS=121} [2025-03-13 22:26:57,494 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, -1 predicate places. [2025-03-13 22:26:57,494 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 121 transitions, 348 flow [2025-03-13 22:26:57,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.0) internal successors, (270), 3 states have internal predecessors, (270), 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-03-13 22:26:57,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:57,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:26:57,494 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:57,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1118733218, now seen corresponding path program 1 times [2025-03-13 22:26:57,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946210309] [2025-03-13 22:26:57,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-03-13 22:26:57,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-03-13 22:26:57,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-13 22:26:57,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946210309] [2025-03-13 22:26:57,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946210309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:26:57,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921104882] [2025-03-13 22:26:57,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-13 22:26:57,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-13 22:26:57,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-13 22:26:57,595 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 118 [2025-03-13 22:26:57,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 121 transitions, 348 flow. Second operand has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-03-13 22:26:57,596 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,596 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 118 [2025-03-13 22:26:57,596 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:57,821 INFO L124 PetriNetUnfolderBase]: 428/2871 cut-off events. [2025-03-13 22:26:57,821 INFO L125 PetriNetUnfolderBase]: For 844/995 co-relation queries the response was YES. [2025-03-13 22:26:57,827 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4420 conditions, 2871 events. 428/2871 cut-off events. For 844/995 co-relation queries the response was YES. Maximal size of possible extension queue 125. Compared 28056 event pairs, 145 based on Foata normal form. 19/2533 useless extension candidates. Maximal degree in co-relation 4411. Up to 458 conditions per place. [2025-03-13 22:26:57,835 INFO L140 encePairwiseOnDemand]: 113/118 looper letters, 35 selfloop transitions, 5 changer transitions 0/137 dead transitions. [2025-03-13 22:26:57,835 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 137 transitions, 498 flow [2025-03-13 22:26:57,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:26:57,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:26:57,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 567 transitions. [2025-03-13 22:26:57,837 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8008474576271186 [2025-03-13 22:26:57,837 INFO L175 Difference]: Start difference. First operand has 114 places, 121 transitions, 348 flow. Second operand 6 states and 567 transitions. [2025-03-13 22:26:57,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 137 transitions, 498 flow [2025-03-13 22:26:57,841 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 137 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:57,843 INFO L231 Difference]: Finished difference. Result has 120 places, 123 transitions, 358 flow [2025-03-13 22:26:57,843 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=358, PETRI_PLACES=120, PETRI_TRANSITIONS=123} [2025-03-13 22:26:57,844 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 5 predicate places. [2025-03-13 22:26:57,844 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 123 transitions, 358 flow [2025-03-13 22:26:57,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 91.2) internal successors, (456), 5 states have internal predecessors, (456), 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-03-13 22:26:57,844 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:57,844 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:26:57,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-13 22:26:57,845 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:57,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:57,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1846318322, now seen corresponding path program 1 times [2025-03-13 22:26:57,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:57,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443629305] [2025-03-13 22:26:57,845 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:57,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:57,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:26:57,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:26:57,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:57,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:57,928 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:26:57,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:57,928 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443629305] [2025-03-13 22:26:57,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443629305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:57,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:57,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:57,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535635713] [2025-03-13 22:26:57,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:57,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:57,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:57,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:57,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:57,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 118 [2025-03-13 22:26:57,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 123 transitions, 358 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-03-13 22:26:57,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:57,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 118 [2025-03-13 22:26:57,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,121 INFO L124 PetriNetUnfolderBase]: 224/2215 cut-off events. [2025-03-13 22:26:58,121 INFO L125 PetriNetUnfolderBase]: For 304/680 co-relation queries the response was YES. [2025-03-13 22:26:58,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3037 conditions, 2215 events. 224/2215 cut-off events. For 304/680 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 21288 event pairs, 65 based on Foata normal form. 33/1992 useless extension candidates. Maximal degree in co-relation 3025. Up to 283 conditions per place. [2025-03-13 22:26:58,131 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 30 selfloop transitions, 6 changer transitions 0/138 dead transitions. [2025-03-13 22:26:58,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 138 transitions, 499 flow [2025-03-13 22:26:58,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:58,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 499 transitions. [2025-03-13 22:26:58,133 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8457627118644068 [2025-03-13 22:26:58,133 INFO L175 Difference]: Start difference. First operand has 120 places, 123 transitions, 358 flow. Second operand 5 states and 499 transitions. [2025-03-13 22:26:58,133 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 138 transitions, 499 flow [2025-03-13 22:26:58,135 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 138 transitions, 493 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-03-13 22:26:58,137 INFO L231 Difference]: Finished difference. Result has 124 places, 124 transitions, 387 flow [2025-03-13 22:26:58,137 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=117, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=119, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=387, PETRI_PLACES=124, PETRI_TRANSITIONS=124} [2025-03-13 22:26:58,138 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 9 predicate places. [2025-03-13 22:26:58,138 INFO L471 AbstractCegarLoop]: Abstraction has has 124 places, 124 transitions, 387 flow [2025-03-13 22:26:58,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-03-13 22:26:58,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,139 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:26:58,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:26:58,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting salethreadErr3ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:58,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,139 INFO L85 PathProgramCache]: Analyzing trace with hash 940943050, now seen corresponding path program 1 times [2025-03-13 22:26:58,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671838730] [2025-03-13 22:26:58,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-13 22:26:58,152 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-13 22:26:58,152 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,152 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:26:58,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-13 22:26:58,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:26:58,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671838730] [2025-03-13 22:26:58,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671838730] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:26:58,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:26:58,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-13 22:26:58,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786442815] [2025-03-13 22:26:58,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:26:58,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-13 22:26:58,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:26:58,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-13 22:26:58,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-13 22:26:58,230 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 118 [2025-03-13 22:26:58,230 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 124 transitions, 387 flow. Second operand has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-03-13 22:26:58,230 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:26:58,230 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 118 [2025-03-13 22:26:58,230 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:26:58,384 INFO L124 PetriNetUnfolderBase]: 204/2065 cut-off events. [2025-03-13 22:26:58,384 INFO L125 PetriNetUnfolderBase]: For 544/750 co-relation queries the response was YES. [2025-03-13 22:26:58,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3047 conditions, 2065 events. 204/2065 cut-off events. For 544/750 co-relation queries the response was YES. Maximal size of possible extension queue 111. Compared 19588 event pairs, 61 based on Foata normal form. 33/1878 useless extension candidates. Maximal degree in co-relation 3032. Up to 257 conditions per place. [2025-03-13 22:26:58,394 INFO L140 encePairwiseOnDemand]: 112/118 looper letters, 26 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-03-13 22:26:58,394 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 135 transitions, 510 flow [2025-03-13 22:26:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-13 22:26:58,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-03-13 22:26:58,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2025-03-13 22:26:58,395 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8389830508474576 [2025-03-13 22:26:58,395 INFO L175 Difference]: Start difference. First operand has 124 places, 124 transitions, 387 flow. Second operand 5 states and 495 transitions. [2025-03-13 22:26:58,396 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 135 transitions, 510 flow [2025-03-13 22:26:58,397 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 135 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:26:58,399 INFO L231 Difference]: Finished difference. Result has 129 places, 125 transitions, 421 flow [2025-03-13 22:26:58,399 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=118, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=122, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=421, PETRI_PLACES=129, PETRI_TRANSITIONS=125} [2025-03-13 22:26:58,400 INFO L279 CegarLoopForPetriNet]: 115 programPoint places, 14 predicate places. [2025-03-13 22:26:58,400 INFO L471 AbstractCegarLoop]: Abstraction has has 129 places, 125 transitions, 421 flow [2025-03-13 22:26:58,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 95.25) internal successors, (381), 4 states have internal predecessors, (381), 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-03-13 22:26:58,400 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:26:58,401 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-13 22:26:58,401 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-13 22:26:58,401 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting salethreadErr2ASSERT_VIOLATIONDATA_RACE === [salethreadErr3ASSERT_VIOLATIONDATA_RACE, salethreadErr2ASSERT_VIOLATIONDATA_RACE, salethreadErr0ASSERT_VIOLATIONDATA_RACE (and 16 more)] === [2025-03-13 22:26:58,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:26:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1376818680, now seen corresponding path program 1 times [2025-03-13 22:26:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:26:58,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525340132] [2025-03-13 22:26:58,401 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:26:58,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:26:58,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:26:58,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:26:58,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:26:58,421 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-13 22:26:58,424 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-13 22:26:58,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-13 22:26:58,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:26:58,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-13 22:26:58,441 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-13 22:26:58,442 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (18 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (17 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (16 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (15 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (14 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (12 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (11 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (10 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (6 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr2ASSERT_VIOLATIONDATA_RACE (5 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (4 of 19 remaining) [2025-03-13 22:26:58,442 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (3 of 19 remaining) [2025-03-13 22:26:58,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr3ASSERT_VIOLATIONDATA_RACE (2 of 19 remaining) [2025-03-13 22:26:58,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr0ASSERT_VIOLATIONDATA_RACE (1 of 19 remaining) [2025-03-13 22:26:58,443 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location salethreadErr1ASSERT_VIOLATIONDATA_RACE (0 of 19 remaining) [2025-03-13 22:26:58,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:26:58,443 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:26:58,498 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-03-13 22:26:58,498 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-13 22:26:58,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.03 10:26:58 BasicIcfg [2025-03-13 22:26:58,504 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-13 22:26:58,504 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-13 22:26:58,504 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-13 22:26:58,504 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-13 22:26:58,505 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:26:54" (3/4) ... [2025-03-13 22:26:58,505 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-13 22:26:58,546 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-03-13 22:26:58,578 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-13 22:26:58,579 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-13 22:26:58,579 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-13 22:26:58,579 INFO L158 Benchmark]: Toolchain (without parser) took 4380.13ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 121.0MB in the beginning and 143.1MB in the end (delta: -22.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,579 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:58,579 INFO L158 Benchmark]: CACSL2BoogieTranslator took 350.26ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,580 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.20ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,580 INFO L158 Benchmark]: Boogie Preprocessor took 21.10ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-13 22:26:58,580 INFO L158 Benchmark]: IcfgBuilder took 320.84ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 79.6MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,580 INFO L158 Benchmark]: TraceAbstraction took 3584.59ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.1MB in the beginning and 158.2MB in the end (delta: -79.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,580 INFO L158 Benchmark]: Witness Printer took 74.48ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 143.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-13 22:26:58,581 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.22ms. Allocated memory is still 201.3MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 350.26ms. Allocated memory is still 167.8MB. Free memory was 121.0MB in the beginning and 101.5MB in the end (delta: 19.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.20ms. Allocated memory is still 167.8MB. Free memory was 101.5MB in the beginning and 100.0MB in the end (delta: 1.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.10ms. Allocated memory is still 167.8MB. Free memory was 100.0MB in the beginning and 98.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 320.84ms. Allocated memory is still 167.8MB. Free memory was 98.6MB in the beginning and 79.6MB in the end (delta: 19.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 3584.59ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 79.1MB in the beginning and 158.2MB in the end (delta: -79.1MB). Peak memory consumption was 60.9MB. Max. memory is 16.1GB. * Witness Printer took 74.48ms. Allocated memory is still 201.3MB. Free memory was 158.2MB in the beginning and 143.1MB in the end (delta: 15.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 722]: Data race detected Data race detected The following path leads to a data race: [L717] 0 int numberOfSeatsSold; VAL [numberOfSeatsSold=0] [L718] 0 int stopSales; VAL [numberOfSeatsSold=0, stopSales=0] [L719] 0 int numOfTickets; VAL [numOfTickets=0, numberOfSeatsSold=0, stopSales=0] [L736] 0 pthread_t salethreads[25]; VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, numOfTickets=0, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L738] 0 numOfTickets = 25 VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L741] 0 numberOfSeatsSold = 0 VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L744] 0 stopSales = 0 VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 int i = 0; VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(argc)=101, \old(argv)={105:103}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={105:103}, argc=101, i=0, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] 0 i++ VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={105:103}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L746] COND TRUE 0 i < 25 VAL [\old(arg)={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L747] 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={105:103}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L747] FCALL, FORK 0 pthread_create(&salethreads[i], 0, salethread, ((void *)0)) VAL [\old(arg)={0:0}, \old(argc)=101, \old(argv)={105:103}, argc=101, i=1, numOfTickets=25, numberOfSeatsSold=0, salethreads={8:0}, stopSales=0] [L721] 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 1 !stopSales VAL [\old(arg)={0:0}, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 1 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L723] COND FALSE 1 !(_numberOfSeatsSold >= (25 - (((25 / 10) == 0) ? 1 : (25 / 10)))) VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] 2 !stopSales VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L721] COND TRUE 2 !stopSales VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=0, stopSales=0] [L729] 1 numberOfSeatsSold = _numberOfSeatsSold + 1 VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] [L722] 2 int _numberOfSeatsSold = numberOfSeatsSold; VAL [\old(arg)={0:0}, _numberOfSeatsSold=0, arg={0:0}, numOfTickets=25, numberOfSeatsSold=1, stopSales=0] Now there is a data race on ~numberOfSeatsSold~0 between C: numberOfSeatsSold = _numberOfSeatsSold + 1 [729] and C: int _numberOfSeatsSold = numberOfSeatsSold; [722] - UnprovableResult [Line: 721]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 725]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 738]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 741]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 752]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 750]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 111 locations, 15 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: 1.5s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 169 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 102 mSDsluCounter, 13 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 251 IncrementalHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 9 mSDtfsCounter, 251 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=211occurred in iteration=5, InterpolantAutomatonStates: 23, 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, 233 NumberOfCodeBlocks, 233 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 129 locations, 19 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: 1.9s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 276 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 166 mSDsluCounter, 62 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 25 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 531 IncrementalHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 37 mSDtfsCounter, 531 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=8, InterpolantAutomatonStates: 33, 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.4s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 296 ConstructedInterpolants, 0 QuantifiedInterpolants, 613 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 5/5 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-13 22:26:58,597 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)