./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-30 10:28:43,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-30 10:28:43,630 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-30 10:28:43,637 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-30 10:28:43,637 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-30 10:28:43,659 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-30 10:28:43,660 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-30 10:28:43,660 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-30 10:28:43,660 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-30 10:28:43,660 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-30 10:28:43,661 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-30 10:28:43,661 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-30 10:28:43,661 INFO L153 SettingsManager]: * Use SBE=true [2025-04-30 10:28:43,661 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-30 10:28:43,662 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-30 10:28:43,663 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:43,663 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-30 10:28:43,663 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:43,664 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-30 10:28:43,664 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2d0b9c4fc8b0005fb250fdf1ff8e25835b95e676b1936e4f5fe1cf72245ee5f5 [2025-04-30 10:28:43,941 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-30 10:28:43,949 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-30 10:28:43,950 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-30 10:28:43,951 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-30 10:28:43,951 INFO L274 PluginConnector]: CDTParser initialized [2025-04-30 10:28:43,952 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-30 10:28:45,228 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d6965d52/b5a69f6c67c34b35868549d73c273a0f/FLAG3690a3964 [2025-04-30 10:28:45,438 INFO L389 CDTParser]: Found 1 translation units. [2025-04-30 10:28:45,438 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/goblint-regression/13-privatized_27-multiple-protecting2_true.i [2025-04-30 10:28:45,447 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d6965d52/b5a69f6c67c34b35868549d73c273a0f/FLAG3690a3964 [2025-04-30 10:28:46,279 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2d6965d52/b5a69f6c67c34b35868549d73c273a0f [2025-04-30 10:28:46,281 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-30 10:28:46,282 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-30 10:28:46,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:46,283 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-30 10:28:46,286 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-30 10:28:46,286 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,288 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78430e97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46, skipping insertion in model container [2025-04-30 10:28:46,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,319 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-30 10:28:46,609 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:46,631 INFO L200 MainTranslator]: Completed pre-run [2025-04-30 10:28:46,687 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-30 10:28:46,711 INFO L204 MainTranslator]: Completed translation [2025-04-30 10:28:46,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46 WrapperNode [2025-04-30 10:28:46,712 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-30 10:28:46,713 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:46,713 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-30 10:28:46,713 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-30 10:28:46,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,726 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,740 INFO L138 Inliner]: procedures = 163, calls = 55, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 125 [2025-04-30 10:28:46,740 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-30 10:28:46,741 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-30 10:28:46,741 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-30 10:28:46,741 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-30 10:28:46,748 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,748 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,755 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,755 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,762 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,763 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,764 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,765 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,766 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,773 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-30 10:28:46,774 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-30 10:28:46,774 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-30 10:28:46,774 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-30 10:28:46,775 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (1/1) ... [2025-04-30 10:28:46,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-30 10:28:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-30 10:28:46,807 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-30 10:28:46,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-30 10:28:46,825 INFO L130 BoogieDeclarations]: Found specification of procedure t2_fun [2025-04-30 10:28:46,825 INFO L138 BoogieDeclarations]: Found implementation of procedure t2_fun [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-04-30 10:28:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-30 10:28:46,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-30 10:28:46,826 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-30 10:28:46,827 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-30 10:28:46,907 INFO L234 CfgBuilder]: Building ICFG [2025-04-30 10:28:46,908 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-30 10:28:47,131 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-30 10:28:47,131 INFO L283 CfgBuilder]: Performing block encoding [2025-04-30 10:28:47,174 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-30 10:28:47,174 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-30 10:28:47,174 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:47 BoogieIcfgContainer [2025-04-30 10:28:47,174 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-30 10:28:47,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-30 10:28:47,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-30 10:28:47,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-30 10:28:47,179 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.04 10:28:46" (1/3) ... [2025-04-30 10:28:47,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76481b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:47, skipping insertion in model container [2025-04-30 10:28:47,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.04 10:28:46" (2/3) ... [2025-04-30 10:28:47,180 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76481b34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.04 10:28:47, skipping insertion in model container [2025-04-30 10:28:47,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:47" (3/3) ... [2025-04-30 10:28:47,181 INFO L128 eAbstractionObserver]: Analyzing ICFG 13-privatized_27-multiple-protecting2_true.i [2025-04-30 10:28:47,191 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-30 10:28:47,193 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 13-privatized_27-multiple-protecting2_true.i that has 3 procedures, 208 locations, 213 edges, 1 initial locations, 0 loop locations, and 12 error locations. [2025-04-30 10:28:47,193 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-30 10:28:47,252 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-30 10:28:47,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 214 places, 215 transitions, 444 flow [2025-04-30 10:28:47,376 INFO L116 PetriNetUnfolderBase]: 8/213 cut-off events. [2025-04-30 10:28:47,380 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-30 10:28:47,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 222 conditions, 213 events. 8/213 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 333 event pairs, 0 based on Foata normal form. 0/193 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2025-04-30 10:28:47,384 INFO L82 GeneralOperation]: Start removeDead. Operand has 214 places, 215 transitions, 444 flow [2025-04-30 10:28:47,388 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 207 places, 208 transitions, 425 flow [2025-04-30 10:28:47,393 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-30 10:28:47,401 INFO L340 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;@7767e99c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-30 10:28:47,402 INFO L341 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2025-04-30 10:28:47,413 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-30 10:28:47,413 INFO L116 PetriNetUnfolderBase]: 0/51 cut-off events. [2025-04-30 10:28:47,413 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-30 10:28:47,413 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:47,414 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] [2025-04-30 10:28:47,414 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:47,418 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:47,418 INFO L85 PathProgramCache]: Analyzing trace with hash -477178526, now seen corresponding path program 1 times [2025-04-30 10:28:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:47,423 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263145083] [2025-04-30 10:28:47,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:47,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:47,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-04-30 10:28:47,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-04-30 10:28:47,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:47,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:47,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:47,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:47,631 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263145083] [2025-04-30 10:28:47,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263145083] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:47,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:47,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:47,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631844778] [2025-04-30 10:28:47,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:47,640 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:47,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:47,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:47,705 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 215 [2025-04-30 10:28:47,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 208 transitions, 425 flow. Second operand has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-04-30 10:28:47,709 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:47,710 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 215 [2025-04-30 10:28:47,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:49,275 INFO L116 PetriNetUnfolderBase]: 4355/15186 cut-off events. [2025-04-30 10:28:49,275 INFO L117 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2025-04-30 10:28:49,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22183 conditions, 15186 events. 4355/15186 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 167170 event pairs, 1643 based on Foata normal form. 962/14829 useless extension candidates. Maximal degree in co-relation 22057. Up to 4457 conditions per place. [2025-04-30 10:28:49,357 INFO L140 encePairwiseOnDemand]: 192/215 looper letters, 66 selfloop transitions, 10 changer transitions 0/224 dead transitions. [2025-04-30 10:28:49,358 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 224 transitions, 615 flow [2025-04-30 10:28:49,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:49,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:49,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 571 transitions. [2025-04-30 10:28:49,372 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8852713178294573 [2025-04-30 10:28:49,374 INFO L175 Difference]: Start difference. First operand has 207 places, 208 transitions, 425 flow. Second operand 3 states and 571 transitions. [2025-04-30 10:28:49,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 224 transitions, 615 flow [2025-04-30 10:28:49,381 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 224 transitions, 607 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-30 10:28:49,386 INFO L231 Difference]: Finished difference. Result has 198 places, 198 transitions, 462 flow [2025-04-30 10:28:49,388 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=198, PETRI_TRANSITIONS=198} [2025-04-30 10:28:49,392 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -9 predicate places. [2025-04-30 10:28:49,394 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 198 transitions, 462 flow [2025-04-30 10:28:49,395 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 159.66666666666666) internal successors, (479), 3 states have internal predecessors, (479), 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-04-30 10:28:49,395 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:49,395 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] [2025-04-30 10:28:49,395 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-30 10:28:49,396 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:49,396 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1757956060, now seen corresponding path program 1 times [2025-04-30 10:28:49,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:49,397 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459893884] [2025-04-30 10:28:49,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:49,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:49,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-04-30 10:28:49,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-04-30 10:28:49,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:49,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:49,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:49,468 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459893884] [2025-04-30 10:28:49,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459893884] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:49,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:49,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330764158] [2025-04-30 10:28:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:49,469 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:49,469 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:49,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:49,492 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-04-30 10:28:49,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 198 transitions, 462 flow. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-04-30 10:28:49,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:49,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-04-30 10:28:49,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:50,730 INFO L116 PetriNetUnfolderBase]: 4773/14933 cut-off events. [2025-04-30 10:28:50,730 INFO L117 PetriNetUnfolderBase]: For 2273/2301 co-relation queries the response was YES. [2025-04-30 10:28:50,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24615 conditions, 14933 events. 4773/14933 cut-off events. For 2273/2301 co-relation queries the response was YES. Maximal size of possible extension queue 365. Compared 162404 event pairs, 3453 based on Foata normal form. 28/13560 useless extension candidates. Maximal degree in co-relation 24457. Up to 6392 conditions per place. [2025-04-30 10:28:50,806 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 61 selfloop transitions, 8 changer transitions 0/224 dead transitions. [2025-04-30 10:28:50,806 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 224 transitions, 670 flow [2025-04-30 10:28:50,807 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-04-30 10:28:50,809 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-04-30 10:28:50,809 INFO L175 Difference]: Start difference. First operand has 198 places, 198 transitions, 462 flow. Second operand 3 states and 555 transitions. [2025-04-30 10:28:50,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 224 transitions, 670 flow [2025-04-30 10:28:50,820 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 224 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:50,823 INFO L231 Difference]: Finished difference. Result has 200 places, 205 transitions, 514 flow [2025-04-30 10:28:50,824 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=198, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=190, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=200, PETRI_TRANSITIONS=205} [2025-04-30 10:28:50,825 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -7 predicate places. [2025-04-30 10:28:50,825 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 205 transitions, 514 flow [2025-04-30 10:28:50,825 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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-04-30 10:28:50,825 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:50,825 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:50,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-30 10:28:50,826 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2_funErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:50,826 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:50,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1039786127, now seen corresponding path program 1 times [2025-04-30 10:28:50,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:50,828 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384067343] [2025-04-30 10:28:50,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:50,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:50,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-30 10:28:50,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-30 10:28:50,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:50,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:50,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:50,896 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384067343] [2025-04-30 10:28:50,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384067343] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:50,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:50,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:50,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509087776] [2025-04-30 10:28:50,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:50,896 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:50,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:50,897 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:50,898 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:50,918 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-04-30 10:28:50,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 205 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-04-30 10:28:50,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:50,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-04-30 10:28:50,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:52,381 INFO L116 PetriNetUnfolderBase]: 6874/23203 cut-off events. [2025-04-30 10:28:52,381 INFO L117 PetriNetUnfolderBase]: For 751/807 co-relation queries the response was YES. [2025-04-30 10:28:52,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35958 conditions, 23203 events. 6874/23203 cut-off events. For 751/807 co-relation queries the response was YES. Maximal size of possible extension queue 581. Compared 278968 event pairs, 2705 based on Foata normal form. 14/21415 useless extension candidates. Maximal degree in co-relation 35833. Up to 5723 conditions per place. [2025-04-30 10:28:52,473 INFO L140 encePairwiseOnDemand]: 206/215 looper letters, 59 selfloop transitions, 6 changer transitions 0/232 dead transitions. [2025-04-30 10:28:52,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 200 places, 232 transitions, 699 flow [2025-04-30 10:28:52,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:52,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 560 transitions. [2025-04-30 10:28:52,475 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8682170542635659 [2025-04-30 10:28:52,475 INFO L175 Difference]: Start difference. First operand has 200 places, 205 transitions, 514 flow. Second operand 3 states and 560 transitions. [2025-04-30 10:28:52,475 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 200 places, 232 transitions, 699 flow [2025-04-30 10:28:52,478 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 232 transitions, 683 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:52,480 INFO L231 Difference]: Finished difference. Result has 200 places, 207 transitions, 536 flow [2025-04-30 10:28:52,481 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=494, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=536, PETRI_PLACES=200, PETRI_TRANSITIONS=207} [2025-04-30 10:28:52,481 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -7 predicate places. [2025-04-30 10:28:52,481 INFO L485 AbstractCegarLoop]: Abstraction has has 200 places, 207 transitions, 536 flow [2025-04-30 10:28:52,482 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.0) internal successors, (498), 3 states have internal predecessors, (498), 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-04-30 10:28:52,482 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:52,482 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-04-30 10:28:52,482 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-30 10:28:52,482 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:52,482 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:52,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1523394632, now seen corresponding path program 1 times [2025-04-30 10:28:52,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:52,483 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153337133] [2025-04-30 10:28:52,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:52,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:52,490 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-30 10:28:52,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-30 10:28:52,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:52,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:52,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:52,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:52,545 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153337133] [2025-04-30 10:28:52,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153337133] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:52,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:52,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:52,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309899354] [2025-04-30 10:28:52,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:52,546 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:52,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:52,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:52,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:52,566 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 215 [2025-04-30 10:28:52,566 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 207 transitions, 536 flow. Second operand has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-04-30 10:28:52,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:52,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 215 [2025-04-30 10:28:52,568 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:54,772 INFO L116 PetriNetUnfolderBase]: 7740/24641 cut-off events. [2025-04-30 10:28:54,772 INFO L117 PetriNetUnfolderBase]: For 3872/3978 co-relation queries the response was YES. [2025-04-30 10:28:54,813 INFO L83 FinitePrefix]: Finished finitePrefix Result has 41371 conditions, 24641 events. 7740/24641 cut-off events. For 3872/3978 co-relation queries the response was YES. Maximal size of possible extension queue 665. Compared 297602 event pairs, 5376 based on Foata normal form. 14/22559 useless extension candidates. Maximal degree in co-relation 41247. Up to 10216 conditions per place. [2025-04-30 10:28:54,867 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 57 selfloop transitions, 4 changer transitions 0/229 dead transitions. [2025-04-30 10:28:54,868 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 202 places, 229 transitions, 707 flow [2025-04-30 10:28:54,868 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:54,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:54,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-04-30 10:28:54,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8635658914728682 [2025-04-30 10:28:54,869 INFO L175 Difference]: Start difference. First operand has 200 places, 207 transitions, 536 flow. Second operand 3 states and 557 transitions. [2025-04-30 10:28:54,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 202 places, 229 transitions, 707 flow [2025-04-30 10:28:54,874 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 200 places, 229 transitions, 693 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:54,876 INFO L231 Difference]: Finished difference. Result has 202 places, 210 transitions, 556 flow [2025-04-30 10:28:54,876 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=198, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=207, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=556, PETRI_PLACES=202, PETRI_TRANSITIONS=210} [2025-04-30 10:28:54,877 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -5 predicate places. [2025-04-30 10:28:54,877 INFO L485 AbstractCegarLoop]: Abstraction has has 202 places, 210 transitions, 556 flow [2025-04-30 10:28:54,877 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 168.66666666666666) internal successors, (506), 3 states have internal predecessors, (506), 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-04-30 10:28:54,878 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:54,878 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:54,878 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-30 10:28:54,878 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:54,878 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:54,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1299933085, now seen corresponding path program 1 times [2025-04-30 10:28:54,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:54,879 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796210178] [2025-04-30 10:28:54,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:54,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:54,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:28:54,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:28:54,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:54,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:55,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:55,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:55,105 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796210178] [2025-04-30 10:28:55,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796210178] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:55,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:55,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:55,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201314253] [2025-04-30 10:28:55,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:55,106 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:28:55,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:55,107 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:28:55,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:28:55,133 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-04-30 10:28:55,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 210 transitions, 556 flow. Second operand has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 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-04-30 10:28:55,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:55,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-04-30 10:28:55,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:55,821 INFO L116 PetriNetUnfolderBase]: 1980/10595 cut-off events. [2025-04-30 10:28:55,821 INFO L117 PetriNetUnfolderBase]: For 425/498 co-relation queries the response was YES. [2025-04-30 10:28:55,846 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15886 conditions, 10595 events. 1980/10595 cut-off events. For 425/498 co-relation queries the response was YES. Maximal size of possible extension queue 337. Compared 124070 event pairs, 607 based on Foata normal form. 109/9923 useless extension candidates. Maximal degree in co-relation 15759. Up to 1748 conditions per place. [2025-04-30 10:28:55,866 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 44 selfloop transitions, 8 changer transitions 0/233 dead transitions. [2025-04-30 10:28:55,867 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 233 transitions, 708 flow [2025-04-30 10:28:55,867 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:28:55,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:28:55,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2025-04-30 10:28:55,869 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8548837209302326 [2025-04-30 10:28:55,869 INFO L175 Difference]: Start difference. First operand has 202 places, 210 transitions, 556 flow. Second operand 5 states and 919 transitions. [2025-04-30 10:28:55,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 233 transitions, 708 flow [2025-04-30 10:28:55,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 233 transitions, 700 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:55,873 INFO L231 Difference]: Finished difference. Result has 205 places, 214 transitions, 586 flow [2025-04-30 10:28:55,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=548, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=210, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=586, PETRI_PLACES=205, PETRI_TRANSITIONS=214} [2025-04-30 10:28:55,873 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -2 predicate places. [2025-04-30 10:28:55,873 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 214 transitions, 586 flow [2025-04-30 10:28:55,874 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.6) internal successors, (873), 5 states have internal predecessors, (873), 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-04-30 10:28:55,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:55,874 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:28:55,874 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-30 10:28:55,874 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:55,875 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:55,875 INFO L85 PathProgramCache]: Analyzing trace with hash -1686946676, now seen corresponding path program 1 times [2025-04-30 10:28:55,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:55,875 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916188207] [2025-04-30 10:28:55,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:55,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:55,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-04-30 10:28:55,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-04-30 10:28:55,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:55,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:55,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:55,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:55,902 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916188207] [2025-04-30 10:28:55,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916188207] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:55,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:55,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:55,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054416139] [2025-04-30 10:28:55,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:55,903 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:55,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:55,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:55,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:55,930 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 215 [2025-04-30 10:28:55,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 214 transitions, 586 flow. Second operand has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-04-30 10:28:55,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:55,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 215 [2025-04-30 10:28:55,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:56,868 INFO L116 PetriNetUnfolderBase]: 3946/14426 cut-off events. [2025-04-30 10:28:56,869 INFO L117 PetriNetUnfolderBase]: For 3509/3519 co-relation queries the response was YES. [2025-04-30 10:28:56,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26551 conditions, 14426 events. 3946/14426 cut-off events. For 3509/3519 co-relation queries the response was YES. Maximal size of possible extension queue 465. Compared 165736 event pairs, 2498 based on Foata normal form. 2/13437 useless extension candidates. Maximal degree in co-relation 26386. Up to 6071 conditions per place. [2025-04-30 10:28:56,930 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 70 selfloop transitions, 8 changer transitions 2/242 dead transitions. [2025-04-30 10:28:56,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 242 transitions, 840 flow [2025-04-30 10:28:56,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:56,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:56,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 555 transitions. [2025-04-30 10:28:56,932 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8604651162790697 [2025-04-30 10:28:56,932 INFO L175 Difference]: Start difference. First operand has 205 places, 214 transitions, 586 flow. Second operand 3 states and 555 transitions. [2025-04-30 10:28:56,932 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 242 transitions, 840 flow [2025-04-30 10:28:56,934 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 242 transitions, 837 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:56,936 INFO L231 Difference]: Finished difference. Result has 207 places, 221 transitions, 665 flow [2025-04-30 10:28:56,936 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=583, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=206, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=665, PETRI_PLACES=207, PETRI_TRANSITIONS=221} [2025-04-30 10:28:56,936 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 0 predicate places. [2025-04-30 10:28:56,936 INFO L485 AbstractCegarLoop]: Abstraction has has 207 places, 221 transitions, 665 flow [2025-04-30 10:28:56,937 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 167.66666666666666) internal successors, (503), 3 states have internal predecessors, (503), 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-04-30 10:28:56,937 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:56,937 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] [2025-04-30 10:28:56,937 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-30 10:28:56,937 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2_funErr3ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:56,937 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:56,937 INFO L85 PathProgramCache]: Analyzing trace with hash -1464912069, now seen corresponding path program 1 times [2025-04-30 10:28:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:56,937 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146689517] [2025-04-30 10:28:56,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:56,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:56,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-04-30 10:28:56,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-04-30 10:28:56,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:56,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:56,965 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:56,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:56,965 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146689517] [2025-04-30 10:28:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146689517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-30 10:28:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520233328] [2025-04-30 10:28:56,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:56,966 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:56,966 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:56,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:56,981 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 166 out of 215 [2025-04-30 10:28:56,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 221 transitions, 665 flow. Second operand has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-04-30 10:28:56,982 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:56,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 166 of 215 [2025-04-30 10:28:56,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:58,273 INFO L116 PetriNetUnfolderBase]: 3679/15023 cut-off events. [2025-04-30 10:28:58,273 INFO L117 PetriNetUnfolderBase]: For 3682/3804 co-relation queries the response was YES. [2025-04-30 10:28:58,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27279 conditions, 15023 events. 3679/15023 cut-off events. For 3682/3804 co-relation queries the response was YES. Maximal size of possible extension queue 442. Compared 176847 event pairs, 2162 based on Foata normal form. 4/13778 useless extension candidates. Maximal degree in co-relation 27144. Up to 5227 conditions per place. [2025-04-30 10:28:58,340 INFO L140 encePairwiseOnDemand]: 210/215 looper letters, 61 selfloop transitions, 4 changer transitions 3/245 dead transitions. [2025-04-30 10:28:58,340 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 245 transitions, 873 flow [2025-04-30 10:28:58,340 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:28:58,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:28:58,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 557 transitions. [2025-04-30 10:28:58,341 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8635658914728682 [2025-04-30 10:28:58,341 INFO L175 Difference]: Start difference. First operand has 207 places, 221 transitions, 665 flow. Second operand 3 states and 557 transitions. [2025-04-30 10:28:58,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 245 transitions, 873 flow [2025-04-30 10:28:58,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 245 transitions, 847 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:58,352 INFO L231 Difference]: Finished difference. Result has 209 places, 224 transitions, 673 flow [2025-04-30 10:28:58,352 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=639, PETRI_DIFFERENCE_MINUEND_PLACES=205, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=221, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=673, PETRI_PLACES=209, PETRI_TRANSITIONS=224} [2025-04-30 10:28:58,353 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 2 predicate places. [2025-04-30 10:28:58,353 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 224 transitions, 673 flow [2025-04-30 10:28:58,353 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.0) internal successors, (510), 3 states have internal predecessors, (510), 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-04-30 10:28:58,353 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:58,353 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] [2025-04-30 10:28:58,353 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-30 10:28:58,353 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:58,354 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:58,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1475972710, now seen corresponding path program 1 times [2025-04-30 10:28:58,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:58,354 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419532268] [2025-04-30 10:28:58,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:58,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:58,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-04-30 10:28:58,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-04-30 10:28:58,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:58,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:58,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:58,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:58,551 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419532268] [2025-04-30 10:28:58,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419532268] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:58,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:58,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-30 10:28:58,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236298044] [2025-04-30 10:28:58,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:58,552 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-30 10:28:58,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:58,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-30 10:28:58,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-30 10:28:58,582 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 215 [2025-04-30 10:28:58,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 224 transitions, 673 flow. Second operand has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 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-04-30 10:28:58,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:58,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 215 [2025-04-30 10:28:58,584 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:28:59,374 INFO L116 PetriNetUnfolderBase]: 1335/7857 cut-off events. [2025-04-30 10:28:59,374 INFO L117 PetriNetUnfolderBase]: For 1581/1630 co-relation queries the response was YES. [2025-04-30 10:28:59,399 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13361 conditions, 7857 events. 1335/7857 cut-off events. For 1581/1630 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 87362 event pairs, 374 based on Foata normal form. 24/7458 useless extension candidates. Maximal degree in co-relation 13225. Up to 1346 conditions per place. [2025-04-30 10:28:59,409 INFO L140 encePairwiseOnDemand]: 207/215 looper letters, 40 selfloop transitions, 10 changer transitions 13/250 dead transitions. [2025-04-30 10:28:59,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 250 transitions, 867 flow [2025-04-30 10:28:59,409 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-30 10:28:59,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-30 10:28:59,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 919 transitions. [2025-04-30 10:28:59,411 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8548837209302326 [2025-04-30 10:28:59,411 INFO L175 Difference]: Start difference. First operand has 209 places, 224 transitions, 673 flow. Second operand 5 states and 919 transitions. [2025-04-30 10:28:59,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 250 transitions, 867 flow [2025-04-30 10:28:59,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 250 transitions, 857 flow, removed 1 selfloop flow, removed 2 redundant places. [2025-04-30 10:28:59,422 INFO L231 Difference]: Finished difference. Result has 212 places, 223 transitions, 699 flow [2025-04-30 10:28:59,422 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=663, PETRI_DIFFERENCE_MINUEND_PLACES=207, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=214, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=699, PETRI_PLACES=212, PETRI_TRANSITIONS=223} [2025-04-30 10:28:59,423 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 5 predicate places. [2025-04-30 10:28:59,423 INFO L485 AbstractCegarLoop]: Abstraction has has 212 places, 223 transitions, 699 flow [2025-04-30 10:28:59,423 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 175.6) internal successors, (878), 5 states have internal predecessors, (878), 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-04-30 10:28:59,423 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:28:59,423 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] [2025-04-30 10:28:59,424 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-30 10:28:59,424 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:28:59,424 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:28:59,424 INFO L85 PathProgramCache]: Analyzing trace with hash -67412236, now seen corresponding path program 1 times [2025-04-30 10:28:59,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:28:59,424 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170449089] [2025-04-30 10:28:59,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:28:59,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:28:59,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:28:59,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:28:59,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:28:59,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:28:59,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:28:59,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:28:59,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170449089] [2025-04-30 10:28:59,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170449089] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:28:59,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:28:59,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-30 10:28:59,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647193580] [2025-04-30 10:28:59,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:28:59,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-30 10:28:59,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:28:59,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-30 10:28:59,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-30 10:28:59,537 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 215 [2025-04-30 10:28:59,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 223 transitions, 699 flow. Second operand has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-04-30 10:28:59,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:28:59,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 215 [2025-04-30 10:28:59,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:00,207 INFO L116 PetriNetUnfolderBase]: 818/7273 cut-off events. [2025-04-30 10:29:00,207 INFO L117 PetriNetUnfolderBase]: For 2287/2319 co-relation queries the response was YES. [2025-04-30 10:29:00,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12563 conditions, 7273 events. 818/7273 cut-off events. For 2287/2319 co-relation queries the response was YES. Maximal size of possible extension queue 183. Compared 79958 event pairs, 233 based on Foata normal form. 167/7150 useless extension candidates. Maximal degree in co-relation 7911. Up to 1260 conditions per place. [2025-04-30 10:29:00,227 INFO L140 encePairwiseOnDemand]: 195/215 looper letters, 24 selfloop transitions, 20 changer transitions 15/247 dead transitions. [2025-04-30 10:29:00,227 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 247 transitions, 931 flow [2025-04-30 10:29:00,227 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-30 10:29:00,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-30 10:29:00,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 576 transitions. [2025-04-30 10:29:00,228 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8930232558139535 [2025-04-30 10:29:00,228 INFO L175 Difference]: Start difference. First operand has 212 places, 223 transitions, 699 flow. Second operand 3 states and 576 transitions. [2025-04-30 10:29:00,228 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 247 transitions, 931 flow [2025-04-30 10:29:00,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 212 places, 247 transitions, 928 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-30 10:29:00,235 INFO L231 Difference]: Finished difference. Result has 213 places, 227 transitions, 789 flow [2025-04-30 10:29:00,235 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=696, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=203, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=789, PETRI_PLACES=213, PETRI_TRANSITIONS=227} [2025-04-30 10:29:00,235 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 6 predicate places. [2025-04-30 10:29:00,236 INFO L485 AbstractCegarLoop]: Abstraction has has 213 places, 227 transitions, 789 flow [2025-04-30 10:29:00,236 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.33333333333334) internal successors, (535), 3 states have internal predecessors, (535), 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-04-30 10:29:00,236 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:00,236 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] [2025-04-30 10:29:00,236 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-30 10:29:00,236 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:29:00,237 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:00,237 INFO L85 PathProgramCache]: Analyzing trace with hash -908077580, now seen corresponding path program 2 times [2025-04-30 10:29:00,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:00,237 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545645460] [2025-04-30 10:29:00,237 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-30 10:29:00,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:00,246 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 92 statements into 1 equivalence classes. [2025-04-30 10:29:00,253 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-04-30 10:29:00,255 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-04-30 10:29:00,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:00,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:00,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:00,539 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545645460] [2025-04-30 10:29:00,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545645460] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:00,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:00,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-04-30 10:29:00,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1520710157] [2025-04-30 10:29:00,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:00,539 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-30 10:29:00,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:00,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-30 10:29:00,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-04-30 10:29:00,637 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 215 [2025-04-30 10:29:00,639 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 227 transitions, 789 flow. Second operand has 7 states, 7 states have (on average 174.14285714285714) internal successors, (1219), 7 states have internal predecessors, (1219), 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-04-30 10:29:00,639 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:00,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 215 [2025-04-30 10:29:00,640 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:00,927 INFO L116 PetriNetUnfolderBase]: 149/2619 cut-off events. [2025-04-30 10:29:00,927 INFO L117 PetriNetUnfolderBase]: For 1537/1594 co-relation queries the response was YES. [2025-04-30 10:29:00,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4927 conditions, 2619 events. 149/2619 cut-off events. For 1537/1594 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 21444 event pairs, 65 based on Foata normal form. 37/2571 useless extension candidates. Maximal degree in co-relation 3375. Up to 426 conditions per place. [2025-04-30 10:29:00,933 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 27 selfloop transitions, 7 changer transitions 13/207 dead transitions. [2025-04-30 10:29:00,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 207 transitions, 773 flow [2025-04-30 10:29:00,933 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:00,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:00,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1070 transitions. [2025-04-30 10:29:00,935 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8294573643410853 [2025-04-30 10:29:00,935 INFO L175 Difference]: Start difference. First operand has 213 places, 227 transitions, 789 flow. Second operand 6 states and 1070 transitions. [2025-04-30 10:29:00,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 207 transitions, 773 flow [2025-04-30 10:29:00,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 207 transitions, 713 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-04-30 10:29:00,942 INFO L231 Difference]: Finished difference. Result has 208 places, 190 transitions, 534 flow [2025-04-30 10:29:00,942 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=596, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=194, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=534, PETRI_PLACES=208, PETRI_TRANSITIONS=190} [2025-04-30 10:29:00,943 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, 1 predicate places. [2025-04-30 10:29:00,943 INFO L485 AbstractCegarLoop]: Abstraction has has 208 places, 190 transitions, 534 flow [2025-04-30 10:29:00,943 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 174.14285714285714) internal successors, (1219), 7 states have internal predecessors, (1219), 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-04-30 10:29:00,944 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-30 10:29:00,944 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:00,944 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-30 10:29:00,944 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2_funErr1ASSERT_VIOLATIONDATA_RACE === [t2_funErr0ASSERT_VIOLATIONDATA_RACE, t2_funErr1ASSERT_VIOLATIONDATA_RACE, t2_funErr2ASSERT_VIOLATIONDATA_RACE, t2_funErr3ASSERT_VIOLATIONDATA_RACE (and 18 more)] === [2025-04-30 10:29:00,945 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-30 10:29:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1016827974, now seen corresponding path program 1 times [2025-04-30 10:29:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-30 10:29:00,945 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330331650] [2025-04-30 10:29:00,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-30 10:29:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-30 10:29:00,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-04-30 10:29:00,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-04-30 10:29:00,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-30 10:29:00,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-30 10:29:01,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-30 10:29:01,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-30 10:29:01,325 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330331650] [2025-04-30 10:29:01,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330331650] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-30 10:29:01,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-30 10:29:01,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-30 10:29:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28792902] [2025-04-30 10:29:01,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-30 10:29:01,326 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-30 10:29:01,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-30 10:29:01,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-30 10:29:01,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-04-30 10:29:01,449 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 172 out of 215 [2025-04-30 10:29:01,451 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 190 transitions, 534 flow. Second operand has 8 states, 8 states have (on average 174.5) internal successors, (1396), 8 states have internal predecessors, (1396), 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-04-30 10:29:01,451 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-30 10:29:01,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 172 of 215 [2025-04-30 10:29:01,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-30 10:29:01,577 INFO L116 PetriNetUnfolderBase]: 41/736 cut-off events. [2025-04-30 10:29:01,577 INFO L117 PetriNetUnfolderBase]: For 331/344 co-relation queries the response was YES. [2025-04-30 10:29:01,578 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 736 events. 41/736 cut-off events. For 331/344 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 3519 event pairs, 14 based on Foata normal form. 2/718 useless extension candidates. Maximal degree in co-relation 1131. Up to 118 conditions per place. [2025-04-30 10:29:01,579 INFO L140 encePairwiseOnDemand]: 208/215 looper letters, 0 selfloop transitions, 0 changer transitions 190/190 dead transitions. [2025-04-30 10:29:01,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 190 transitions, 615 flow [2025-04-30 10:29:01,579 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-30 10:29:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-30 10:29:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1072 transitions. [2025-04-30 10:29:01,581 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8310077519379845 [2025-04-30 10:29:01,581 INFO L175 Difference]: Start difference. First operand has 208 places, 190 transitions, 534 flow. Second operand 6 states and 1072 transitions. [2025-04-30 10:29:01,581 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 190 transitions, 615 flow [2025-04-30 10:29:01,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 190 transitions, 564 flow, removed 6 selfloop flow, removed 11 redundant places. [2025-04-30 10:29:01,584 INFO L231 Difference]: Finished difference. Result has 198 places, 0 transitions, 0 flow [2025-04-30 10:29:01,584 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=215, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=193, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=180, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=180, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=0, PETRI_PLACES=198, PETRI_TRANSITIONS=0} [2025-04-30 10:29:01,585 INFO L279 CegarLoopForPetriNet]: 207 programPoint places, -9 predicate places. [2025-04-30 10:29:01,585 INFO L485 AbstractCegarLoop]: Abstraction has has 198 places, 0 transitions, 0 flow [2025-04-30 10:29:01,586 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 174.5) internal successors, (1396), 8 states have internal predecessors, (1396), 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-04-30 10:29:01,587 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (21 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (20 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (19 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (18 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (17 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (16 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (15 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 22 remaining) [2025-04-30 10:29:01,588 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (11 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (8 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr0ASSERT_VIOLATIONDATA_RACE (7 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t2_funErr3ASSERT_VIOLATIONDATA_RACE (4 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 22 remaining) [2025-04-30 10:29:01,589 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 22 remaining) [2025-04-30 10:29:01,589 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-30 10:29:01,590 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-30 10:29:01,593 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-30 10:29:01,593 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-30 10:29:01,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.04 10:29:01 BasicIcfg [2025-04-30 10:29:01,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-30 10:29:01,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-30 10:29:01,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-30 10:29:01,597 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-30 10:29:01,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.04 10:28:47" (3/4) ... [2025-04-30 10:29:01,599 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-30 10:29:01,601 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t2_fun [2025-04-30 10:29:01,601 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure t_fun [2025-04-30 10:29:01,603 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-04-30 10:29:01,603 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-30 10:29:01,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-04-30 10:29:01,604 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-04-30 10:29:01,659 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-30 10:29:01,660 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-30 10:29:01,660 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-30 10:29:01,661 INFO L158 Benchmark]: Toolchain (without parser) took 15378.83ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 112.4MB in the beginning and 2.3GB in the end (delta: -2.2GB). Peak memory consumption was 2.2GB. Max. memory is 16.1GB. [2025-04-30 10:29:01,661 INFO L158 Benchmark]: CDTParser took 0.86ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:01,662 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.88ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 88.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:29:01,662 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.69ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:01,662 INFO L158 Benchmark]: Boogie Preprocessor took 32.63ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 85.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-30 10:29:01,663 INFO L158 Benchmark]: RCFGBuilder took 400.31ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 60.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-30 10:29:01,663 INFO L158 Benchmark]: TraceAbstraction took 14420.93ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 59.5MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. [2025-04-30 10:29:01,663 INFO L158 Benchmark]: Witness Printer took 62.62ms. Allocated memory is still 4.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-30 10:29:01,664 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.86ms. Allocated memory is still 201.3MB. Free memory is still 122.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.88ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 88.6MB in the end (delta: 23.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.69ms. Allocated memory is still 142.6MB. Free memory was 88.6MB in the beginning and 86.6MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 32.63ms. Allocated memory is still 142.6MB. Free memory was 86.6MB in the beginning and 85.1MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 400.31ms. Allocated memory is still 142.6MB. Free memory was 85.1MB in the beginning and 60.0MB in the end (delta: 25.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14420.93ms. Allocated memory was 142.6MB in the beginning and 4.5GB in the end (delta: 4.4GB). Free memory was 59.5MB in the beginning and 2.3GB in the end (delta: -2.3GB). Peak memory consumption was 2.1GB. Max. memory is 16.1GB. * Witness Printer took 62.62ms. Allocated memory is still 4.5GB. Free memory was 2.3GB in the beginning and 2.3GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 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 - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 702]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 714]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 718]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 721]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 725]: 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 - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 286 locations, 293 edges, 22 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: 14.3s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 12.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 909 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 643 mSDsluCounter, 136 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 86 mSDsCounter, 149 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1458 IncrementalHoareTripleChecker+Invalid, 1607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 149 mSolverCounterUnsat, 50 mSDtfsCounter, 1458 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=789occurred in iteration=9, InterpolantAutomatonStates: 43, 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, 1.4s InterpolantComputationTime, 780 NumberOfCodeBlocks, 780 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 769 ConstructedInterpolants, 0 QuantifiedInterpolants, 2997 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 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-04-30 10:29:01,680 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE