./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.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 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 22:01:12,502 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 22:01:12,551 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-08 22:01:12,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 22:01:12,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 22:01:12,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 22:01:12,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 22:01:12,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 22:01:12,578 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 22:01:12,578 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 22:01:12,579 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 22:01:12,579 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 22:01:12,579 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 22:01:12,579 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 22:01:12,579 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 22:01:12,580 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 22:01:12,580 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:12,581 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 22:01:12,581 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 22:01:12,581 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 -> 1fe12ce8951e45860142b9cebaa325eef531c18fa917882c03ee5396afb187f5 [2025-03-08 22:01:12,810 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 22:01:12,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 22:01:12,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 22:01:12,820 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 22:01:12,820 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 22:01:12,822 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-03-08 22:01:13,966 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3e6c3d5/ac9df94830804157be1b87879cef1b24/FLAG30d88c381 [2025-03-08 22:01:14,240 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 22:01:14,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_05-lockfuns_racefree.i [2025-03-08 22:01:14,256 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3e6c3d5/ac9df94830804157be1b87879cef1b24/FLAG30d88c381 [2025-03-08 22:01:14,273 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a3e6c3d5/ac9df94830804157be1b87879cef1b24 [2025-03-08 22:01:14,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 22:01:14,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 22:01:14,276 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:14,276 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 22:01:14,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 22:01:14,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,283 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e385255 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14, skipping insertion in model container [2025-03-08 22:01:14,283 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,308 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 22:01:14,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:14,495 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 22:01:14,544 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 22:01:14,574 INFO L204 MainTranslator]: Completed translation [2025-03-08 22:01:14,575 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14 WrapperNode [2025-03-08 22:01:14,575 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 22:01:14,576 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:14,576 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 22:01:14,577 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 22:01:14,581 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,591 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,611 INFO L138 Inliner]: procedures = 173, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 136 [2025-03-08 22:01:14,612 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 22:01:14,612 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 22:01:14,612 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 22:01:14,612 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 22:01:14,617 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,617 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,619 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,619 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,626 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,627 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,632 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,633 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,634 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 22:01:14,635 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 22:01:14,635 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 22:01:14,635 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 22:01:14,635 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (1/1) ... [2025-03-08 22:01:14,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 22:01:14,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 22:01:14,660 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 22:01:14,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-08 22:01:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-08 22:01:14,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 22:01:14,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 22:01:14,679 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-08 22:01:14,764 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 22:01:14,766 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 22:01:14,916 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L712: havoc main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset; [2025-03-08 22:01:14,916 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: SUMMARY for call ULTIMATE.dealloc(main_~#t_ids~0#1.base, main_~#t_ids~0#1.offset); srcloc: null [2025-03-08 22:01:14,955 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-08 22:01:14,955 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 22:01:14,975 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 22:01:14,975 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 22:01:14,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:14 BoogieIcfgContainer [2025-03-08 22:01:14,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 22:01:14,977 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 22:01:14,977 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 22:01:14,980 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 22:01:14,980 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 10:01:14" (1/3) ... [2025-03-08 22:01:14,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761755d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:14, skipping insertion in model container [2025-03-08 22:01:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 10:01:14" (2/3) ... [2025-03-08 22:01:14,981 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@761755d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 10:01:14, skipping insertion in model container [2025-03-08 22:01:14,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 10:01:14" (3/3) ... [2025-03-08 22:01:14,982 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_05-lockfuns_racefree.i [2025-03-08 22:01:14,992 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 22:01:14,993 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_05-lockfuns_racefree.i that has 2 procedures, 134 locations, 1 initial locations, 5 loop locations, and 7 error locations. [2025-03-08 22:01:14,993 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-08 22:01:15,051 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-03-08 22:01:15,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 137 places, 145 transitions, 297 flow [2025-03-08 22:01:15,142 INFO L124 PetriNetUnfolderBase]: 15/206 cut-off events. [2025-03-08 22:01:15,144 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-08 22:01:15,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 211 conditions, 206 events. 15/206 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 665 event pairs, 0 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 114. Up to 4 conditions per place. [2025-03-08 22:01:15,152 INFO L82 GeneralOperation]: Start removeDead. Operand has 137 places, 145 transitions, 297 flow [2025-03-08 22:01:15,155 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 145 transitions, 297 flow [2025-03-08 22:01:15,166 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:15,177 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b76fc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:15,177 INFO L334 AbstractCegarLoop]: Starting to check reachability of 12 error locations. [2025-03-08 22:01:15,187 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:15,188 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-08 22:01:15,188 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:15,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:15,188 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] [2025-03-08 22:01:15,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 22:01:15,193 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash -1898706604, now seen corresponding path program 1 times [2025-03-08 22:01:15,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:15,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251197073] [2025-03-08 22:01:15,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:15,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:15,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:15,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:15,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:15,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:15,813 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:15,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:15,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251197073] [2025-03-08 22:01:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251197073] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:01:15,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338616354] [2025-03-08 22:01:15,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:15,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:01:15,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:15,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:01:15,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:01:15,969 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 145 [2025-03-08 22:01:15,971 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 145 transitions, 297 flow. Second operand has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:15,971 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:15,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 145 [2025-03-08 22:01:15,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:16,152 INFO L124 PetriNetUnfolderBase]: 109/818 cut-off events. [2025-03-08 22:01:16,152 INFO L125 PetriNetUnfolderBase]: For 3/6 co-relation queries the response was YES. [2025-03-08 22:01:16,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1086 conditions, 818 events. 109/818 cut-off events. For 3/6 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4822 event pairs, 66 based on Foata normal form. 72/804 useless extension candidates. Maximal degree in co-relation 967. Up to 186 conditions per place. [2025-03-08 22:01:16,159 INFO L140 encePairwiseOnDemand]: 129/145 looper letters, 48 selfloop transitions, 5 changer transitions 0/156 dead transitions. [2025-03-08 22:01:16,161 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 156 transitions, 425 flow [2025-03-08 22:01:16,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:01:16,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:01:16,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 712 transitions. [2025-03-08 22:01:16,175 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8183908045977012 [2025-03-08 22:01:16,176 INFO L175 Difference]: Start difference. First operand has 137 places, 145 transitions, 297 flow. Second operand 6 states and 712 transitions. [2025-03-08 22:01:16,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 156 transitions, 425 flow [2025-03-08 22:01:16,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 156 transitions, 425 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:01:16,184 INFO L231 Difference]: Finished difference. Result has 139 places, 132 transitions, 281 flow [2025-03-08 22:01:16,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=281, PETRI_PLACES=139, PETRI_TRANSITIONS=132} [2025-03-08 22:01:16,189 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2025-03-08 22:01:16,190 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 132 transitions, 281 flow [2025-03-08 22:01:16,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 105.5) internal successors, (633), 6 states have internal predecessors, (633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,191 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:16,191 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] [2025-03-08 22:01:16,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 22:01:16,191 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 22:01:16,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:16,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1412955468, now seen corresponding path program 1 times [2025-03-08 22:01:16,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:16,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338558744] [2025-03-08 22:01:16,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:16,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:16,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:16,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:16,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:16,208 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:16,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:16,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:16,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338558744] [2025-03-08 22:01:16,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338558744] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:16,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:16,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:01:16,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885633601] [2025-03-08 22:01:16,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:16,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:16,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:16,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:16,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:16,258 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 145 [2025-03-08 22:01:16,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 132 transitions, 281 flow. Second operand has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:16,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 145 [2025-03-08 22:01:16,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:16,339 INFO L124 PetriNetUnfolderBase]: 48/575 cut-off events. [2025-03-08 22:01:16,339 INFO L125 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-03-08 22:01:16,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 716 conditions, 575 events. 48/575 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 2869 event pairs, 35 based on Foata normal form. 1/527 useless extension candidates. Maximal degree in co-relation 642. Up to 108 conditions per place. [2025-03-08 22:01:16,344 INFO L140 encePairwiseOnDemand]: 142/145 looper letters, 22 selfloop transitions, 2 changer transitions 0/138 dead transitions. [2025-03-08 22:01:16,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 138 transitions, 341 flow [2025-03-08 22:01:16,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:16,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:16,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 373 transitions. [2025-03-08 22:01:16,347 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8574712643678161 [2025-03-08 22:01:16,348 INFO L175 Difference]: Start difference. First operand has 139 places, 132 transitions, 281 flow. Second operand 3 states and 373 transitions. [2025-03-08 22:01:16,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 138 transitions, 341 flow [2025-03-08 22:01:16,349 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 138 transitions, 331 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:01:16,351 INFO L231 Difference]: Finished difference. Result has 137 places, 132 transitions, 279 flow [2025-03-08 22:01:16,351 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=134, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=279, PETRI_PLACES=137, PETRI_TRANSITIONS=132} [2025-03-08 22:01:16,351 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2025-03-08 22:01:16,351 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 132 transitions, 279 flow [2025-03-08 22:01:16,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,352 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:16,352 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] [2025-03-08 22:01:16,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 22:01:16,352 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 22:01:16,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:16,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1960348362, now seen corresponding path program 1 times [2025-03-08 22:01:16,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:16,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719625092] [2025-03-08 22:01:16,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:16,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:16,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:01:16,368 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:01:16,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:16,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:16,402 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:16,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:16,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719625092] [2025-03-08 22:01:16,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719625092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:16,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:16,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:01:16,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [14661552] [2025-03-08 22:01:16,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:16,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:16,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:16,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:16,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:16,420 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 145 [2025-03-08 22:01:16,421 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 132 transitions, 279 flow. Second operand has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,421 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:16,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 145 [2025-03-08 22:01:16,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:16,515 INFO L124 PetriNetUnfolderBase]: 91/827 cut-off events. [2025-03-08 22:01:16,516 INFO L125 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-03-08 22:01:16,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1056 conditions, 827 events. 91/827 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 4988 event pairs, 30 based on Foata normal form. 0/756 useless extension candidates. Maximal degree in co-relation 1007. Up to 125 conditions per place. [2025-03-08 22:01:16,522 INFO L140 encePairwiseOnDemand]: 136/145 looper letters, 30 selfloop transitions, 6 changer transitions 0/145 dead transitions. [2025-03-08 22:01:16,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 145 transitions, 380 flow [2025-03-08 22:01:16,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:16,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2025-03-08 22:01:16,524 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8551724137931035 [2025-03-08 22:01:16,524 INFO L175 Difference]: Start difference. First operand has 137 places, 132 transitions, 279 flow. Second operand 3 states and 372 transitions. [2025-03-08 22:01:16,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 145 transitions, 380 flow [2025-03-08 22:01:16,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 376 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:01:16,528 INFO L231 Difference]: Finished difference. Result has 137 places, 134 transitions, 313 flow [2025-03-08 22:01:16,528 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=145, PETRI_DIFFERENCE_MINUEND_FLOW=271, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=313, PETRI_PLACES=137, PETRI_TRANSITIONS=134} [2025-03-08 22:01:16,528 INFO L279 CegarLoopForPetriNet]: 137 programPoint places, 0 predicate places. [2025-03-08 22:01:16,529 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 134 transitions, 313 flow [2025-03-08 22:01:16,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.66666666666667) internal successors, (338), 3 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,529 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:16,529 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:01:16,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 22:01:16,530 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 9 more)] === [2025-03-08 22:01:16,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:16,531 INFO L85 PathProgramCache]: Analyzing trace with hash -1056320894, now seen corresponding path program 1 times [2025-03-08 22:01:16,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:16,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486822517] [2025-03-08 22:01:16,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:16,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:16,541 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:01:16,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:01:16,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:16,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:16,553 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:01:16,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:01:16,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:01:16,567 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:16,567 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:16,586 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:01:16,586 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:01:16,587 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 12 remaining) [2025-03-08 22:01:16,589 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 12 remaining) [2025-03-08 22:01:16,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (9 of 12 remaining) [2025-03-08 22:01:16,590 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (8 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 12 remaining) [2025-03-08 22:01:16,591 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 12 remaining) [2025-03-08 22:01:16,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 22:01:16,592 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-03-08 22:01:16,594 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:01:16,594 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-03-08 22:01:16,622 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-03-08 22:01:16,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 184 places, 197 transitions, 410 flow [2025-03-08 22:01:16,664 INFO L124 PetriNetUnfolderBase]: 27/346 cut-off events. [2025-03-08 22:01:16,665 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-03-08 22:01:16,668 INFO L83 FinitePrefix]: Finished finitePrefix Result has 358 conditions, 346 events. 27/346 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1263 event pairs, 0 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 208. Up to 6 conditions per place. [2025-03-08 22:01:16,668 INFO L82 GeneralOperation]: Start removeDead. Operand has 184 places, 197 transitions, 410 flow [2025-03-08 22:01:16,672 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 184 places, 197 transitions, 410 flow [2025-03-08 22:01:16,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:16,674 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b76fc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:16,674 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-08 22:01:16,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:16,679 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-08 22:01:16,679 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:16,679 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:16,679 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] [2025-03-08 22:01:16,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:16,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:16,679 INFO L85 PathProgramCache]: Analyzing trace with hash 457177977, now seen corresponding path program 1 times [2025-03-08 22:01:16,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:16,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560181288] [2025-03-08 22:01:16,679 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:16,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:16,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:16,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:16,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:16,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:16,901 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:16,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:16,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560181288] [2025-03-08 22:01:16,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560181288] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:16,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:16,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:01:16,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704864444] [2025-03-08 22:01:16,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:16,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:01:16,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:16,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:01:16,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:01:16,979 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 197 [2025-03-08 22:01:16,981 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 197 transitions, 410 flow. Second operand has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:16,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:16,982 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 197 [2025-03-08 22:01:16,982 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:17,633 INFO L124 PetriNetUnfolderBase]: 1719/6161 cut-off events. [2025-03-08 22:01:17,633 INFO L125 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-03-08 22:01:17,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9056 conditions, 6161 events. 1719/6161 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 190. Compared 60048 event pairs, 168 based on Foata normal form. 1050/6733 useless extension candidates. Maximal degree in co-relation 4651. Up to 2020 conditions per place. [2025-03-08 22:01:17,667 INFO L140 encePairwiseOnDemand]: 175/197 looper letters, 80 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-08 22:01:17,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 226 transitions, 638 flow [2025-03-08 22:01:17,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:01:17,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:01:17,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1002 transitions. [2025-03-08 22:01:17,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8477157360406091 [2025-03-08 22:01:17,670 INFO L175 Difference]: Start difference. First operand has 184 places, 197 transitions, 410 flow. Second operand 6 states and 1002 transitions. [2025-03-08 22:01:17,670 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 226 transitions, 638 flow [2025-03-08 22:01:17,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 226 transitions, 638 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:01:17,673 INFO L231 Difference]: Finished difference. Result has 186 places, 178 transitions, 382 flow [2025-03-08 22:01:17,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=173, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=382, PETRI_PLACES=186, PETRI_TRANSITIONS=178} [2025-03-08 22:01:17,674 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 2 predicate places. [2025-03-08 22:01:17,674 INFO L471 AbstractCegarLoop]: Abstraction has has 186 places, 178 transitions, 382 flow [2025-03-08 22:01:17,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 143.5) internal successors, (861), 6 states have internal predecessors, (861), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:17,674 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:17,675 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:01:17,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 22:01:17,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -526127247, now seen corresponding path program 1 times [2025-03-08 22:01:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136328639] [2025-03-08 22:01:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:17,684 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:17,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:17,688 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:17,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:17,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:17,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:17,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136328639] [2025-03-08 22:01:17,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136328639] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:17,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:17,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:01:17,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272343512] [2025-03-08 22:01:17,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:17,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:17,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:17,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:17,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:17,726 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 197 [2025-03-08 22:01:17,727 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 178 transitions, 382 flow. Second operand has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:17,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:17,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 197 [2025-03-08 22:01:17,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:18,052 INFO L124 PetriNetUnfolderBase]: 784/4403 cut-off events. [2025-03-08 22:01:18,053 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2025-03-08 22:01:18,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5913 conditions, 4403 events. 784/4403 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 115. Compared 41969 event pairs, 632 based on Foata normal form. 1/4074 useless extension candidates. Maximal degree in co-relation 3625. Up to 1303 conditions per place. [2025-03-08 22:01:18,078 INFO L140 encePairwiseOnDemand]: 194/197 looper letters, 31 selfloop transitions, 2 changer transitions 0/185 dead transitions. [2025-03-08 22:01:18,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 185 transitions, 464 flow [2025-03-08 22:01:18,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:18,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:18,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 496 transitions. [2025-03-08 22:01:18,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8392554991539763 [2025-03-08 22:01:18,080 INFO L175 Difference]: Start difference. First operand has 186 places, 178 transitions, 382 flow. Second operand 3 states and 496 transitions. [2025-03-08 22:01:18,080 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 185 transitions, 464 flow [2025-03-08 22:01:18,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 185 transitions, 452 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:01:18,083 INFO L231 Difference]: Finished difference. Result has 184 places, 179 transitions, 384 flow [2025-03-08 22:01:18,083 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=372, PETRI_DIFFERENCE_MINUEND_PLACES=181, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=178, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=384, PETRI_PLACES=184, PETRI_TRANSITIONS=179} [2025-03-08 22:01:18,083 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 0 predicate places. [2025-03-08 22:01:18,083 INFO L471 AbstractCegarLoop]: Abstraction has has 184 places, 179 transitions, 384 flow [2025-03-08 22:01:18,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 156.0) internal successors, (468), 3 states have internal predecessors, (468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:18,084 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:18,084 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] [2025-03-08 22:01:18,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 22:01:18,084 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:18,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:18,085 INFO L85 PathProgramCache]: Analyzing trace with hash 971232733, now seen corresponding path program 1 times [2025-03-08 22:01:18,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:18,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988075050] [2025-03-08 22:01:18,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:18,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:18,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:01:18,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:01:18,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:18,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:18,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:18,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:18,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988075050] [2025-03-08 22:01:18,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988075050] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:18,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:18,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:01:18,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036596630] [2025-03-08 22:01:18,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:18,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:18,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:18,114 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:18,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:18,141 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 197 [2025-03-08 22:01:18,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 184 places, 179 transitions, 384 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:18,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:18,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 197 [2025-03-08 22:01:18,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:19,261 INFO L124 PetriNetUnfolderBase]: 3895/15034 cut-off events. [2025-03-08 22:01:19,261 INFO L125 PetriNetUnfolderBase]: For 238/238 co-relation queries the response was YES. [2025-03-08 22:01:19,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21574 conditions, 15034 events. 3895/15034 cut-off events. For 238/238 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 171466 event pairs, 1409 based on Foata normal form. 0/13511 useless extension candidates. Maximal degree in co-relation 21524. Up to 3516 conditions per place. [2025-03-08 22:01:19,338 INFO L140 encePairwiseOnDemand]: 178/197 looper letters, 58 selfloop transitions, 14 changer transitions 0/212 dead transitions. [2025-03-08 22:01:19,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 212 transitions, 605 flow [2025-03-08 22:01:19,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:19,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:19,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 500 transitions. [2025-03-08 22:01:19,340 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8460236886632826 [2025-03-08 22:01:19,340 INFO L175 Difference]: Start difference. First operand has 184 places, 179 transitions, 384 flow. Second operand 3 states and 500 transitions. [2025-03-08 22:01:19,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 212 transitions, 605 flow [2025-03-08 22:01:19,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 185 places, 212 transitions, 603 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-08 22:01:19,343 INFO L231 Difference]: Finished difference. Result has 187 places, 193 transitions, 504 flow [2025-03-08 22:01:19,343 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=382, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=179, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=504, PETRI_PLACES=187, PETRI_TRANSITIONS=193} [2025-03-08 22:01:19,344 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 3 predicate places. [2025-03-08 22:01:19,344 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 193 transitions, 504 flow [2025-03-08 22:01:19,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:19,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:19,344 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-03-08 22:01:19,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 22:01:19,344 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:19,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:19,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1962221454, now seen corresponding path program 1 times [2025-03-08 22:01:19,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:19,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542805475] [2025-03-08 22:01:19,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:19,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:19,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-08 22:01:19,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-08 22:01:19,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:19,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:19,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:19,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:19,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542805475] [2025-03-08 22:01:19,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542805475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:19,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:19,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:01:19,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077623527] [2025-03-08 22:01:19,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:19,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:19,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:19,372 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:19,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:19,403 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 197 [2025-03-08 22:01:19,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 193 transitions, 504 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:19,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:19,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 197 [2025-03-08 22:01:19,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:20,509 INFO L124 PetriNetUnfolderBase]: 4059/17183 cut-off events. [2025-03-08 22:01:20,510 INFO L125 PetriNetUnfolderBase]: For 4334/4506 co-relation queries the response was YES. [2025-03-08 22:01:20,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27972 conditions, 17183 events. 4059/17183 cut-off events. For 4334/4506 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 206268 event pairs, 2519 based on Foata normal form. 45/15652 useless extension candidates. Maximal degree in co-relation 26661. Up to 5557 conditions per place. [2025-03-08 22:01:20,584 INFO L140 encePairwiseOnDemand]: 188/197 looper letters, 52 selfloop transitions, 14 changer transitions 0/217 dead transitions. [2025-03-08 22:01:20,584 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 189 places, 217 transitions, 722 flow [2025-03-08 22:01:20,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:20,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:20,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-03-08 22:01:20,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8358714043993232 [2025-03-08 22:01:20,586 INFO L175 Difference]: Start difference. First operand has 187 places, 193 transitions, 504 flow. Second operand 3 states and 494 transitions. [2025-03-08 22:01:20,586 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 189 places, 217 transitions, 722 flow [2025-03-08 22:01:20,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 217 transitions, 684 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:01:20,596 INFO L231 Difference]: Finished difference. Result has 189 places, 205 transitions, 602 flow [2025-03-08 22:01:20,596 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=476, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=193, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=179, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=602, PETRI_PLACES=189, PETRI_TRANSITIONS=205} [2025-03-08 22:01:20,597 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 5 predicate places. [2025-03-08 22:01:20,597 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 205 transitions, 602 flow [2025-03-08 22:01:20,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:20,597 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:20,597 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-03-08 22:01:20,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 22:01:20,597 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:20,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1328868653, now seen corresponding path program 1 times [2025-03-08 22:01:20,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:20,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7840478] [2025-03-08 22:01:20,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:20,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:20,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-03-08 22:01:20,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-03-08 22:01:20,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:20,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:20,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:20,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:20,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7840478] [2025-03-08 22:01:20,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7840478] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:20,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:20,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:01:20,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776477643] [2025-03-08 22:01:20,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:20,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 22:01:20,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:20,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 22:01:20,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 22:01:20,713 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 197 [2025-03-08 22:01:20,714 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 205 transitions, 602 flow. Second operand has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:20,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:20,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 197 [2025-03-08 22:01:20,715 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:22,345 INFO L124 PetriNetUnfolderBase]: 3033/18249 cut-off events. [2025-03-08 22:01:22,345 INFO L125 PetriNetUnfolderBase]: For 1427/2762 co-relation queries the response was YES. [2025-03-08 22:01:22,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25659 conditions, 18249 events. 3033/18249 cut-off events. For 1427/2762 co-relation queries the response was YES. Maximal size of possible extension queue 504. Compared 238328 event pairs, 727 based on Foata normal form. 12/16348 useless extension candidates. Maximal degree in co-relation 23178. Up to 3767 conditions per place. [2025-03-08 22:01:22,425 INFO L140 encePairwiseOnDemand]: 192/197 looper letters, 56 selfloop transitions, 5 changer transitions 0/237 dead transitions. [2025-03-08 22:01:22,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 237 transitions, 788 flow [2025-03-08 22:01:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:01:22,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:01:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 974 transitions. [2025-03-08 22:01:22,427 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8240270727580372 [2025-03-08 22:01:22,427 INFO L175 Difference]: Start difference. First operand has 189 places, 205 transitions, 602 flow. Second operand 6 states and 974 transitions. [2025-03-08 22:01:22,427 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 237 transitions, 788 flow [2025-03-08 22:01:22,433 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 237 transitions, 760 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-08 22:01:22,435 INFO L231 Difference]: Finished difference. Result has 195 places, 207 transitions, 600 flow [2025-03-08 22:01:22,435 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=197, PETRI_DIFFERENCE_MINUEND_FLOW=574, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=205, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=200, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=600, PETRI_PLACES=195, PETRI_TRANSITIONS=207} [2025-03-08 22:01:22,436 INFO L279 CegarLoopForPetriNet]: 184 programPoint places, 11 predicate places. [2025-03-08 22:01:22,436 INFO L471 AbstractCegarLoop]: Abstraction has has 195 places, 207 transitions, 600 flow [2025-03-08 22:01:22,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 154.4) internal successors, (772), 5 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:22,436 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:22,436 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 22:01:22,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 22:01:22,437 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-03-08 22:01:22,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:22,437 INFO L85 PathProgramCache]: Analyzing trace with hash -929722159, now seen corresponding path program 1 times [2025-03-08 22:01:22,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:22,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727006872] [2025-03-08 22:01:22,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:22,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:22,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:01:22,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:01:22,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:22,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:22,462 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-08 22:01:22,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-03-08 22:01:22,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-03-08 22:01:22,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:22,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-08 22:01:22,483 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-08 22:01:22,483 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-08 22:01:22,483 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (15 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2025-03-08 22:01:22,484 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2025-03-08 22:01:22,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2025-03-08 22:01:22,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2025-03-08 22:01:22,485 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2025-03-08 22:01:22,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 22:01:22,485 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-03-08 22:01:22,485 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-03-08 22:01:22,485 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-03-08 22:01:22,512 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-03-08 22:01:22,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 231 places, 249 transitions, 525 flow [2025-03-08 22:01:22,545 INFO L124 PetriNetUnfolderBase]: 42/529 cut-off events. [2025-03-08 22:01:22,545 INFO L125 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-03-08 22:01:22,549 INFO L83 FinitePrefix]: Finished finitePrefix Result has 554 conditions, 529 events. 42/529 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2086 event pairs, 1 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 354. Up to 12 conditions per place. [2025-03-08 22:01:22,549 INFO L82 GeneralOperation]: Start removeDead. Operand has 231 places, 249 transitions, 525 flow [2025-03-08 22:01:22,552 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 231 places, 249 transitions, 525 flow [2025-03-08 22:01:22,554 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 22:01:22,554 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@3b76fc3a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 22:01:22,554 INFO L334 AbstractCegarLoop]: Starting to check reachability of 20 error locations. [2025-03-08 22:01:22,556 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-08 22:01:22,556 INFO L124 PetriNetUnfolderBase]: 0/47 cut-off events. [2025-03-08 22:01:22,556 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-08 22:01:22,556 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:22,556 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] [2025-03-08 22:01:22,557 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:01:22,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:22,558 INFO L85 PathProgramCache]: Analyzing trace with hash 753291090, now seen corresponding path program 1 times [2025-03-08 22:01:22,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:22,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422018079] [2025-03-08 22:01:22,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:22,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:22,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:22,569 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:22,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:22,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:22,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:22,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:22,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422018079] [2025-03-08 22:01:22,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422018079] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:22,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:22,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 22:01:22,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830934870] [2025-03-08 22:01:22,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:22,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 22:01:22,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:22,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 22:01:22,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 22:01:22,815 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 249 [2025-03-08 22:01:22,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 249 transitions, 525 flow. Second operand has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:22,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:22,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 249 [2025-03-08 22:01:22,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:28,706 INFO L124 PetriNetUnfolderBase]: 19605/68026 cut-off events. [2025-03-08 22:01:28,706 INFO L125 PetriNetUnfolderBase]: For 899/923 co-relation queries the response was YES. [2025-03-08 22:01:28,860 INFO L83 FinitePrefix]: Finished finitePrefix Result has 96481 conditions, 68026 events. 19605/68026 cut-off events. For 899/923 co-relation queries the response was YES. Maximal size of possible extension queue 1376. Compared 933815 event pairs, 8121 based on Foata normal form. 10823/73525 useless extension candidates. Maximal degree in co-relation 14369. Up to 20151 conditions per place. [2025-03-08 22:01:29,056 INFO L140 encePairwiseOnDemand]: 221/249 looper letters, 112 selfloop transitions, 5 changer transitions 0/296 dead transitions. [2025-03-08 22:01:29,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 233 places, 296 transitions, 853 flow [2025-03-08 22:01:29,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 22:01:29,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-08 22:01:29,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1292 transitions. [2025-03-08 22:01:29,058 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8647925033467202 [2025-03-08 22:01:29,059 INFO L175 Difference]: Start difference. First operand has 231 places, 249 transitions, 525 flow. Second operand 6 states and 1292 transitions. [2025-03-08 22:01:29,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 233 places, 296 transitions, 853 flow [2025-03-08 22:01:29,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 296 transitions, 853 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-08 22:01:29,062 INFO L231 Difference]: Finished difference. Result has 233 places, 224 transitions, 485 flow [2025-03-08 22:01:29,062 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=219, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=485, PETRI_PLACES=233, PETRI_TRANSITIONS=224} [2025-03-08 22:01:29,063 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 2 predicate places. [2025-03-08 22:01:29,063 INFO L471 AbstractCegarLoop]: Abstraction has has 233 places, 224 transitions, 485 flow [2025-03-08 22:01:29,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.5) internal successors, (1089), 6 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:29,063 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:29,063 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] [2025-03-08 22:01:29,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 22:01:29,064 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:01:29,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:29,064 INFO L85 PathProgramCache]: Analyzing trace with hash -230014134, now seen corresponding path program 1 times [2025-03-08 22:01:29,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:29,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1433539005] [2025-03-08 22:01:29,064 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:29,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:29,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-08 22:01:29,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-08 22:01:29,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:29,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:29,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:29,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:29,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1433539005] [2025-03-08 22:01:29,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1433539005] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:29,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:29,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 22:01:29,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606625073] [2025-03-08 22:01:29,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:29,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:29,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:29,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:29,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:29,106 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 249 [2025-03-08 22:01:29,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 233 places, 224 transitions, 485 flow. Second operand has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:29,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:29,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 249 [2025-03-08 22:01:29,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-08 22:01:32,564 INFO L124 PetriNetUnfolderBase]: 8935/36755 cut-off events. [2025-03-08 22:01:32,564 INFO L125 PetriNetUnfolderBase]: For 2302/2302 co-relation queries the response was YES. [2025-03-08 22:01:32,662 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51853 conditions, 36755 events. 8935/36755 cut-off events. For 2302/2302 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 485150 event pairs, 8857 based on Foata normal form. 1/33778 useless extension candidates. Maximal degree in co-relation 6336. Up to 12747 conditions per place. [2025-03-08 22:01:32,907 INFO L140 encePairwiseOnDemand]: 246/249 looper letters, 39 selfloop transitions, 2 changer transitions 0/231 dead transitions. [2025-03-08 22:01:32,907 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 235 places, 231 transitions, 583 flow [2025-03-08 22:01:32,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 22:01:32,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-08 22:01:32,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 618 transitions. [2025-03-08 22:01:32,909 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8273092369477911 [2025-03-08 22:01:32,909 INFO L175 Difference]: Start difference. First operand has 233 places, 224 transitions, 485 flow. Second operand 3 states and 618 transitions. [2025-03-08 22:01:32,909 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 235 places, 231 transitions, 583 flow [2025-03-08 22:01:32,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 231 transitions, 571 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-08 22:01:32,916 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 487 flow [2025-03-08 22:01:32,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=249, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=222, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=487, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-03-08 22:01:32,916 INFO L279 CegarLoopForPetriNet]: 231 programPoint places, 0 predicate places. [2025-03-08 22:01:32,917 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 487 flow [2025-03-08 22:01:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.0) internal successors, (582), 3 states have internal predecessors, (582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:32,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-08 22:01:32,917 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] [2025-03-08 22:01:32,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 22:01:32,917 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 17 more)] === [2025-03-08 22:01:32,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 22:01:32,918 INFO L85 PathProgramCache]: Analyzing trace with hash -433414008, now seen corresponding path program 1 times [2025-03-08 22:01:32,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 22:01:32,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207474409] [2025-03-08 22:01:32,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 22:01:32,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 22:01:32,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-08 22:01:32,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-08 22:01:32,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 22:01:32,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 22:01:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 22:01:32,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 22:01:32,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207474409] [2025-03-08 22:01:32,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207474409] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 22:01:32,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 22:01:32,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 22:01:32,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473003203] [2025-03-08 22:01:32,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 22:01:32,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 22:01:32,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 22:01:32,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 22:01:32,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 22:01:32,987 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 249 [2025-03-08 22:01:32,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 487 flow. Second operand has 3 states, 3 states have (on average 172.66666666666666) internal successors, (518), 3 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 22:01:32,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-08 22:01:32,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 249 [2025-03-08 22:01:32,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand