./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/ldv-races/race-1_2b-join.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-races/race-1_2b-join.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 475c64db2a2029c09985266553634853aa5ae7653363254bdcc8a56a9d27dc04 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:26:42,683 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:26:42,743 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:26:42,748 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:26:42,748 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:26:42,777 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:26:42,778 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:26:42,778 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:26:42,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:26:42,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:26:42,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:26:42,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:26:42,780 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:26:42,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:26:42,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:26:42,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:42,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:26:42,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:26:42,783 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 475c64db2a2029c09985266553634853aa5ae7653363254bdcc8a56a9d27dc04 [2025-02-08 05:26:43,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:26:43,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:26:43,039 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:26:43,041 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:26:43,041 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:26:43,042 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-races/race-1_2b-join.i [2025-02-08 05:26:44,223 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/365c6ab5a/db15d159c9e544eabdbcf4cdbfc72c30/FLAG62928bb1f [2025-02-08 05:26:44,609 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:26:44,609 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-races/race-1_2b-join.i [2025-02-08 05:26:44,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/365c6ab5a/db15d159c9e544eabdbcf4cdbfc72c30/FLAG62928bb1f [2025-02-08 05:26:44,647 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/365c6ab5a/db15d159c9e544eabdbcf4cdbfc72c30 [2025-02-08 05:26:44,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:26:44,651 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:26:44,652 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:44,652 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:26:44,655 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:26:44,656 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:44" (1/1) ... [2025-02-08 05:26:44,658 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c1344bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:44, skipping insertion in model container [2025-02-08 05:26:44,658 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:26:44" (1/1) ... [2025-02-08 05:26:44,686 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:26:45,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:45,060 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:26:45,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:26:45,186 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:26:45,186 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45 WrapperNode [2025-02-08 05:26:45,186 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:26:45,191 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:45,191 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:26:45,191 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:26:45,199 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,221 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,237 INFO L138 Inliner]: procedures = 481, calls = 25, calls flagged for inlining = 9, calls inlined = 12, statements flattened = 119 [2025-02-08 05:26:45,237 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:26:45,238 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:26:45,238 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:26:45,239 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:26:45,243 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,244 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,247 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,247 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,254 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,255 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,257 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,257 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,260 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:26:45,261 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:26:45,261 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:26:45,261 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:26:45,262 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (1/1) ... [2025-02-08 05:26:45,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:26:45,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:26:45,289 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:26:45,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:26:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:26:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:26:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:26:45,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:26:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:26:45,306 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:26:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:26:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:26:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-02-08 05:26:45,306 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-02-08 05:26:45,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:26:45,307 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:26:45,519 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:26:45,520 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:26:45,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1710: assume { :end_inline_ldv_assert } true;module_init_#res#1 := 0; [2025-02-08 05:26:45,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1710-1: havoc ldv_assert_#in~expression#1; [2025-02-08 05:26:45,683 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1710-2: havoc ldv_assert_~expression#1; [2025-02-08 05:26:45,684 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:26:45,684 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:26:45,696 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:26:45,697 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:26:45,697 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:45 BoogieIcfgContainer [2025-02-08 05:26:45,697 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:26:45,699 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:26:45,699 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:26:45,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:26:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:26:44" (1/3) ... [2025-02-08 05:26:45,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e171461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:45, skipping insertion in model container [2025-02-08 05:26:45,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:26:45" (2/3) ... [2025-02-08 05:26:45,707 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e171461 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:26:45, skipping insertion in model container [2025-02-08 05:26:45,707 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:45" (3/3) ... [2025-02-08 05:26:45,708 INFO L128 eAbstractionObserver]: Analyzing ICFG race-1_2b-join.i [2025-02-08 05:26:45,723 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:26:45,725 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-1_2b-join.i that has 2 procedures, 153 locations, 1 initial locations, 0 loop locations, and 11 error locations. [2025-02-08 05:26:45,725 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:26:45,779 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:26:45,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 156 places, 160 transitions, 327 flow [2025-02-08 05:26:45,857 INFO L124 PetriNetUnfolderBase]: 6/127 cut-off events. [2025-02-08 05:26:45,859 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:45,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 6/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 200 event pairs, 0 based on Foata normal form. 0/110 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-02-08 05:26:45,864 INFO L82 GeneralOperation]: Start removeDead. Operand has 156 places, 160 transitions, 327 flow [2025-02-08 05:26:45,868 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 124 transitions, 251 flow [2025-02-08 05:26:45,875 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:26:45,884 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;@513a3aef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:26:45,888 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 05:26:45,895 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:26:45,896 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2025-02-08 05:26:45,896 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:26:45,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:45,897 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:45,898 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1545973533, now seen corresponding path program 1 times [2025-02-08 05:26:45,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:45,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356068247] [2025-02-08 05:26:45,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:46,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-02-08 05:26:46,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-02-08 05:26:46,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:46,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:46,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:46,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:46,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356068247] [2025-02-08 05:26:46,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356068247] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:46,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:46,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:46,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696848761] [2025-02-08 05:26:46,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:46,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:46,227 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:46,227 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:46,276 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 160 [2025-02-08 05:26:46,279 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 251 flow. Second operand has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,279 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:46,279 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 160 [2025-02-08 05:26:46,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:46,307 INFO L124 PetriNetUnfolderBase]: 6/141 cut-off events. [2025-02-08 05:26:46,307 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:46,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 173 conditions, 141 events. 6/141 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 326 event pairs, 6 based on Foata normal form. 8/134 useless extension candidates. Maximal degree in co-relation 79. Up to 26 conditions per place. [2025-02-08 05:26:46,308 INFO L140 encePairwiseOnDemand]: 151/160 looper letters, 13 selfloop transitions, 2 changer transitions 6/111 dead transitions. [2025-02-08 05:26:46,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 111 transitions, 255 flow [2025-02-08 05:26:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:46,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-02-08 05:26:46,317 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8520833333333333 [2025-02-08 05:26:46,322 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 251 flow. Second operand 3 states and 409 transitions. [2025-02-08 05:26:46,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 111 transitions, 255 flow [2025-02-08 05:26:46,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 111 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:26:46,328 INFO L231 Difference]: Finished difference. Result has 116 places, 105 transitions, 216 flow [2025-02-08 05:26:46,329 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=216, PETRI_PLACES=116, PETRI_TRANSITIONS=105} [2025-02-08 05:26:46,331 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -6 predicate places. [2025-02-08 05:26:46,331 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 105 transitions, 216 flow [2025-02-08 05:26:46,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 130.33333333333334) internal successors, (391), 3 states have internal predecessors, (391), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,332 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:46,332 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] [2025-02-08 05:26:46,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:26:46,332 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:46,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:46,333 INFO L85 PathProgramCache]: Analyzing trace with hash -1163016675, now seen corresponding path program 1 times [2025-02-08 05:26:46,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:46,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488024244] [2025-02-08 05:26:46,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:46,350 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-02-08 05:26:46,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-02-08 05:26:46,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:46,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:46,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488024244] [2025-02-08 05:26:46,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488024244] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:46,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:46,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:46,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571997326] [2025-02-08 05:26:46,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:46,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:46,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:46,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:46,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:46,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 160 [2025-02-08 05:26:46,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 105 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:46,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 160 [2025-02-08 05:26:46,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:46,543 INFO L124 PetriNetUnfolderBase]: 10/172 cut-off events. [2025-02-08 05:26:46,543 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:46,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 217 conditions, 172 events. 10/172 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 481 event pairs, 4 based on Foata normal form. 0/153 useless extension candidates. Maximal degree in co-relation 186. Up to 20 conditions per place. [2025-02-08 05:26:46,544 INFO L140 encePairwiseOnDemand]: 150/160 looper letters, 11 selfloop transitions, 7 changer transitions 1/108 dead transitions. [2025-02-08 05:26:46,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 260 flow [2025-02-08 05:26:46,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:46,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:46,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2025-02-08 05:26:46,548 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395833333333333 [2025-02-08 05:26:46,548 INFO L175 Difference]: Start difference. First operand has 116 places, 105 transitions, 216 flow. Second operand 3 states and 403 transitions. [2025-02-08 05:26:46,548 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 260 flow [2025-02-08 05:26:46,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:46,551 INFO L231 Difference]: Finished difference. Result has 110 places, 106 transitions, 250 flow [2025-02-08 05:26:46,551 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=250, PETRI_PLACES=110, PETRI_TRANSITIONS=106} [2025-02-08 05:26:46,554 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2025-02-08 05:26:46,554 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 106 transitions, 250 flow [2025-02-08 05:26:46,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,555 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:46,555 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] [2025-02-08 05:26:46,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:26:46,555 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:46,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 261463814, now seen corresponding path program 1 times [2025-02-08 05:26:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:46,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727640666] [2025-02-08 05:26:46,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:46,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:46,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-02-08 05:26:46,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-02-08 05:26:46,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:46,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:46,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:46,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727640666] [2025-02-08 05:26:46,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1727640666] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:46,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:46,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:46,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077215651] [2025-02-08 05:26:46,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:46,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:46,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:46,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:46,657 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:46,700 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 160 [2025-02-08 05:26:46,701 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 106 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,701 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:46,701 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 160 [2025-02-08 05:26:46,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:46,731 INFO L124 PetriNetUnfolderBase]: 6/158 cut-off events. [2025-02-08 05:26:46,731 INFO L125 PetriNetUnfolderBase]: For 33/33 co-relation queries the response was YES. [2025-02-08 05:26:46,731 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 158 events. 6/158 cut-off events. For 33/33 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 396 event pairs, 4 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 135. Up to 29 conditions per place. [2025-02-08 05:26:46,732 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 15 selfloop transitions, 2 changer transitions 0/105 dead transitions. [2025-02-08 05:26:46,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 105 transitions, 282 flow [2025-02-08 05:26:46,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:46,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:46,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 403 transitions. [2025-02-08 05:26:46,733 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8395833333333333 [2025-02-08 05:26:46,733 INFO L175 Difference]: Start difference. First operand has 110 places, 106 transitions, 250 flow. Second operand 3 states and 403 transitions. [2025-02-08 05:26:46,733 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 105 transitions, 282 flow [2025-02-08 05:26:46,734 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 105 transitions, 268 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:46,735 INFO L231 Difference]: Finished difference. Result has 109 places, 105 transitions, 238 flow [2025-02-08 05:26:46,736 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=238, PETRI_PLACES=109, PETRI_TRANSITIONS=105} [2025-02-08 05:26:46,736 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2025-02-08 05:26:46,736 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 105 transitions, 238 flow [2025-02-08 05:26:46,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,737 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:46,737 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:46,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:26:46,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:46,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:46,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1360149903, now seen corresponding path program 1 times [2025-02-08 05:26:46,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:46,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613650328] [2025-02-08 05:26:46,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:46,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:46,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-08 05:26:46,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 05:26:46,777 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:46,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:46,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:46,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:46,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613650328] [2025-02-08 05:26:46,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613650328] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:46,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:46,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212589375] [2025-02-08 05:26:46,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:46,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:46,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:46,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:46,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:46,860 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 160 [2025-02-08 05:26:46,860 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 105 transitions, 238 flow. Second operand has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:46,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 160 [2025-02-08 05:26:46,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:46,885 INFO L124 PetriNetUnfolderBase]: 4/155 cut-off events. [2025-02-08 05:26:46,886 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:26:46,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 155 events. 4/155 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 399 event pairs, 0 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 166. Up to 12 conditions per place. [2025-02-08 05:26:46,888 INFO L140 encePairwiseOnDemand]: 157/160 looper letters, 10 selfloop transitions, 2 changer transitions 0/106 dead transitions. [2025-02-08 05:26:46,888 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 106 transitions, 264 flow [2025-02-08 05:26:46,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:46,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2025-02-08 05:26:46,890 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8770833333333333 [2025-02-08 05:26:46,890 INFO L175 Difference]: Start difference. First operand has 109 places, 105 transitions, 238 flow. Second operand 3 states and 421 transitions. [2025-02-08 05:26:46,890 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 106 transitions, 264 flow [2025-02-08 05:26:46,891 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 106 transitions, 260 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:46,893 INFO L231 Difference]: Finished difference. Result has 108 places, 104 transitions, 236 flow [2025-02-08 05:26:46,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=108, PETRI_TRANSITIONS=104} [2025-02-08 05:26:46,895 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2025-02-08 05:26:46,895 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 104 transitions, 236 flow [2025-02-08 05:26:46,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,896 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:46,896 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:46,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:26:46,896 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:46,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:46,897 INFO L85 PathProgramCache]: Analyzing trace with hash 2015731974, now seen corresponding path program 1 times [2025-02-08 05:26:46,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:46,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652879468] [2025-02-08 05:26:46,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:46,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:46,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:26:46,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:26:46,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:46,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:46,957 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:46,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:46,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652879468] [2025-02-08 05:26:46,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652879468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:46,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:46,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:46,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640175475] [2025-02-08 05:26:46,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:46,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:46,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:46,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:46,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:46,990 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 160 [2025-02-08 05:26:46,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 104 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:46,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:46,990 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 160 [2025-02-08 05:26:46,990 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:47,009 INFO L124 PetriNetUnfolderBase]: 14/185 cut-off events. [2025-02-08 05:26:47,009 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2025-02-08 05:26:47,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 274 conditions, 185 events. 14/185 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 630 event pairs, 7 based on Foata normal form. 0/168 useless extension candidates. Maximal degree in co-relation 190. Up to 43 conditions per place. [2025-02-08 05:26:47,010 INFO L140 encePairwiseOnDemand]: 154/160 looper letters, 14 selfloop transitions, 6 changer transitions 1/108 dead transitions. [2025-02-08 05:26:47,010 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 108 transitions, 288 flow [2025-02-08 05:26:47,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:47,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:47,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2025-02-08 05:26:47,011 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8583333333333333 [2025-02-08 05:26:47,011 INFO L175 Difference]: Start difference. First operand has 108 places, 104 transitions, 236 flow. Second operand 3 states and 412 transitions. [2025-02-08 05:26:47,011 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 108 transitions, 288 flow [2025-02-08 05:26:47,012 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 108 transitions, 284 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:47,013 INFO L231 Difference]: Finished difference. Result has 110 places, 107 transitions, 274 flow [2025-02-08 05:26:47,013 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=274, PETRI_PLACES=110, PETRI_TRANSITIONS=107} [2025-02-08 05:26:47,014 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -12 predicate places. [2025-02-08 05:26:47,014 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 107 transitions, 274 flow [2025-02-08 05:26:47,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:47,014 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:47,014 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:47,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:26:47,015 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:47,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 45402590, now seen corresponding path program 1 times [2025-02-08 05:26:47,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:47,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878949526] [2025-02-08 05:26:47,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:47,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:47,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-02-08 05:26:47,029 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-02-08 05:26:47,029 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:47,029 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:26:47,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:26:47,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:26:47,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878949526] [2025-02-08 05:26:47,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878949526] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:26:47,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:26:47,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:26:47,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836745074] [2025-02-08 05:26:47,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:26:47,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:26:47,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:26:47,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:26:47,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:26:47,092 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 160 [2025-02-08 05:26:47,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 107 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:47,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:26:47,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 160 [2025-02-08 05:26:47,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:26:47,118 INFO L124 PetriNetUnfolderBase]: 26/233 cut-off events. [2025-02-08 05:26:47,118 INFO L125 PetriNetUnfolderBase]: For 73/76 co-relation queries the response was YES. [2025-02-08 05:26:47,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 410 conditions, 233 events. 26/233 cut-off events. For 73/76 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 886 event pairs, 9 based on Foata normal form. 2/222 useless extension candidates. Maximal degree in co-relation 324. Up to 53 conditions per place. [2025-02-08 05:26:47,119 INFO L140 encePairwiseOnDemand]: 155/160 looper letters, 18 selfloop transitions, 5 changer transitions 4/112 dead transitions. [2025-02-08 05:26:47,119 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 340 flow [2025-02-08 05:26:47,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:26:47,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:26:47,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 409 transitions. [2025-02-08 05:26:47,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8520833333333333 [2025-02-08 05:26:47,121 INFO L175 Difference]: Start difference. First operand has 110 places, 107 transitions, 274 flow. Second operand 3 states and 409 transitions. [2025-02-08 05:26:47,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 340 flow [2025-02-08 05:26:47,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:26:47,123 INFO L231 Difference]: Finished difference. Result has 112 places, 107 transitions, 286 flow [2025-02-08 05:26:47,123 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=160, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=112, PETRI_TRANSITIONS=107} [2025-02-08 05:26:47,124 INFO L279 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2025-02-08 05:26:47,124 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 107 transitions, 286 flow [2025-02-08 05:26:47,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.33333333333334) internal successors, (394), 3 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:26:47,124 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:26:47,124 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:47,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:26:47,125 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:26:47,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:26:47,125 INFO L85 PathProgramCache]: Analyzing trace with hash 377928411, now seen corresponding path program 1 times [2025-02-08 05:26:47,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:26:47,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212953756] [2025-02-08 05:26:47,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:26:47,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:26:47,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:26:47,172 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:26:47,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:47,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:47,172 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:26:47,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:26:47,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:26:47,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:26:47,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:26:47,193 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:26:47,193 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:26:47,194 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2025-02-08 05:26:47,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-08 05:26:47,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-08 05:26:47,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-08 05:26:47,195 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-08 05:26:47,196 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 13 remaining) [2025-02-08 05:26:47,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:26:47,196 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:26:47,215 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-02-08 05:26:47,215 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-08 05:26:47,219 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.02 05:26:47 BasicIcfg [2025-02-08 05:26:47,219 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-08 05:26:47,219 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-08 05:26:47,219 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-08 05:26:47,219 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-08 05:26:47,220 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:26:45" (3/4) ... [2025-02-08 05:26:47,221 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-08 05:26:47,250 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 6. [2025-02-08 05:26:47,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-08 05:26:47,282 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-08 05:26:47,282 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-08 05:26:47,283 INFO L158 Benchmark]: Toolchain (without parser) took 2632.32ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 103.3MB in the beginning and 279.8MB in the end (delta: -176.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2025-02-08 05:26:47,283 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:47,283 INFO L158 Benchmark]: CACSL2BoogieTranslator took 538.42ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 49.2MB in the end (delta: 54.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-02-08 05:26:47,284 INFO L158 Benchmark]: Boogie Procedure Inliner took 46.69ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 46.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:47,284 INFO L158 Benchmark]: Boogie Preprocessor took 21.68ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 44.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:47,284 INFO L158 Benchmark]: IcfgBuilder took 436.52ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 90.0MB in the end (delta: -45.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. [2025-02-08 05:26:47,284 INFO L158 Benchmark]: TraceAbstraction took 1519.95ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 89.3MB in the beginning and 288.0MB in the end (delta: -198.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-08 05:26:47,284 INFO L158 Benchmark]: Witness Printer took 63.05ms. Allocated memory is still 335.5MB. Free memory was 288.0MB in the beginning and 279.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-08 05:26:47,285 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.20ms. Allocated memory is still 201.3MB. Free memory is still 128.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 538.42ms. Allocated memory is still 142.6MB. Free memory was 103.3MB in the beginning and 49.2MB in the end (delta: 54.1MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 46.69ms. Allocated memory is still 142.6MB. Free memory was 49.2MB in the beginning and 46.2MB in the end (delta: 3.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 21.68ms. Allocated memory is still 142.6MB. Free memory was 46.2MB in the beginning and 44.5MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 436.52ms. Allocated memory is still 142.6MB. Free memory was 44.5MB in the beginning and 90.0MB in the end (delta: -45.6MB). Peak memory consumption was 23.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1519.95ms. Allocated memory was 142.6MB in the beginning and 335.5MB in the end (delta: 192.9MB). Free memory was 89.3MB in the beginning and 288.0MB in the end (delta: -198.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 63.05ms. Allocated memory is still 335.5MB. Free memory was 288.0MB in the beginning and 279.8MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 1699]: Data race detected Data race detected The following path leads to a data race: [L1694] 0 pthread_t t1; VAL [t1=0] [L1695] 0 pthread_mutex_t mutex; VAL [mutex={3:0}, t1=0] [L1696] 0 int pdev; VAL [mutex={3:0}, pdev=0, t1=0] [L1726] CALL 0 module_init() [L1705] 0 pdev = 1 VAL [mutex={3:0}, pdev=1, t1=0] [L1706] EXPR 0 pdev==1 VAL [mutex={3:0}, pdev=1, t1=0] [L1706] CALL 0 ldv_assert(pdev==1) [L1693] COND FALSE 0 !(!expression) VAL [\old(expression)=1, expression=1, mutex={3:0}, pdev=1, t1=0] [L1706] RET 0 ldv_assert(pdev==1) [L1707] COND TRUE 0 __VERIFIER_nondet_int() VAL [mutex={3:0}, pdev=1, t1=0] [L1708] 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [mutex={3:0}, pdev=1, t1=-1] [L1708] FCALL, FORK 0 pthread_create(&t1, ((void *)0), thread1, ((void *)0)) VAL [\old(arg)={0:0}, mutex={3:0}, pdev=1, t1=-1] [L1709] 0 pdev = 2 VAL [\old(arg)={0:0}, mutex={3:0}, pdev=2, t1=-1] [L1699] 1 pdev = 6 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] [L1709] 0 pdev = 2 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] [L1699] 1 pdev = 6 VAL [\old(arg)={0:0}, arg={0:0}, mutex={3:0}, pdev=6, t1=-1] Now there is a data race on ~pdev~0 between C: pdev = 2 [1709] and C: pdev = 6 [1699] - UnprovableResult [Line: 1705]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1706]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1713]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1708]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1714]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1710]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1722]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1723]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 1708]: 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, 168 locations, 13 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.4s, OverallIterations: 7, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 285 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 91 mSDsluCounter, 15 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 15 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 275 IncrementalHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 15 mSolverCounterUnsat, 15 mSDtfsCounter, 275 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=286occurred in iteration=6, InterpolantAutomatonStates: 18, 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, 294 NumberOfCodeBlocks, 294 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 231 ConstructedInterpolants, 0 QuantifiedInterpolants, 243 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-02-08 05:26:47,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(DATA-RACE)