./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 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/goblint-regression/13-privatized_24-multiple-protecting_true.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 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:25:56,905 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:25:56,957 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:25:56,961 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:25:56,961 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:25:56,975 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:25:56,975 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:25:56,975 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:25:56,976 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:25:56,976 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:25:56,976 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:25:56,976 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:25:56,977 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:25:56,978 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:56,978 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:56,978 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:25:56,978 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:25:56,979 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:25:56,979 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:25:56,979 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:25:56,979 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:25:56,979 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 -> 5a41a1715a056c3cefb9e5b0430ae444adde5aa2f4e6078578085bf381d921cf [2025-01-09 21:25:57,167 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:25:57,172 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:25:57,174 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:25:57,174 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:25:57,175 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:25:57,175 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-01-09 21:25:58,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf39a89b/90ee3d47c95d45459732b9211ea6fc87/FLAGd69475616 [2025-01-09 21:25:58,580 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:25:58,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/13-privatized_24-multiple-protecting_true.i [2025-01-09 21:25:58,589 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf39a89b/90ee3d47c95d45459732b9211ea6fc87/FLAGd69475616 [2025-01-09 21:25:58,853 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/adf39a89b/90ee3d47c95d45459732b9211ea6fc87 [2025-01-09 21:25:58,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:25:58,856 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:25:58,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:58,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:25:58,860 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:25:58,861 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:58" (1/1) ... [2025-01-09 21:25:58,862 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@19f6efad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:58, skipping insertion in model container [2025-01-09 21:25:58,862 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:25:58" (1/1) ... [2025-01-09 21:25:58,883 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:25:59,084 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:59,105 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:25:59,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:25:59,171 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:25:59,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59 WrapperNode [2025-01-09 21:25:59,174 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:25:59,174 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:59,174 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:25:59,174 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:25:59,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,197 INFO L138 Inliner]: procedures = 162, calls = 54, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 117 [2025-01-09 21:25:59,197 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:25:59,197 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:25:59,197 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:25:59,197 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:25:59,203 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,203 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,205 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,205 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,209 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,209 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,210 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,211 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,212 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,213 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:25:59,214 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:25:59,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:25:59,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:25:59,214 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (1/1) ... [2025-01-09 21:25:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:25:59,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:59,243 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-01-09 21:25:59,245 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-01-09 21:25:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:25:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:25:59,258 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:25:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:25:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:25:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:25:59,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:25:59,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:25:59,260 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:25:59,333 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:25:59,335 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:25:59,584 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:25:59,584 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:25:59,643 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:25:59,643 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:25:59,644 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:59 BoogieIcfgContainer [2025-01-09 21:25:59,644 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:25:59,645 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:25:59,645 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:25:59,649 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:25:59,649 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:25:58" (1/3) ... [2025-01-09 21:25:59,649 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bed368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:59, skipping insertion in model container [2025-01-09 21:25:59,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:25:59" (2/3) ... [2025-01-09 21:25:59,650 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bed368 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:25:59, skipping insertion in model container [2025-01-09 21:25:59,650 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:59" (3/3) ... [2025-01-09 21:25:59,651 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_24-multiple-protecting_true.i [2025-01-09 21:25:59,661 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:25:59,662 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_24-multiple-protecting_true.i that has 2 procedures, 196 locations, 1 initial locations, 0 loop locations, and 12 error locations. [2025-01-09 21:25:59,662 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:25:59,737 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:25:59,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 203 transitions, 413 flow [2025-01-09 21:25:59,856 INFO L124 PetriNetUnfolderBase]: 8/202 cut-off events. [2025-01-09 21:25:59,859 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:25:59,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 202 events. 8/202 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 256 event pairs, 0 based on Foata normal form. 0/182 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2025-01-09 21:25:59,866 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 203 transitions, 413 flow [2025-01-09 21:25:59,873 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 193 places, 197 transitions, 397 flow [2025-01-09 21:25:59,883 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:25:59,897 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;@6ceba95e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:25:59,898 INFO L334 AbstractCegarLoop]: Starting to check reachability of 21 error locations. [2025-01-09 21:25:59,912 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:25:59,915 INFO L124 PetriNetUnfolderBase]: 0/49 cut-off events. [2025-01-09 21:25:59,915 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:25:59,915 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:25:59,916 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-01-09 21:25:59,916 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:25:59,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:25:59,924 INFO L85 PathProgramCache]: Analyzing trace with hash -849867250, now seen corresponding path program 1 times [2025-01-09 21:25:59,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:25:59,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96113698] [2025-01-09 21:25:59,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:59,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:25:59,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-09 21:26:00,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-09 21:26:00,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:00,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:00,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:00,113 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:00,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96113698] [2025-01-09 21:26:00,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96113698] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:00,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:00,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657055205] [2025-01-09 21:26:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:00,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:00,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:00,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:00,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:00,200 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 148 out of 203 [2025-01-09 21:26:00,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 197 transitions, 397 flow. Second operand has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-01-09 21:26:00,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:00,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 148 of 203 [2025-01-09 21:26:00,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:00,636 INFO L124 PetriNetUnfolderBase]: 521/2881 cut-off events. [2025-01-09 21:26:00,636 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:26:00,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4002 conditions, 2881 events. 521/2881 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 23150 event pairs, 104 based on Foata normal form. 234/2840 useless extension candidates. Maximal degree in co-relation 3960. Up to 662 conditions per place. [2025-01-09 21:26:00,650 INFO L140 encePairwiseOnDemand]: 180/203 looper letters, 62 selfloop transitions, 10 changer transitions 0/211 dead transitions. [2025-01-09 21:26:00,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 185 places, 211 transitions, 569 flow [2025-01-09 21:26:00,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:00,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:00,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 537 transitions. [2025-01-09 21:26:00,661 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8817733990147784 [2025-01-09 21:26:00,662 INFO L175 Difference]: Start difference. First operand has 193 places, 197 transitions, 397 flow. Second operand 3 states and 537 transitions. [2025-01-09 21:26:00,663 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 185 places, 211 transitions, 569 flow [2025-01-09 21:26:00,666 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 184 places, 211 transitions, 568 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:26:00,669 INFO L231 Difference]: Finished difference. Result has 186 places, 187 transitions, 438 flow [2025-01-09 21:26:00,671 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=360, PETRI_DIFFERENCE_MINUEND_PLACES=182, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=438, PETRI_PLACES=186, PETRI_TRANSITIONS=187} [2025-01-09 21:26:00,674 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -7 predicate places. [2025-01-09 21:26:00,674 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 187 transitions, 438 flow [2025-01-09 21:26:00,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.66666666666666) internal successors, (449), 3 states have internal predecessors, (449), 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-01-09 21:26:00,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:00,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:00,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:26:00,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:00,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:00,676 INFO L85 PathProgramCache]: Analyzing trace with hash -433555147, now seen corresponding path program 1 times [2025-01-09 21:26:00,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:00,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557900253] [2025-01-09 21:26:00,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:00,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:00,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-01-09 21:26:00,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-01-09 21:26:00,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:00,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:00,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:00,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:00,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557900253] [2025-01-09 21:26:00,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557900253] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:00,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:00,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775250019] [2025-01-09 21:26:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:00,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:00,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:00,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:00,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:00,769 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 203 [2025-01-09 21:26:00,769 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 187 transitions, 438 flow. Second operand has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-01-09 21:26:00,770 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:00,770 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2025-01-09 21:26:00,770 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:01,046 INFO L124 PetriNetUnfolderBase]: 506/2881 cut-off events. [2025-01-09 21:26:01,047 INFO L125 PetriNetUnfolderBase]: For 386/390 co-relation queries the response was YES. [2025-01-09 21:26:01,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4345 conditions, 2881 events. 506/2881 cut-off events. For 386/390 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 23228 event pairs, 355 based on Foata normal form. 4/2607 useless extension candidates. Maximal degree in co-relation 4302. Up to 979 conditions per place. [2025-01-09 21:26:01,059 INFO L140 encePairwiseOnDemand]: 196/203 looper letters, 52 selfloop transitions, 8 changer transitions 0/206 dead transitions. [2025-01-09 21:26:01,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 206 transitions, 612 flow [2025-01-09 21:26:01,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:01,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:01,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 516 transitions. [2025-01-09 21:26:01,061 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8472906403940886 [2025-01-09 21:26:01,061 INFO L175 Difference]: Start difference. First operand has 186 places, 187 transitions, 438 flow. Second operand 3 states and 516 transitions. [2025-01-09 21:26:01,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 206 transitions, 612 flow [2025-01-09 21:26:01,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 206 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:01,065 INFO L231 Difference]: Finished difference. Result has 188 places, 194 transitions, 490 flow [2025-01-09 21:26:01,065 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=418, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=490, PETRI_PLACES=188, PETRI_TRANSITIONS=194} [2025-01-09 21:26:01,066 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -5 predicate places. [2025-01-09 21:26:01,066 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 194 transitions, 490 flow [2025-01-09 21:26:01,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.33333333333334) internal successors, (469), 3 states have internal predecessors, (469), 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-01-09 21:26:01,066 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:01,066 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] [2025-01-09 21:26:01,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 21:26:01,066 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:01,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:01,067 INFO L85 PathProgramCache]: Analyzing trace with hash 631980611, now seen corresponding path program 1 times [2025-01-09 21:26:01,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:01,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938548167] [2025-01-09 21:26:01,067 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:01,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:01,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-09 21:26:01,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-09 21:26:01,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:01,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:01,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:01,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:01,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938548167] [2025-01-09 21:26:01,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938548167] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:01,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:01,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:26:01,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315397361] [2025-01-09 21:26:01,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:01,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 21:26:01,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:01,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 21:26:01,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 21:26:01,343 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 203 [2025-01-09 21:26:01,344 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 194 transitions, 490 flow. Second operand has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-01-09 21:26:01,344 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:01,344 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 203 [2025-01-09 21:26:01,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:01,505 INFO L124 PetriNetUnfolderBase]: 140/1327 cut-off events. [2025-01-09 21:26:01,505 INFO L125 PetriNetUnfolderBase]: For 53/56 co-relation queries the response was YES. [2025-01-09 21:26:01,506 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1827 conditions, 1327 events. 140/1327 cut-off events. For 53/56 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 8797 event pairs, 64 based on Foata normal form. 13/1233 useless extension candidates. Maximal degree in co-relation 1781. Up to 177 conditions per place. [2025-01-09 21:26:01,508 INFO L140 encePairwiseOnDemand]: 195/203 looper letters, 39 selfloop transitions, 8 changer transitions 2/206 dead transitions. [2025-01-09 21:26:01,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 206 transitions, 574 flow [2025-01-09 21:26:01,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:26:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:26:01,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 866 transitions. [2025-01-09 21:26:01,510 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8532019704433498 [2025-01-09 21:26:01,510 INFO L175 Difference]: Start difference. First operand has 188 places, 194 transitions, 490 flow. Second operand 5 states and 866 transitions. [2025-01-09 21:26:01,510 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 206 transitions, 574 flow [2025-01-09 21:26:01,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 206 transitions, 556 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:01,514 INFO L231 Difference]: Finished difference. Result has 189 places, 187 transitions, 448 flow [2025-01-09 21:26:01,514 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=414, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=184, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=448, PETRI_PLACES=189, PETRI_TRANSITIONS=187} [2025-01-09 21:26:01,514 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -4 predicate places. [2025-01-09 21:26:01,515 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 187 transitions, 448 flow [2025-01-09 21:26:01,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 164.4) internal successors, (822), 5 states have internal predecessors, (822), 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-01-09 21:26:01,515 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:01,515 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:01,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:26:01,515 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:01,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:01,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1036238888, now seen corresponding path program 1 times [2025-01-09 21:26:01,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:01,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497048081] [2025-01-09 21:26:01,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:01,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:01,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-01-09 21:26:01,527 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-01-09 21:26:01,527 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:01,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:01,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:01,549 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497048081] [2025-01-09 21:26:01,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497048081] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:01,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:01,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:01,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786466701] [2025-01-09 21:26:01,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:01,550 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:01,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:01,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:01,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:01,586 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 203 [2025-01-09 21:26:01,587 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 187 transitions, 448 flow. Second operand has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-01-09 21:26:01,587 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:01,587 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2025-01-09 21:26:01,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:01,707 INFO L124 PetriNetUnfolderBase]: 206/1481 cut-off events. [2025-01-09 21:26:01,708 INFO L125 PetriNetUnfolderBase]: For 238/239 co-relation queries the response was YES. [2025-01-09 21:26:01,709 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2309 conditions, 1481 events. 206/1481 cut-off events. For 238/239 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 10309 event pairs, 161 based on Foata normal form. 0/1370 useless extension candidates. Maximal degree in co-relation 2262. Up to 482 conditions per place. [2025-01-09 21:26:01,712 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 45 selfloop transitions, 4 changer transitions 0/193 dead transitions. [2025-01-09 21:26:01,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 193 transitions, 565 flow [2025-01-09 21:26:01,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:01,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:01,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 505 transitions. [2025-01-09 21:26:01,713 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8292282430213465 [2025-01-09 21:26:01,713 INFO L175 Difference]: Start difference. First operand has 189 places, 187 transitions, 448 flow. Second operand 3 states and 505 transitions. [2025-01-09 21:26:01,713 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 193 transitions, 565 flow [2025-01-09 21:26:01,715 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 193 transitions, 562 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:01,716 INFO L231 Difference]: Finished difference. Result has 191 places, 190 transitions, 479 flow [2025-01-09 21:26:01,716 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=445, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=183, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=479, PETRI_PLACES=191, PETRI_TRANSITIONS=190} [2025-01-09 21:26:01,717 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -2 predicate places. [2025-01-09 21:26:01,717 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 190 transitions, 479 flow [2025-01-09 21:26:01,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.66666666666666) internal successors, (473), 3 states have internal predecessors, (473), 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-01-09 21:26:01,717 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:01,717 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:01,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:26:01,718 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:01,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:01,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1878906357, now seen corresponding path program 1 times [2025-01-09 21:26:01,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:01,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452924645] [2025-01-09 21:26:01,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:01,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:01,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-01-09 21:26:01,731 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-01-09 21:26:01,731 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:01,731 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:01,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:01,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:01,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452924645] [2025-01-09 21:26:01,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452924645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:01,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:01,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:01,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041997448] [2025-01-09 21:26:01,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:01,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:01,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:01,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:01,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:01,771 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 203 [2025-01-09 21:26:01,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 190 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-01-09 21:26:01,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:01,772 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 203 [2025-01-09 21:26:01,772 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:01,943 INFO L124 PetriNetUnfolderBase]: 311/1966 cut-off events. [2025-01-09 21:26:01,943 INFO L125 PetriNetUnfolderBase]: For 215/219 co-relation queries the response was YES. [2025-01-09 21:26:01,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3046 conditions, 1966 events. 311/1966 cut-off events. For 215/219 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 14434 event pairs, 131 based on Foata normal form. 0/1837 useless extension candidates. Maximal degree in co-relation 2999. Up to 409 conditions per place. [2025-01-09 21:26:01,947 INFO L140 encePairwiseOnDemand]: 194/203 looper letters, 57 selfloop transitions, 6 changer transitions 3/217 dead transitions. [2025-01-09 21:26:01,947 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 217 transitions, 684 flow [2025-01-09 21:26:01,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:01,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:01,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 527 transitions. [2025-01-09 21:26:01,949 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8653530377668309 [2025-01-09 21:26:01,949 INFO L175 Difference]: Start difference. First operand has 191 places, 190 transitions, 479 flow. Second operand 3 states and 527 transitions. [2025-01-09 21:26:01,949 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 217 transitions, 684 flow [2025-01-09 21:26:01,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 189 places, 217 transitions, 674 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:01,952 INFO L231 Difference]: Finished difference. Result has 191 places, 192 transitions, 507 flow [2025-01-09 21:26:01,953 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=188, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=182, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=507, PETRI_PLACES=191, PETRI_TRANSITIONS=192} [2025-01-09 21:26:01,953 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -2 predicate places. [2025-01-09 21:26:01,953 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 192 transitions, 507 flow [2025-01-09 21:26:01,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 157.33333333333334) internal successors, (472), 3 states have internal predecessors, (472), 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-01-09 21:26:01,954 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:01,954 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:01,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:26:01,954 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:01,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:01,954 INFO L85 PathProgramCache]: Analyzing trace with hash -268824090, now seen corresponding path program 1 times [2025-01-09 21:26:01,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:01,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615467188] [2025-01-09 21:26:01,955 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:01,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:01,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 21:26:01,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 21:26:01,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:01,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:01,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:01,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:01,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615467188] [2025-01-09 21:26:01,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615467188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:01,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:01,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:01,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800429856] [2025-01-09 21:26:01,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:01,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:01,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:01,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:01,991 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:02,011 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 203 [2025-01-09 21:26:02,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 192 transitions, 507 flow. Second operand has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-01-09 21:26:02,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:02,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 203 [2025-01-09 21:26:02,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:02,180 INFO L124 PetriNetUnfolderBase]: 342/2016 cut-off events. [2025-01-09 21:26:02,180 INFO L125 PetriNetUnfolderBase]: For 441/445 co-relation queries the response was YES. [2025-01-09 21:26:02,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3362 conditions, 2016 events. 342/2016 cut-off events. For 441/445 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 15092 event pairs, 231 based on Foata normal form. 0/1880 useless extension candidates. Maximal degree in co-relation 3314. Up to 667 conditions per place. [2025-01-09 21:26:02,186 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 51 selfloop transitions, 4 changer transitions 0/207 dead transitions. [2025-01-09 21:26:02,186 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 207 transitions, 659 flow [2025-01-09 21:26:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:02,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:02,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:26:02,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505747126436781 [2025-01-09 21:26:02,188 INFO L175 Difference]: Start difference. First operand has 191 places, 192 transitions, 507 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:26:02,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 207 transitions, 659 flow [2025-01-09 21:26:02,190 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 191 places, 207 transitions, 645 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:02,192 INFO L231 Difference]: Finished difference. Result has 193 places, 195 transitions, 527 flow [2025-01-09 21:26:02,192 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=495, PETRI_DIFFERENCE_MINUEND_PLACES=189, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=192, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=188, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=527, PETRI_PLACES=193, PETRI_TRANSITIONS=195} [2025-01-09 21:26:02,192 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, 0 predicate places. [2025-01-09 21:26:02,192 INFO L471 AbstractCegarLoop]: Abstraction has has 193 places, 195 transitions, 527 flow [2025-01-09 21:26:02,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 160.33333333333334) internal successors, (481), 3 states have internal predecessors, (481), 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-01-09 21:26:02,193 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:02,193 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:02,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:26:02,193 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:02,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:02,194 INFO L85 PathProgramCache]: Analyzing trace with hash 2025854313, now seen corresponding path program 1 times [2025-01-09 21:26:02,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:02,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483717449] [2025-01-09 21:26:02,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:02,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:02,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 21:26:02,207 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 21:26:02,207 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:02,207 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:02,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-01-09 21:26:02,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:02,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483717449] [2025-01-09 21:26:02,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483717449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:02,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:02,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 21:26:02,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053256133] [2025-01-09 21:26:02,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:02,237 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:26:02,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:02,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:26:02,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:26:02,254 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 203 [2025-01-09 21:26:02,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 193 places, 195 transitions, 527 flow. Second operand has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-01-09 21:26:02,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:02,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 203 [2025-01-09 21:26:02,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:02,490 INFO L124 PetriNetUnfolderBase]: 350/2164 cut-off events. [2025-01-09 21:26:02,490 INFO L125 PetriNetUnfolderBase]: For 457/461 co-relation queries the response was YES. [2025-01-09 21:26:02,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3584 conditions, 2164 events. 350/2164 cut-off events. For 457/461 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 16528 event pairs, 232 based on Foata normal form. 0/2035 useless extension candidates. Maximal degree in co-relation 3535. Up to 691 conditions per place. [2025-01-09 21:26:02,496 INFO L140 encePairwiseOnDemand]: 198/203 looper letters, 45 selfloop transitions, 3 changer transitions 12/210 dead transitions. [2025-01-09 21:26:02,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 210 transitions, 681 flow [2025-01-09 21:26:02,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:26:02,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:26:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 518 transitions. [2025-01-09 21:26:02,498 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8505747126436781 [2025-01-09 21:26:02,498 INFO L175 Difference]: Start difference. First operand has 193 places, 195 transitions, 527 flow. Second operand 3 states and 518 transitions. [2025-01-09 21:26:02,498 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 210 transitions, 681 flow [2025-01-09 21:26:02,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 210 transitions, 673 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:26:02,502 INFO L231 Difference]: Finished difference. Result has 195 places, 191 transitions, 523 flow [2025-01-09 21:26:02,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=519, PETRI_DIFFERENCE_MINUEND_PLACES=191, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=192, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=523, PETRI_PLACES=195, PETRI_TRANSITIONS=191} [2025-01-09 21:26:02,504 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, 2 predicate places. [2025-01-09 21:26:02,504 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 191 transitions, 523 flow [2025-01-09 21:26:02,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 161.66666666666666) internal successors, (485), 3 states have internal predecessors, (485), 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-01-09 21:26:02,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:26:02,504 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:02,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:26:02,505 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-01-09 21:26:02,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:26:02,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1779741485, now seen corresponding path program 1 times [2025-01-09 21:26:02,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:26:02,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645645801] [2025-01-09 21:26:02,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:26:02,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:26:02,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 21:26:02,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 21:26:02,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:26:02,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:26:02,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:26:02,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:26:02,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645645801] [2025-01-09 21:26:02,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645645801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:26:02,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:26:02,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 21:26:02,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711344880] [2025-01-09 21:26:02,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:26:02,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:26:02,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:26:02,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:26:02,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:26:02,819 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 203 [2025-01-09 21:26:02,821 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 191 transitions, 523 flow. Second operand has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 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-01-09 21:26:02,821 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:26:02,821 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 203 [2025-01-09 21:26:02,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:26:02,966 INFO L124 PetriNetUnfolderBase]: 85/1268 cut-off events. [2025-01-09 21:26:02,967 INFO L125 PetriNetUnfolderBase]: For 217/218 co-relation queries the response was YES. [2025-01-09 21:26:02,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1974 conditions, 1268 events. 85/1268 cut-off events. For 217/218 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 7789 event pairs, 40 based on Foata normal form. 26/1256 useless extension candidates. Maximal degree in co-relation 1922. Up to 177 conditions per place. [2025-01-09 21:26:02,970 INFO L140 encePairwiseOnDemand]: 183/203 looper letters, 0 selfloop transitions, 0 changer transitions 192/192 dead transitions. [2025-01-09 21:26:02,970 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 193 places, 192 transitions, 595 flow [2025-01-09 21:26:02,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 21:26:02,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-01-09 21:26:02,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 864 transitions. [2025-01-09 21:26:02,975 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8512315270935961 [2025-01-09 21:26:02,975 INFO L175 Difference]: Start difference. First operand has 195 places, 191 transitions, 523 flow. Second operand 5 states and 864 transitions. [2025-01-09 21:26:02,975 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 193 places, 192 transitions, 595 flow [2025-01-09 21:26:02,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 192 transitions, 553 flow, removed 11 selfloop flow, removed 10 redundant places. [2025-01-09 21:26:02,977 INFO L231 Difference]: Finished difference. Result has 183 places, 0 transitions, 0 flow [2025-01-09 21:26:02,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=203, PETRI_DIFFERENCE_MINUEND_FLOW=409, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=183, PETRI_TRANSITIONS=0} [2025-01-09 21:26:02,978 INFO L279 CegarLoopForPetriNet]: 193 programPoint places, -10 predicate places. [2025-01-09 21:26:02,978 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 0 transitions, 0 flow [2025-01-09 21:26:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 165.5) internal successors, (993), 6 states have internal predecessors, (993), 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-01-09 21:26:02,980 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (19 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (18 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (17 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (16 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (15 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (14 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (13 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (12 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (11 of 21 remaining) [2025-01-09 21:26:02,981 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (10 of 21 remaining) [2025-01-09 21:26:02,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (9 of 21 remaining) [2025-01-09 21:26:02,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (8 of 21 remaining) [2025-01-09 21:26:02,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 21 remaining) [2025-01-09 21:26:02,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 21 remaining) [2025-01-09 21:26:02,983 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 21 remaining) [2025-01-09 21:26:02,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 21 remaining) [2025-01-09 21:26:02,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr4ASSERT_VIOLATIONDATA_RACE (3 of 21 remaining) [2025-01-09 21:26:02,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr5ASSERT_VIOLATIONDATA_RACE (2 of 21 remaining) [2025-01-09 21:26:02,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr6ASSERT_VIOLATIONDATA_RACE (1 of 21 remaining) [2025-01-09 21:26:02,984 INFO L782 garLoopResultBuilder]: Registering result SAFE for location t_funErr7ASSERT_VIOLATIONDATA_RACE (0 of 21 remaining) [2025-01-09 21:26:02,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:26:02,984 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:26:02,987 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-09 21:26:02,988 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 21:26:02,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 09:26:02 BasicIcfg [2025-01-09 21:26:02,993 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 21:26:02,993 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 21:26:02,993 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 21:26:02,993 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 21:26:02,994 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:25:59" (3/4) ... [2025-01-09 21:26:02,995 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-09 21:26:02,997 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-01-09 21:26:02,999 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-01-09 21:26:03,000 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-09 21:26:03,000 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-01-09 21:26:03,001 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-09 21:26:03,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-09 21:26:03,056 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-09 21:26:03,056 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 21:26:03,057 INFO L158 Benchmark]: Toolchain (without parser) took 4201.15ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 130.7MB in the beginning and 143.8MB in the end (delta: -13.1MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2025-01-09 21:26:03,057 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 226.5MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:26:03,057 INFO L158 Benchmark]: CACSL2BoogieTranslator took 316.86ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 110.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:26:03,057 INFO L158 Benchmark]: Boogie Procedure Inliner took 22.82ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:26:03,057 INFO L158 Benchmark]: Boogie Preprocessor took 15.97ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:26:03,058 INFO L158 Benchmark]: RCFGBuilder took 430.13ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 82.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-09 21:26:03,058 INFO L158 Benchmark]: TraceAbstraction took 3347.32ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 82.2MB in the beginning and 149.1MB in the end (delta: -66.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. [2025-01-09 21:26:03,058 INFO L158 Benchmark]: Witness Printer took 63.23ms. Allocated memory is still 243.3MB. Free memory was 149.1MB in the beginning and 143.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 21:26:03,059 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.21ms. Allocated memory is still 226.5MB. Free memory is still 142.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 316.86ms. Allocated memory is still 167.8MB. Free memory was 130.2MB in the beginning and 110.3MB in the end (delta: 19.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 22.82ms. Allocated memory is still 167.8MB. Free memory was 110.3MB in the beginning and 108.3MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 15.97ms. Allocated memory is still 167.8MB. Free memory was 108.3MB in the beginning and 106.8MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 430.13ms. Allocated memory is still 167.8MB. Free memory was 106.8MB in the beginning and 82.7MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3347.32ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 82.2MB in the beginning and 149.1MB in the end (delta: -66.9MB). Peak memory consumption was 9.4MB. Max. memory is 16.1GB. * Witness Printer took 63.23ms. Allocated memory is still 243.3MB. Free memory was 149.1MB in the beginning and 143.8MB in the end (delta: 5.3MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 709]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 713]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 716]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 720]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 688]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 691]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 696]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 699]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 269 locations, 21 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: 3.2s, OverallIterations: 8, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 514 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 322 mSDsluCounter, 60 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 6 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 789 IncrementalHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 54 mSDtfsCounter, 789 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=527occurred in iteration=6, InterpolantAutomatonStates: 28, 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, 541 NumberOfCodeBlocks, 541 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 533 ConstructedInterpolants, 0 QuantifiedInterpolants, 879 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 12 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-01-09 21:26:03,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE