./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/no-data-race.prp --file ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.c -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 6e0d229af937fee01c7c221f23e66904ad9591c2ea18d20a8aa1a522ee98f00b --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:11:30,027 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:11:30,071 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-04-29 11:11:30,074 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:11:30,075 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:11:30,092 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:11:30,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:11:30,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:11:30,093 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:11:30,093 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:11:30,093 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:11:30,093 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:11:30,093 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:11:30,094 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:11:30,095 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:11:30,096 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:11:30,097 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:30,097 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:11:30,097 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:30,097 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:11:30,098 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:11:30,099 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 -> 6e0d229af937fee01c7c221f23e66904ad9591c2ea18d20a8aa1a522ee98f00b [2025-04-29 11:11:30,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:11:30,299 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:11:30,301 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:11:30,301 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:11:30,302 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:11:30,304 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.c [2025-04-29 11:11:31,527 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de106a88/9b89e61bb23842a2922ad3ee820c7669/FLAGdef6395e1 [2025-04-29 11:11:31,701 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:11:31,702 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-race-challenges/thread-join-array-const.c [2025-04-29 11:11:31,706 WARN L117 ultiparseSymbolTable]: System include pthread.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:11:31,718 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de106a88/9b89e61bb23842a2922ad3ee820c7669/FLAGdef6395e1 [2025-04-29 11:11:32,578 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6de106a88/9b89e61bb23842a2922ad3ee820c7669 [2025-04-29 11:11:32,580 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:11:32,581 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:11:32,582 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:32,582 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:11:32,585 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:11:32,586 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,586 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12b22d08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32, skipping insertion in model container [2025-04-29 11:11:32,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,595 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:11:32,739 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:32,746 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:11:32,770 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:11:32,784 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:11:32,785 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32 WrapperNode [2025-04-29 11:11:32,785 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:11:32,786 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:32,786 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:11:32,786 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:11:32,789 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,795 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,806 INFO L138 Inliner]: procedures = 13, calls = 12, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 51 [2025-04-29 11:11:32,807 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:11:32,807 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:11:32,807 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:11:32,807 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:11:32,813 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,814 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,818 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,819 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,823 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,826 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,831 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,832 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,832 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,835 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:11:32,835 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:11:32,835 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:11:32,835 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:11:32,836 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (1/1) ... [2025-04-29 11:11:32,839 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:11:32,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:11:32,860 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:11:32,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:11:32,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2025-04-29 11:11:32,878 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:11:32,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-29 11:11:32,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:11:32,879 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-29 11:11:32,945 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:11:32,946 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:11:33,090 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-29 11:11:33,091 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:11:33,103 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:11:33,103 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-29 11:11:33,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:33 BoogieIcfgContainer [2025-04-29 11:11:33,104 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:11:33,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:11:33,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:11:33,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:11:33,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:11:32" (1/3) ... [2025-04-29 11:11:33,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45189096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:33, skipping insertion in model container [2025-04-29 11:11:33,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:11:32" (2/3) ... [2025-04-29 11:11:33,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45189096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:11:33, skipping insertion in model container [2025-04-29 11:11:33,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:33" (3/3) ... [2025-04-29 11:11:33,110 INFO L128 eAbstractionObserver]: Analyzing ICFG thread-join-array-const.c [2025-04-29 11:11:33,119 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:11:33,120 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG thread-join-array-const.c that has 2 procedures, 72 locations, 72 edges, 1 initial locations, 2 loop locations, and 4 error locations. [2025-04-29 11:11:33,121 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-29 11:11:33,160 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-04-29 11:11:33,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 75 places, 73 transitions, 153 flow [2025-04-29 11:11:33,233 INFO L116 PetriNetUnfolderBase]: 1/106 cut-off events. [2025-04-29 11:11:33,236 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-29 11:11:33,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 111 conditions, 106 events. 1/106 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 207 event pairs, 0 based on Foata normal form. 0/95 useless extension candidates. Maximal degree in co-relation 4. Up to 3 conditions per place. [2025-04-29 11:11:33,238 INFO L82 GeneralOperation]: Start removeDead. Operand has 75 places, 73 transitions, 153 flow [2025-04-29 11:11:33,241 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 75 places, 73 transitions, 153 flow [2025-04-29 11:11:33,246 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:33,255 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79620bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:33,256 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-29 11:11:33,263 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:33,263 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:33,263 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:33,263 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,263 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:33,263 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:33,267 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,267 INFO L85 PathProgramCache]: Analyzing trace with hash 415069806, now seen corresponding path program 1 times [2025-04-29 11:11:33,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,273 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262017610] [2025-04-29 11:11:33,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:33,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:33,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:33,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,444 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262017610] [2025-04-29 11:11:33,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262017610] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:33,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380024078] [2025-04-29 11:11:33,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,452 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:33,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:33,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:33,514 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 73 [2025-04-29 11:11:33,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 73 transitions, 153 flow. Second operand has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:33,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 73 [2025-04-29 11:11:33,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:33,569 INFO L116 PetriNetUnfolderBase]: 8/173 cut-off events. [2025-04-29 11:11:33,569 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-29 11:11:33,570 INFO L83 FinitePrefix]: Finished finitePrefix Result has 207 conditions, 173 events. 8/173 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 521 event pairs, 2 based on Foata normal form. 1/155 useless extension candidates. Maximal degree in co-relation 146. Up to 17 conditions per place. [2025-04-29 11:11:33,571 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 10 selfloop transitions, 4 changer transitions 1/77 dead transitions. [2025-04-29 11:11:33,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 77 transitions, 191 flow [2025-04-29 11:11:33,573 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:33,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:33,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 264 transitions. [2025-04-29 11:11:33,585 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9041095890410958 [2025-04-29 11:11:33,588 INFO L175 Difference]: Start difference. First operand has 75 places, 73 transitions, 153 flow. Second operand 4 states and 264 transitions. [2025-04-29 11:11:33,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 77 transitions, 191 flow [2025-04-29 11:11:33,594 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 77 transitions, 191 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:33,596 INFO L231 Difference]: Finished difference. Result has 79 places, 73 transitions, 165 flow [2025-04-29 11:11:33,600 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=165, PETRI_PLACES=79, PETRI_TRANSITIONS=73} [2025-04-29 11:11:33,602 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-04-29 11:11:33,602 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 73 transitions, 165 flow [2025-04-29 11:11:33,603 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.25) internal successors, (253), 4 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:33,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:33,604 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] [2025-04-29 11:11:33,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:11:33,604 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:33,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:33,605 INFO L85 PathProgramCache]: Analyzing trace with hash -12622893, now seen corresponding path program 1 times [2025-04-29 11:11:33,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:33,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382622931] [2025-04-29 11:11:33,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:33,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:33,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:33,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:33,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:33,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:33,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:33,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:33,973 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382622931] [2025-04-29 11:11:33,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382622931] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:33,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:33,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:33,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228398131] [2025-04-29 11:11:33,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:33,974 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:33,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:33,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:33,975 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:34,087 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 50 out of 73 [2025-04-29 11:11:34,087 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 73 transitions, 165 flow. Second operand has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,087 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,087 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 50 of 73 [2025-04-29 11:11:34,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,149 INFO L116 PetriNetUnfolderBase]: 30/227 cut-off events. [2025-04-29 11:11:34,149 INFO L117 PetriNetUnfolderBase]: For 11/11 co-relation queries the response was YES. [2025-04-29 11:11:34,150 INFO L83 FinitePrefix]: Finished finitePrefix Result has 344 conditions, 227 events. 30/227 cut-off events. For 11/11 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 935 event pairs, 11 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 268. Up to 62 conditions per place. [2025-04-29 11:11:34,150 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 25 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2025-04-29 11:11:34,150 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 80 transitions, 239 flow [2025-04-29 11:11:34,153 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:34,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:34,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 331 transitions. [2025-04-29 11:11:34,155 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7557077625570776 [2025-04-29 11:11:34,155 INFO L175 Difference]: Start difference. First operand has 79 places, 73 transitions, 165 flow. Second operand 6 states and 331 transitions. [2025-04-29 11:11:34,155 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 80 transitions, 239 flow [2025-04-29 11:11:34,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 231 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:34,157 INFO L231 Difference]: Finished difference. Result has 80 places, 72 transitions, 165 flow [2025-04-29 11:11:34,157 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=165, PETRI_PLACES=80, PETRI_TRANSITIONS=72} [2025-04-29 11:11:34,157 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 5 predicate places. [2025-04-29 11:11:34,157 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 72 transitions, 165 flow [2025-04-29 11:11:34,159 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 51.5) internal successors, (309), 6 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,159 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,160 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] [2025-04-29 11:11:34,160 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:11:34,160 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:34,160 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,160 INFO L85 PathProgramCache]: Analyzing trace with hash -930423897, now seen corresponding path program 1 times [2025-04-29 11:11:34,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,160 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048311132] [2025-04-29 11:11:34,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:34,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:34,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,212 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,212 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048311132] [2025-04-29 11:11:34,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048311132] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:34,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098752427] [2025-04-29 11:11:34,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,212 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:34,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:34,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:34,222 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 63 out of 73 [2025-04-29 11:11:34,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 72 transitions, 165 flow. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 63 of 73 [2025-04-29 11:11:34,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,247 INFO L116 PetriNetUnfolderBase]: 6/139 cut-off events. [2025-04-29 11:11:34,247 INFO L117 PetriNetUnfolderBase]: For 4/10 co-relation queries the response was YES. [2025-04-29 11:11:34,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 183 conditions, 139 events. 6/139 cut-off events. For 4/10 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 386 event pairs, 4 based on Foata normal form. 1/128 useless extension candidates. Maximal degree in co-relation 136. Up to 21 conditions per place. [2025-04-29 11:11:34,248 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 9 selfloop transitions, 4 changer transitions 0/75 dead transitions. [2025-04-29 11:11:34,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 75 transitions, 197 flow [2025-04-29 11:11:34,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:34,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:34,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2025-04-29 11:11:34,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9269406392694064 [2025-04-29 11:11:34,249 INFO L175 Difference]: Start difference. First operand has 80 places, 72 transitions, 165 flow. Second operand 3 states and 203 transitions. [2025-04-29 11:11:34,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 75 transitions, 197 flow [2025-04-29 11:11:34,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 75 transitions, 187 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:34,251 INFO L231 Difference]: Finished difference. Result has 79 places, 75 transitions, 185 flow [2025-04-29 11:11:34,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=72, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=79, PETRI_TRANSITIONS=75} [2025-04-29 11:11:34,251 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 4 predicate places. [2025-04-29 11:11:34,251 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 75 transitions, 185 flow [2025-04-29 11:11:34,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,252 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-04-29 11:11:34,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:11:34,252 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:34,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1419636567, now seen corresponding path program 1 times [2025-04-29 11:11:34,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128068325] [2025-04-29 11:11:34,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:34,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:34,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,315 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128068325] [2025-04-29 11:11:34,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128068325] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:34,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104307063] [2025-04-29 11:11:34,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,316 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:34,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:34,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:34,349 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 73 [2025-04-29 11:11:34,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 75 transitions, 185 flow. Second operand has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 73 [2025-04-29 11:11:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,369 INFO L116 PetriNetUnfolderBase]: 2/109 cut-off events. [2025-04-29 11:11:34,370 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:34,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 141 conditions, 109 events. 2/109 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 159 event pairs, 0 based on Foata normal form. 3/106 useless extension candidates. Maximal degree in co-relation 88. Up to 7 conditions per place. [2025-04-29 11:11:34,372 INFO L140 encePairwiseOnDemand]: 68/73 looper letters, 9 selfloop transitions, 3 changer transitions 7/73 dead transitions. [2025-04-29 11:11:34,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 73 transitions, 195 flow [2025-04-29 11:11:34,372 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:34,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:34,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 262 transitions. [2025-04-29 11:11:34,374 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8972602739726028 [2025-04-29 11:11:34,374 INFO L175 Difference]: Start difference. First operand has 79 places, 75 transitions, 185 flow. Second operand 4 states and 262 transitions. [2025-04-29 11:11:34,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 73 transitions, 195 flow [2025-04-29 11:11:34,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 73 transitions, 183 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:34,377 INFO L231 Difference]: Finished difference. Result has 78 places, 64 transitions, 149 flow [2025-04-29 11:11:34,377 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=78, PETRI_TRANSITIONS=64} [2025-04-29 11:11:34,378 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, 3 predicate places. [2025-04-29 11:11:34,378 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 64 transitions, 149 flow [2025-04-29 11:11:34,378 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 63.5) internal successors, (254), 4 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,379 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,379 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] [2025-04-29 11:11:34,379 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:11:34,379 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:34,380 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,380 INFO L85 PathProgramCache]: Analyzing trace with hash 298399712, now seen corresponding path program 1 times [2025-04-29 11:11:34,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,380 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651705722] [2025-04-29 11:11:34,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:34,399 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:34,399 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,399 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:34,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,472 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651705722] [2025-04-29 11:11:34,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651705722] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:34,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506491606] [2025-04-29 11:11:34,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,472 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:34,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:34,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:34,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 60 out of 73 [2025-04-29 11:11:34,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 64 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 60 of 73 [2025-04-29 11:11:34,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,560 INFO L116 PetriNetUnfolderBase]: 6/91 cut-off events. [2025-04-29 11:11:34,560 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-29 11:11:34,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 124 conditions, 91 events. 6/91 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 143 event pairs, 0 based on Foata normal form. 3/93 useless extension candidates. Maximal degree in co-relation 118. Up to 5 conditions per place. [2025-04-29 11:11:34,561 INFO L140 encePairwiseOnDemand]: 67/73 looper letters, 10 selfloop transitions, 5 changer transitions 0/50 dead transitions. [2025-04-29 11:11:34,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 50 transitions, 138 flow [2025-04-29 11:11:34,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:34,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 436 transitions. [2025-04-29 11:11:34,562 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8532289628180039 [2025-04-29 11:11:34,563 INFO L175 Difference]: Start difference. First operand has 78 places, 64 transitions, 149 flow. Second operand 7 states and 436 transitions. [2025-04-29 11:11:34,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 50 transitions, 138 flow [2025-04-29 11:11:34,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 50 transitions, 135 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:34,564 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 103 flow [2025-04-29 11:11:34,564 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=73, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=103, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2025-04-29 11:11:34,564 INFO L279 CegarLoopForPetriNet]: 75 programPoint places, -20 predicate places. [2025-04-29 11:11:34,564 INFO L485 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 103 flow [2025-04-29 11:11:34,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 61.5) internal successors, (369), 6 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,564 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] [2025-04-29 11:11:34,565 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:11:34,565 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 3 more)] === [2025-04-29 11:11:34,565 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash -597363769, now seen corresponding path program 1 times [2025-04-29 11:11:34,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882098558] [2025-04-29 11:11:34,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:34,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:34,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:34,585 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:34,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-29 11:11:34,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-29 11:11:34,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:34,607 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:34,607 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:34,607 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 6 remaining) [2025-04-29 11:11:34,609 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (4 of 6 remaining) [2025-04-29 11:11:34,610 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (3 of 6 remaining) [2025-04-29 11:11:34,610 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (2 of 6 remaining) [2025-04-29 11:11:34,610 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 6 remaining) [2025-04-29 11:11:34,610 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 6 remaining) [2025-04-29 11:11:34,610 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:11:34,610 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-04-29 11:11:34,612 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:34,612 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-29 11:11:34,628 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-29 11:11:34,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 94 places, 91 transitions, 198 flow [2025-04-29 11:11:34,656 INFO L116 PetriNetUnfolderBase]: 3/192 cut-off events. [2025-04-29 11:11:34,656 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-29 11:11:34,656 INFO L83 FinitePrefix]: Finished finitePrefix Result has 204 conditions, 192 events. 3/192 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 451 event pairs, 0 based on Foata normal form. 0/172 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2025-04-29 11:11:34,657 INFO L82 GeneralOperation]: Start removeDead. Operand has 94 places, 91 transitions, 198 flow [2025-04-29 11:11:34,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 91 transitions, 198 flow [2025-04-29 11:11:34,658 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:34,658 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79620bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:34,658 INFO L341 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-04-29 11:11:34,660 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:34,660 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:34,660 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:34,660 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,660 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:34,660 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:34,661 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1718975694, now seen corresponding path program 1 times [2025-04-29 11:11:34,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,661 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914687049] [2025-04-29 11:11:34,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:34,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:34,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,688 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914687049] [2025-04-29 11:11:34,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914687049] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:34,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11063612] [2025-04-29 11:11:34,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,688 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:34,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:34,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:34,716 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:11:34,717 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 91 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,717 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:34,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:11:34,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:34,787 INFO L116 PetriNetUnfolderBase]: 72/577 cut-off events. [2025-04-29 11:11:34,787 INFO L117 PetriNetUnfolderBase]: For 36/36 co-relation queries the response was YES. [2025-04-29 11:11:34,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 743 conditions, 577 events. 72/577 cut-off events. For 36/36 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3317 event pairs, 35 based on Foata normal form. 1/529 useless extension candidates. Maximal degree in co-relation 338. Up to 106 conditions per place. [2025-04-29 11:11:34,790 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 18 selfloop transitions, 4 changer transitions 0/98 dead transitions. [2025-04-29 11:11:34,790 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 98 transitions, 256 flow [2025-04-29 11:11:34,791 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:34,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 327 transitions. [2025-04-29 11:11:34,792 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8983516483516484 [2025-04-29 11:11:34,792 INFO L175 Difference]: Start difference. First operand has 94 places, 91 transitions, 198 flow. Second operand 4 states and 327 transitions. [2025-04-29 11:11:34,792 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 98 transitions, 256 flow [2025-04-29 11:11:34,793 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 98 transitions, 256 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:34,794 INFO L231 Difference]: Finished difference. Result has 98 places, 92 transitions, 214 flow [2025-04-29 11:11:34,794 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=214, PETRI_PLACES=98, PETRI_TRANSITIONS=92} [2025-04-29 11:11:34,794 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 4 predicate places. [2025-04-29 11:11:34,794 INFO L485 AbstractCegarLoop]: Abstraction has has 98 places, 92 transitions, 214 flow [2025-04-29 11:11:34,795 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.25) internal successors, (309), 4 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:34,795 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:34,795 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] [2025-04-29 11:11:34,795 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-29 11:11:34,795 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:34,795 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:34,796 INFO L85 PathProgramCache]: Analyzing trace with hash 963551854, now seen corresponding path program 1 times [2025-04-29 11:11:34,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:34,796 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25551661] [2025-04-29 11:11:34,796 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:34,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:34,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:34,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:34,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:34,804 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:34,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:34,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:34,986 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25551661] [2025-04-29 11:11:34,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25551661] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:34,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:34,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:34,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530215678] [2025-04-29 11:11:34,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:34,987 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:34,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:34,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:34,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:35,067 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 64 out of 91 [2025-04-29 11:11:35,067 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 92 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,067 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,067 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 64 of 91 [2025-04-29 11:11:35,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,233 INFO L116 PetriNetUnfolderBase]: 236/962 cut-off events. [2025-04-29 11:11:35,233 INFO L117 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2025-04-29 11:11:35,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1497 conditions, 962 events. 236/962 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 6772 event pairs, 34 based on Foata normal form. 0/896 useless extension candidates. Maximal degree in co-relation 457. Up to 313 conditions per place. [2025-04-29 11:11:35,239 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 38 selfloop transitions, 5 changer transitions 0/107 dead transitions. [2025-04-29 11:11:35,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 107 transitions, 330 flow [2025-04-29 11:11:35,241 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:35,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:35,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2025-04-29 11:11:35,242 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.782051282051282 [2025-04-29 11:11:35,242 INFO L175 Difference]: Start difference. First operand has 98 places, 92 transitions, 214 flow. Second operand 6 states and 427 transitions. [2025-04-29 11:11:35,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 107 transitions, 330 flow [2025-04-29 11:11:35,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 107 transitions, 324 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:35,246 INFO L231 Difference]: Finished difference. Result has 100 places, 91 transitions, 216 flow [2025-04-29 11:11:35,247 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=216, PETRI_PLACES=100, PETRI_TRANSITIONS=91} [2025-04-29 11:11:35,248 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2025-04-29 11:11:35,248 INFO L485 AbstractCegarLoop]: Abstraction has has 100 places, 91 transitions, 216 flow [2025-04-29 11:11:35,248 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 65.5) internal successors, (393), 6 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,249 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,249 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] [2025-04-29 11:11:35,249 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-29 11:11:35,249 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:35,250 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,250 INFO L85 PathProgramCache]: Analyzing trace with hash 135966546, now seen corresponding path program 1 times [2025-04-29 11:11:35,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,250 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126710134] [2025-04-29 11:11:35,250 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:35,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:35,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:35,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,279 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126710134] [2025-04-29 11:11:35,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126710134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:35,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584917750] [2025-04-29 11:11:35,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,280 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:35,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:35,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:35,292 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:11:35,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 216 flow. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:11:35,293 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,378 INFO L116 PetriNetUnfolderBase]: 116/717 cut-off events. [2025-04-29 11:11:35,379 INFO L117 PetriNetUnfolderBase]: For 120/165 co-relation queries the response was YES. [2025-04-29 11:11:35,381 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1015 conditions, 717 events. 116/717 cut-off events. For 120/165 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 4689 event pairs, 58 based on Foata normal form. 4/631 useless extension candidates. Maximal degree in co-relation 473. Up to 185 conditions per place. [2025-04-29 11:11:35,384 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 18 selfloop transitions, 5 changer transitions 0/99 dead transitions. [2025-04-29 11:11:35,384 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 99 transitions, 286 flow [2025-04-29 11:11:35,385 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:35,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:35,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2025-04-29 11:11:35,386 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9230769230769231 [2025-04-29 11:11:35,386 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 216 flow. Second operand 3 states and 252 transitions. [2025-04-29 11:11:35,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 99 transitions, 286 flow [2025-04-29 11:11:35,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 99 transitions, 276 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:35,388 INFO L231 Difference]: Finished difference. Result has 99 places, 95 transitions, 244 flow [2025-04-29 11:11:35,389 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=99, PETRI_TRANSITIONS=95} [2025-04-29 11:11:35,389 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 5 predicate places. [2025-04-29 11:11:35,389 INFO L485 AbstractCegarLoop]: Abstraction has has 99 places, 95 transitions, 244 flow [2025-04-29 11:11:35,389 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,389 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,389 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-04-29 11:11:35,390 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-29 11:11:35,390 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:35,391 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,391 INFO L85 PathProgramCache]: Analyzing trace with hash -610225086, now seen corresponding path program 1 times [2025-04-29 11:11:35,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,391 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677629109] [2025-04-29 11:11:35,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:35,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:35,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677629109] [2025-04-29 11:11:35,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677629109] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:35,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909196709] [2025-04-29 11:11:35,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,446 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:35,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:35,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:35,473 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:11:35,473 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 95 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,474 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,474 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:11:35,474 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,550 INFO L116 PetriNetUnfolderBase]: 63/577 cut-off events. [2025-04-29 11:11:35,550 INFO L117 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2025-04-29 11:11:35,554 INFO L83 FinitePrefix]: Finished finitePrefix Result has 807 conditions, 577 events. 63/577 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 3215 event pairs, 21 based on Foata normal form. 15/545 useless extension candidates. Maximal degree in co-relation 636. Up to 72 conditions per place. [2025-04-29 11:11:35,555 INFO L140 encePairwiseOnDemand]: 86/91 looper letters, 19 selfloop transitions, 4 changer transitions 3/106 dead transitions. [2025-04-29 11:11:35,555 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 106 transitions, 324 flow [2025-04-29 11:11:35,556 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:35,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:35,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2025-04-29 11:11:35,557 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9093406593406593 [2025-04-29 11:11:35,557 INFO L175 Difference]: Start difference. First operand has 99 places, 95 transitions, 244 flow. Second operand 4 states and 331 transitions. [2025-04-29 11:11:35,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 106 transitions, 324 flow [2025-04-29 11:11:35,558 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 106 transitions, 314 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:35,560 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 250 flow [2025-04-29 11:11:35,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2025-04-29 11:11:35,561 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 7 predicate places. [2025-04-29 11:11:35,561 INFO L485 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 250 flow [2025-04-29 11:11:35,562 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.5) internal successors, (310), 4 states have internal predecessors, (310), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,562 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,562 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] [2025-04-29 11:11:35,562 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-29 11:11:35,562 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:35,562 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1829513232, now seen corresponding path program 1 times [2025-04-29 11:11:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,563 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086274952] [2025-04-29 11:11:35,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:35,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:35,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:35,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,643 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086274952] [2025-04-29 11:11:35,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086274952] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:35,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703454369] [2025-04-29 11:11:35,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,644 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:35,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:35,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:35,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-04-29 11:11:35,723 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 250 flow. Second operand has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-04-29 11:11:35,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,826 INFO L116 PetriNetUnfolderBase]: 111/874 cut-off events. [2025-04-29 11:11:35,826 INFO L117 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2025-04-29 11:11:35,829 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1235 conditions, 874 events. 111/874 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 5539 event pairs, 21 based on Foata normal form. 3/803 useless extension candidates. Maximal degree in co-relation 744. Up to 125 conditions per place. [2025-04-29 11:11:35,831 INFO L140 encePairwiseOnDemand]: 84/91 looper letters, 24 selfloop transitions, 7 changer transitions 3/112 dead transitions. [2025-04-29 11:11:35,831 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 112 transitions, 350 flow [2025-04-29 11:11:35,831 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:35,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:35,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 553 transitions. [2025-04-29 11:11:35,833 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8681318681318682 [2025-04-29 11:11:35,833 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 250 flow. Second operand 7 states and 553 transitions. [2025-04-29 11:11:35,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 112 transitions, 350 flow [2025-04-29 11:11:35,835 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 112 transitions, 344 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:35,836 INFO L231 Difference]: Finished difference. Result has 108 places, 98 transitions, 274 flow [2025-04-29 11:11:35,836 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=274, PETRI_PLACES=108, PETRI_TRANSITIONS=98} [2025-04-29 11:11:35,837 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 14 predicate places. [2025-04-29 11:11:35,838 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 98 transitions, 274 flow [2025-04-29 11:11:35,839 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 75.5) internal successors, (453), 6 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,839 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,839 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] [2025-04-29 11:11:35,839 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-29 11:11:35,839 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:35,840 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1327653491, now seen corresponding path program 1 times [2025-04-29 11:11:35,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,840 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959879525] [2025-04-29 11:11:35,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,840 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:35,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:35,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:35,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:35,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:35,870 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959879525] [2025-04-29 11:11:35,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959879525] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:35,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:35,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:35,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809000478] [2025-04-29 11:11:35,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:35,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:35,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:35,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:35,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:35,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 91 [2025-04-29 11:11:35,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 98 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:35,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 91 [2025-04-29 11:11:35,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:35,943 INFO L116 PetriNetUnfolderBase]: 58/592 cut-off events. [2025-04-29 11:11:35,943 INFO L117 PetriNetUnfolderBase]: For 156/209 co-relation queries the response was YES. [2025-04-29 11:11:35,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 890 conditions, 592 events. 58/592 cut-off events. For 156/209 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 3416 event pairs, 32 based on Foata normal form. 3/548 useless extension candidates. Maximal degree in co-relation 784. Up to 111 conditions per place. [2025-04-29 11:11:35,946 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 18 selfloop transitions, 6 changer transitions 0/105 dead transitions. [2025-04-29 11:11:35,946 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 105 transitions, 343 flow [2025-04-29 11:11:35,946 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:35,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2025-04-29 11:11:35,947 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9194139194139194 [2025-04-29 11:11:35,948 INFO L175 Difference]: Start difference. First operand has 108 places, 98 transitions, 274 flow. Second operand 3 states and 251 transitions. [2025-04-29 11:11:35,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 105 transitions, 343 flow [2025-04-29 11:11:35,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 333 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:35,951 INFO L231 Difference]: Finished difference. Result has 109 places, 102 transitions, 310 flow [2025-04-29 11:11:35,951 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=310, PETRI_PLACES=109, PETRI_TRANSITIONS=102} [2025-04-29 11:11:35,952 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, 15 predicate places. [2025-04-29 11:11:35,952 INFO L485 AbstractCegarLoop]: Abstraction has has 109 places, 102 transitions, 310 flow [2025-04-29 11:11:35,952 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:35,952 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:35,953 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-04-29 11:11:35,953 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-29 11:11:35,953 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:35,953 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:35,953 INFO L85 PathProgramCache]: Analyzing trace with hash -2123433083, now seen corresponding path program 1 times [2025-04-29 11:11:35,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:35,954 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757989484] [2025-04-29 11:11:35,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:35,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:35,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:35,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:35,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:35,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:36,078 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:36,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:36,079 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757989484] [2025-04-29 11:11:36,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757989484] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:36,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:36,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:36,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350687443] [2025-04-29 11:11:36,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:36,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:36,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:36,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:36,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:36,158 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 91 [2025-04-29 11:11:36,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 102 transitions, 310 flow. Second operand has 8 states, 8 states have (on average 75.625) internal successors, (605), 8 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:36,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 91 [2025-04-29 11:11:36,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:36,245 INFO L116 PetriNetUnfolderBase]: 71/451 cut-off events. [2025-04-29 11:11:36,246 INFO L117 PetriNetUnfolderBase]: For 88/92 co-relation queries the response was YES. [2025-04-29 11:11:36,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 734 conditions, 451 events. 71/451 cut-off events. For 88/92 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2405 event pairs, 1 based on Foata normal form. 14/454 useless extension candidates. Maximal degree in co-relation 722. Up to 32 conditions per place. [2025-04-29 11:11:36,248 INFO L140 encePairwiseOnDemand]: 85/91 looper letters, 25 selfloop transitions, 8 changer transitions 0/89 dead transitions. [2025-04-29 11:11:36,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 89 transitions, 320 flow [2025-04-29 11:11:36,248 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:36,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:36,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 774 transitions. [2025-04-29 11:11:36,249 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8505494505494505 [2025-04-29 11:11:36,249 INFO L175 Difference]: Start difference. First operand has 109 places, 102 transitions, 310 flow. Second operand 10 states and 774 transitions. [2025-04-29 11:11:36,249 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 89 transitions, 320 flow [2025-04-29 11:11:36,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 89 transitions, 306 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-29 11:11:36,251 INFO L231 Difference]: Finished difference. Result has 87 places, 71 transitions, 220 flow [2025-04-29 11:11:36,251 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=91, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=220, PETRI_PLACES=87, PETRI_TRANSITIONS=71} [2025-04-29 11:11:36,252 INFO L279 CegarLoopForPetriNet]: 94 programPoint places, -7 predicate places. [2025-04-29 11:11:36,252 INFO L485 AbstractCegarLoop]: Abstraction has has 87 places, 71 transitions, 220 flow [2025-04-29 11:11:36,252 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 75.625) internal successors, (605), 8 states have internal predecessors, (605), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,252 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:36,252 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:36,252 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-04-29 11:11:36,252 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 4 more)] === [2025-04-29 11:11:36,253 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:36,253 INFO L85 PathProgramCache]: Analyzing trace with hash 1635231021, now seen corresponding path program 1 times [2025-04-29 11:11:36,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:36,253 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472259082] [2025-04-29 11:11:36,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:36,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:36,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:36,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:36,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:36,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:36,266 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:36,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:36,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:36,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:36,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:36,281 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:36,281 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:36,281 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 7 remaining) [2025-04-29 11:11:36,281 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (5 of 7 remaining) [2025-04-29 11:11:36,282 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (4 of 7 remaining) [2025-04-29 11:11:36,282 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (3 of 7 remaining) [2025-04-29 11:11:36,282 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 7 remaining) [2025-04-29 11:11:36,282 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 7 remaining) [2025-04-29 11:11:36,282 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 7 remaining) [2025-04-29 11:11:36,282 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-04-29 11:11:36,282 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:36,282 WARN L247 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:36,283 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-04-29 11:11:36,295 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-29 11:11:36,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 113 places, 109 transitions, 245 flow [2025-04-29 11:11:36,313 INFO L116 PetriNetUnfolderBase]: 8/329 cut-off events. [2025-04-29 11:11:36,313 INFO L117 PetriNetUnfolderBase]: For 19/19 co-relation queries the response was YES. [2025-04-29 11:11:36,314 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354 conditions, 329 events. 8/329 cut-off events. For 19/19 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 981 event pairs, 1 based on Foata normal form. 0/294 useless extension candidates. Maximal degree in co-relation 200. Up to 12 conditions per place. [2025-04-29 11:11:36,314 INFO L82 GeneralOperation]: Start removeDead. Operand has 113 places, 109 transitions, 245 flow [2025-04-29 11:11:36,315 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 113 places, 109 transitions, 245 flow [2025-04-29 11:11:36,317 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:36,317 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79620bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:36,317 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-29 11:11:36,318 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:36,318 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:36,318 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:36,319 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:36,319 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:36,319 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:36,319 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:36,319 INFO L85 PathProgramCache]: Analyzing trace with hash -919775378, now seen corresponding path program 1 times [2025-04-29 11:11:36,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:36,319 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1191466108] [2025-04-29 11:11:36,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:36,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:36,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:36,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:36,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:36,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:36,343 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:36,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:36,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1191466108] [2025-04-29 11:11:36,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1191466108] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:36,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122985831] [2025-04-29 11:11:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:36,344 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:36,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:36,345 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:36,345 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:36,369 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 109 [2025-04-29 11:11:36,370 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 109 transitions, 245 flow. Second operand has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,370 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:36,370 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 109 [2025-04-29 11:11:36,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:36,535 INFO L116 PetriNetUnfolderBase]: 413/2213 cut-off events. [2025-04-29 11:11:36,535 INFO L117 PetriNetUnfolderBase]: For 232/232 co-relation queries the response was YES. [2025-04-29 11:11:36,539 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2987 conditions, 2213 events. 413/2213 cut-off events. For 232/232 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 17796 event pairs, 232 based on Foata normal form. 1/2027 useless extension candidates. Maximal degree in co-relation 1335. Up to 496 conditions per place. [2025-04-29 11:11:36,545 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 24 selfloop transitions, 4 changer transitions 0/118 dead transitions. [2025-04-29 11:11:36,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 118 transitions, 319 flow [2025-04-29 11:11:36,546 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:36,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:36,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2025-04-29 11:11:36,547 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8922018348623854 [2025-04-29 11:11:36,547 INFO L175 Difference]: Start difference. First operand has 113 places, 109 transitions, 245 flow. Second operand 4 states and 389 transitions. [2025-04-29 11:11:36,547 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 118 transitions, 319 flow [2025-04-29 11:11:36,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 319 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:36,548 INFO L231 Difference]: Finished difference. Result has 117 places, 110 transitions, 261 flow [2025-04-29 11:11:36,549 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=105, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=261, PETRI_PLACES=117, PETRI_TRANSITIONS=110} [2025-04-29 11:11:36,549 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 4 predicate places. [2025-04-29 11:11:36,549 INFO L485 AbstractCegarLoop]: Abstraction has has 117 places, 110 transitions, 261 flow [2025-04-29 11:11:36,549 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.25) internal successors, (365), 4 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,549 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:36,549 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] [2025-04-29 11:11:36,549 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-04-29 11:11:36,549 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:36,549 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 716892827, now seen corresponding path program 1 times [2025-04-29 11:11:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:36,550 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614446683] [2025-04-29 11:11:36,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:36,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:36,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:36,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:36,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:36,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:36,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:36,666 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614446683] [2025-04-29 11:11:36,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614446683] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:36,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:36,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:36,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012206544] [2025-04-29 11:11:36,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:36,667 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:36,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:36,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:36,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:36,741 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 109 [2025-04-29 11:11:36,742 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 110 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:36,742 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:36,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 109 [2025-04-29 11:11:36,742 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:37,051 INFO L116 PetriNetUnfolderBase]: 1295/3962 cut-off events. [2025-04-29 11:11:37,052 INFO L117 PetriNetUnfolderBase]: For 323/323 co-relation queries the response was YES. [2025-04-29 11:11:37,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6314 conditions, 3962 events. 1295/3962 cut-off events. For 323/323 co-relation queries the response was YES. Maximal size of possible extension queue 215. Compared 35087 event pairs, 181 based on Foata normal form. 0/3689 useless extension candidates. Maximal degree in co-relation 2095. Up to 1483 conditions per place. [2025-04-29 11:11:37,069 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 50 selfloop transitions, 5 changer transitions 0/133 dead transitions. [2025-04-29 11:11:37,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 133 transitions, 417 flow [2025-04-29 11:11:37,070 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:37,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 523 transitions. [2025-04-29 11:11:37,071 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.7996941896024465 [2025-04-29 11:11:37,071 INFO L175 Difference]: Start difference. First operand has 117 places, 110 transitions, 261 flow. Second operand 6 states and 523 transitions. [2025-04-29 11:11:37,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 133 transitions, 417 flow [2025-04-29 11:11:37,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 133 transitions, 411 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:37,074 INFO L231 Difference]: Finished difference. Result has 119 places, 109 transitions, 263 flow [2025-04-29 11:11:37,074 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=263, PETRI_PLACES=119, PETRI_TRANSITIONS=109} [2025-04-29 11:11:37,075 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 6 predicate places. [2025-04-29 11:11:37,075 INFO L485 AbstractCegarLoop]: Abstraction has has 119 places, 109 transitions, 263 flow [2025-04-29 11:11:37,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,075 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:37,075 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] [2025-04-29 11:11:37,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:11:37,075 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:37,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash -1931306641, now seen corresponding path program 1 times [2025-04-29 11:11:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:37,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272377962] [2025-04-29 11:11:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:37,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:37,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:37,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:37,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:37,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:37,094 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272377962] [2025-04-29 11:11:37,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272377962] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:37,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:37,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:37,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858001790] [2025-04-29 11:11:37,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:37,095 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:37,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:37,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:37,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:37,110 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2025-04-29 11:11:37,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 109 transitions, 263 flow. Second operand has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:37,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2025-04-29 11:11:37,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:37,413 INFO L116 PetriNetUnfolderBase]: 1023/4253 cut-off events. [2025-04-29 11:11:37,414 INFO L117 PetriNetUnfolderBase]: For 862/1124 co-relation queries the response was YES. [2025-04-29 11:11:37,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6225 conditions, 4253 events. 1023/4253 cut-off events. For 862/1124 co-relation queries the response was YES. Maximal size of possible extension queue 193. Compared 40834 event pairs, 581 based on Foata normal form. 7/3710 useless extension candidates. Maximal degree in co-relation 2138. Up to 1329 conditions per place. [2025-04-29 11:11:37,434 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 27 selfloop transitions, 6 changer transitions 0/122 dead transitions. [2025-04-29 11:11:37,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 122 transitions, 373 flow [2025-04-29 11:11:37,434 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 301 transitions. [2025-04-29 11:11:37,435 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9204892966360856 [2025-04-29 11:11:37,435 INFO L175 Difference]: Start difference. First operand has 119 places, 109 transitions, 263 flow. Second operand 3 states and 301 transitions. [2025-04-29 11:11:37,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 122 transitions, 373 flow [2025-04-29 11:11:37,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 122 transitions, 363 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:37,437 INFO L231 Difference]: Finished difference. Result has 118 places, 114 transitions, 299 flow [2025-04-29 11:11:37,437 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=253, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=103, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=299, PETRI_PLACES=118, PETRI_TRANSITIONS=114} [2025-04-29 11:11:37,438 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 5 predicate places. [2025-04-29 11:11:37,438 INFO L485 AbstractCegarLoop]: Abstraction has has 118 places, 114 transitions, 299 flow [2025-04-29 11:11:37,438 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.66666666666667) internal successors, (272), 3 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,438 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:37,438 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-04-29 11:11:37,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:11:37,438 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:37,439 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:37,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1107073791, now seen corresponding path program 1 times [2025-04-29 11:11:37,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:37,439 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228985523] [2025-04-29 11:11:37,439 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:37,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:37,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:37,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:37,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:37,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:37,474 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228985523] [2025-04-29 11:11:37,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228985523] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:37,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:37,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:37,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862880201] [2025-04-29 11:11:37,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:37,474 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:37,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:37,475 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:37,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:37,507 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 109 [2025-04-29 11:11:37,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 114 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:37,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 109 [2025-04-29 11:11:37,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:37,755 INFO L116 PetriNetUnfolderBase]: 616/3183 cut-off events. [2025-04-29 11:11:37,755 INFO L117 PetriNetUnfolderBase]: For 440/444 co-relation queries the response was YES. [2025-04-29 11:11:37,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4711 conditions, 3183 events. 616/3183 cut-off events. For 440/444 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 29196 event pairs, 252 based on Foata normal form. 63/2918 useless extension candidates. Maximal degree in co-relation 3838. Up to 511 conditions per place. [2025-04-29 11:11:37,774 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 31 selfloop transitions, 4 changer transitions 0/130 dead transitions. [2025-04-29 11:11:37,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 130 transitions, 410 flow [2025-04-29 11:11:37,775 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:37,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:37,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2025-04-29 11:11:37,776 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.908256880733945 [2025-04-29 11:11:37,777 INFO L175 Difference]: Start difference. First operand has 118 places, 114 transitions, 299 flow. Second operand 4 states and 396 transitions. [2025-04-29 11:11:37,777 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 130 transitions, 410 flow [2025-04-29 11:11:37,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 130 transitions, 398 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:37,779 INFO L231 Difference]: Finished difference. Result has 120 places, 115 transitions, 303 flow [2025-04-29 11:11:37,779 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=303, PETRI_PLACES=120, PETRI_TRANSITIONS=115} [2025-04-29 11:11:37,780 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 7 predicate places. [2025-04-29 11:11:37,781 INFO L485 AbstractCegarLoop]: Abstraction has has 120 places, 115 transitions, 303 flow [2025-04-29 11:11:37,781 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 91.5) internal successors, (366), 4 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,781 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:37,781 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] [2025-04-29 11:11:37,781 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-04-29 11:11:37,781 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:37,782 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:37,782 INFO L85 PathProgramCache]: Analyzing trace with hash 230036224, now seen corresponding path program 1 times [2025-04-29 11:11:37,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:37,782 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272648417] [2025-04-29 11:11:37,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:37,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:37,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:37,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:37,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:37,791 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:37,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:37,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:37,848 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272648417] [2025-04-29 11:11:37,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272648417] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:37,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:37,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:37,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490986087] [2025-04-29 11:11:37,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:37,848 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:37,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:37,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:37,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:37,898 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2025-04-29 11:11:37,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 115 transitions, 303 flow. Second operand has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:37,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:37,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2025-04-29 11:11:37,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:38,227 INFO L116 PetriNetUnfolderBase]: 950/4899 cut-off events. [2025-04-29 11:11:38,228 INFO L117 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2025-04-29 11:11:38,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7124 conditions, 4899 events. 950/4899 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 49284 event pairs, 310 based on Foata normal form. 3/4325 useless extension candidates. Maximal degree in co-relation 3730. Up to 1100 conditions per place. [2025-04-29 11:11:38,253 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 35 selfloop transitions, 7 changer transitions 0/135 dead transitions. [2025-04-29 11:11:38,253 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 135 transitions, 429 flow [2025-04-29 11:11:38,253 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:38,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:38,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 659 transitions. [2025-04-29 11:11:38,255 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8636959370904325 [2025-04-29 11:11:38,255 INFO L175 Difference]: Start difference. First operand has 120 places, 115 transitions, 303 flow. Second operand 7 states and 659 transitions. [2025-04-29 11:11:38,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 135 transitions, 429 flow [2025-04-29 11:11:38,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 135 transitions, 423 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:38,258 INFO L231 Difference]: Finished difference. Result has 127 places, 118 transitions, 333 flow [2025-04-29 11:11:38,259 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=115, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=333, PETRI_PLACES=127, PETRI_TRANSITIONS=118} [2025-04-29 11:11:38,259 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 14 predicate places. [2025-04-29 11:11:38,259 INFO L485 AbstractCegarLoop]: Abstraction has has 127 places, 118 transitions, 333 flow [2025-04-29 11:11:38,259 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 89.5) internal successors, (537), 6 states have internal predecessors, (537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,259 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:38,260 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] [2025-04-29 11:11:38,260 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-04-29 11:11:38,260 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:38,260 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:38,260 INFO L85 PathProgramCache]: Analyzing trace with hash -567483763, now seen corresponding path program 1 times [2025-04-29 11:11:38,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:38,260 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814889135] [2025-04-29 11:11:38,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:38,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:38,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:38,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:38,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:38,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:38,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:38,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:38,280 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814889135] [2025-04-29 11:11:38,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814889135] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:38,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:38,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:38,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823476114] [2025-04-29 11:11:38,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:38,281 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:38,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:38,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:38,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:38,293 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2025-04-29 11:11:38,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 118 transitions, 333 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:38,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2025-04-29 11:11:38,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:38,577 INFO L116 PetriNetUnfolderBase]: 928/4467 cut-off events. [2025-04-29 11:11:38,578 INFO L117 PetriNetUnfolderBase]: For 1626/2063 co-relation queries the response was YES. [2025-04-29 11:11:38,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7234 conditions, 4467 events. 928/4467 cut-off events. For 1626/2063 co-relation queries the response was YES. Maximal size of possible extension queue 169. Compared 45603 event pairs, 497 based on Foata normal form. 19/4021 useless extension candidates. Maximal degree in co-relation 6937. Up to 1188 conditions per place. [2025-04-29 11:11:38,598 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 28 selfloop transitions, 9 changer transitions 0/132 dead transitions. [2025-04-29 11:11:38,599 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 132 transitions, 458 flow [2025-04-29 11:11:38,599 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:38,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:38,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2025-04-29 11:11:38,600 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9174311926605505 [2025-04-29 11:11:38,600 INFO L175 Difference]: Start difference. First operand has 127 places, 118 transitions, 333 flow. Second operand 3 states and 300 transitions. [2025-04-29 11:11:38,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 132 transitions, 458 flow [2025-04-29 11:11:38,602 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 126 places, 132 transitions, 448 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:38,603 INFO L231 Difference]: Finished difference. Result has 128 places, 125 transitions, 399 flow [2025-04-29 11:11:38,603 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=128, PETRI_TRANSITIONS=125} [2025-04-29 11:11:38,603 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 15 predicate places. [2025-04-29 11:11:38,604 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 125 transitions, 399 flow [2025-04-29 11:11:38,604 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,604 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:38,604 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-04-29 11:11:38,604 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-04-29 11:11:38,604 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:38,604 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:38,605 INFO L85 PathProgramCache]: Analyzing trace with hash -2070756846, now seen corresponding path program 1 times [2025-04-29 11:11:38,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:38,605 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763920828] [2025-04-29 11:11:38,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:38,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:38,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:38,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:38,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:38,615 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:38,696 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:38,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:38,697 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763920828] [2025-04-29 11:11:38,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763920828] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:38,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:38,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:38,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471750424] [2025-04-29 11:11:38,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:38,698 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:38,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:38,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:38,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:38,752 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 109 [2025-04-29 11:11:38,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 125 transitions, 399 flow. Second operand has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:38,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:38,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 109 [2025-04-29 11:11:38,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:39,232 INFO L116 PetriNetUnfolderBase]: 1255/6357 cut-off events. [2025-04-29 11:11:39,232 INFO L117 PetriNetUnfolderBase]: For 1548/2494 co-relation queries the response was YES. [2025-04-29 11:11:39,250 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10066 conditions, 6357 events. 1255/6357 cut-off events. For 1548/2494 co-relation queries the response was YES. Maximal size of possible extension queue 234. Compared 67417 event pairs, 161 based on Foata normal form. 16/5616 useless extension candidates. Maximal degree in co-relation 5450. Up to 961 conditions per place. [2025-04-29 11:11:39,266 INFO L140 encePairwiseOnDemand]: 102/109 looper letters, 47 selfloop transitions, 10 changer transitions 0/157 dead transitions. [2025-04-29 11:11:39,266 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 157 transitions, 581 flow [2025-04-29 11:11:39,269 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:39,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:39,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 938 transitions. [2025-04-29 11:11:39,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8605504587155963 [2025-04-29 11:11:39,271 INFO L175 Difference]: Start difference. First operand has 128 places, 125 transitions, 399 flow. Second operand 10 states and 938 transitions. [2025-04-29 11:11:39,271 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 157 transitions, 581 flow [2025-04-29 11:11:39,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 157 transitions, 563 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:39,277 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 421 flow [2025-04-29 11:11:39,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=126, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=125, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=421, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2025-04-29 11:11:39,277 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 25 predicate places. [2025-04-29 11:11:39,277 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 421 flow [2025-04-29 11:11:39,278 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 89.625) internal successors, (717), 8 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:39,278 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:39,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-04-29 11:11:39,278 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:39,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:39,279 INFO L85 PathProgramCache]: Analyzing trace with hash 904246177, now seen corresponding path program 1 times [2025-04-29 11:11:39,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:39,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872363994] [2025-04-29 11:11:39,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:39,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:39,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:39,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:39,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:39,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:39,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:39,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:39,321 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872363994] [2025-04-29 11:11:39,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872363994] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:39,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:39,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:39,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863900469] [2025-04-29 11:11:39,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:39,322 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:39,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:39,322 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:39,322 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:39,324 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 109 [2025-04-29 11:11:39,324 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 421 flow. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,324 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:39,324 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 109 [2025-04-29 11:11:39,324 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:39,428 INFO L116 PetriNetUnfolderBase]: 98/1371 cut-off events. [2025-04-29 11:11:39,428 INFO L117 PetriNetUnfolderBase]: For 316/360 co-relation queries the response was YES. [2025-04-29 11:11:39,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2022 conditions, 1371 events. 98/1371 cut-off events. For 316/360 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 10209 event pairs, 26 based on Foata normal form. 20/1275 useless extension candidates. Maximal degree in co-relation 919. Up to 101 conditions per place. [2025-04-29 11:11:39,432 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 12 selfloop transitions, 6 changer transitions 0/126 dead transitions. [2025-04-29 11:11:39,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 126 transitions, 452 flow [2025-04-29 11:11:39,433 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:39,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:39,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2025-04-29 11:11:39,433 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.944954128440367 [2025-04-29 11:11:39,433 INFO L175 Difference]: Start difference. First operand has 138 places, 127 transitions, 421 flow. Second operand 3 states and 309 transitions. [2025-04-29 11:11:39,434 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 126 transitions, 452 flow [2025-04-29 11:11:39,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 126 transitions, 426 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:39,436 INFO L231 Difference]: Finished difference. Result has 134 places, 121 transitions, 371 flow [2025-04-29 11:11:39,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=371, PETRI_PLACES=134, PETRI_TRANSITIONS=121} [2025-04-29 11:11:39,437 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 21 predicate places. [2025-04-29 11:11:39,437 INFO L485 AbstractCegarLoop]: Abstraction has has 134 places, 121 transitions, 371 flow [2025-04-29 11:11:39,437 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,437 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:39,437 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:11:39,437 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:11:39,437 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:39,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:39,438 INFO L85 PathProgramCache]: Analyzing trace with hash 128244782, now seen corresponding path program 1 times [2025-04-29 11:11:39,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:39,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460676094] [2025-04-29 11:11:39,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:39,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:39,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:11:39,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:11:39,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:39,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:39,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:39,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:39,465 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460676094] [2025-04-29 11:11:39,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460676094] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:39,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:39,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:39,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119306108] [2025-04-29 11:11:39,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:39,466 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:39,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:39,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:39,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:39,482 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 109 [2025-04-29 11:11:39,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 121 transitions, 371 flow. Second operand has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:39,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 109 [2025-04-29 11:11:39,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:39,614 INFO L116 PetriNetUnfolderBase]: 177/1423 cut-off events. [2025-04-29 11:11:39,614 INFO L117 PetriNetUnfolderBase]: For 749/797 co-relation queries the response was YES. [2025-04-29 11:11:39,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2442 conditions, 1423 events. 177/1423 cut-off events. For 749/797 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 11075 event pairs, 135 based on Foata normal form. 3/1311 useless extension candidates. Maximal degree in co-relation 2146. Up to 336 conditions per place. [2025-04-29 11:11:39,620 INFO L140 encePairwiseOnDemand]: 104/109 looper letters, 23 selfloop transitions, 4 changer transitions 0/126 dead transitions. [2025-04-29 11:11:39,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 126 transitions, 445 flow [2025-04-29 11:11:39,621 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:39,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:39,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2025-04-29 11:11:39,621 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8960244648318043 [2025-04-29 11:11:39,621 INFO L175 Difference]: Start difference. First operand has 134 places, 121 transitions, 371 flow. Second operand 3 states and 293 transitions. [2025-04-29 11:11:39,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 126 transitions, 445 flow [2025-04-29 11:11:39,623 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 126 transitions, 439 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:39,624 INFO L231 Difference]: Finished difference. Result has 137 places, 124 transitions, 399 flow [2025-04-29 11:11:39,624 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=399, PETRI_PLACES=137, PETRI_TRANSITIONS=124} [2025-04-29 11:11:39,625 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, 24 predicate places. [2025-04-29 11:11:39,625 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 124 transitions, 399 flow [2025-04-29 11:11:39,625 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.33333333333333) internal successors, (274), 3 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,625 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:39,625 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:39,625 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:11:39,625 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:39,626 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:39,626 INFO L85 PathProgramCache]: Analyzing trace with hash -38422719, now seen corresponding path program 1 times [2025-04-29 11:11:39,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:39,626 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532195046] [2025-04-29 11:11:39,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:39,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:39,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:11:39,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:11:39,641 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:39,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:39,777 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:39,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:39,778 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532195046] [2025-04-29 11:11:39,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532195046] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:39,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:39,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:39,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771546588] [2025-04-29 11:11:39,779 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:39,779 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:11:39,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:39,780 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:11:39,780 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:11:39,868 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 109 [2025-04-29 11:11:39,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 124 transitions, 399 flow. Second operand has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:39,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:39,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 109 [2025-04-29 11:11:39,871 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:40,043 INFO L116 PetriNetUnfolderBase]: 151/827 cut-off events. [2025-04-29 11:11:40,043 INFO L117 PetriNetUnfolderBase]: For 395/395 co-relation queries the response was YES. [2025-04-29 11:11:40,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1510 conditions, 827 events. 151/827 cut-off events. For 395/395 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 4898 event pairs, 4 based on Foata normal form. 20/828 useless extension candidates. Maximal degree in co-relation 1492. Up to 88 conditions per place. [2025-04-29 11:11:40,047 INFO L140 encePairwiseOnDemand]: 103/109 looper letters, 50 selfloop transitions, 11 changer transitions 0/121 dead transitions. [2025-04-29 11:11:40,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 121 transitions, 490 flow [2025-04-29 11:11:40,047 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:11:40,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:11:40,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1193 transitions. [2025-04-29 11:11:40,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8419195483415667 [2025-04-29 11:11:40,049 INFO L175 Difference]: Start difference. First operand has 137 places, 124 transitions, 399 flow. Second operand 13 states and 1193 transitions. [2025-04-29 11:11:40,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 121 transitions, 490 flow [2025-04-29 11:11:40,051 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 121 transitions, 452 flow, removed 8 selfloop flow, removed 11 redundant places. [2025-04-29 11:11:40,052 INFO L231 Difference]: Finished difference. Result has 108 places, 82 transitions, 238 flow [2025-04-29 11:11:40,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=109, PETRI_DIFFERENCE_MINUEND_FLOW=216, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=238, PETRI_PLACES=108, PETRI_TRANSITIONS=82} [2025-04-29 11:11:40,052 INFO L279 CegarLoopForPetriNet]: 113 programPoint places, -5 predicate places. [2025-04-29 11:11:40,052 INFO L485 AbstractCegarLoop]: Abstraction has has 108 places, 82 transitions, 238 flow [2025-04-29 11:11:40,053 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 89.0) internal successors, (890), 10 states have internal predecessors, (890), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:40,053 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:40,053 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-04-29 11:11:40,053 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 5 more)] === [2025-04-29 11:11:40,053 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:40,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1846042990, now seen corresponding path program 1 times [2025-04-29 11:11:40,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:40,053 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306640484] [2025-04-29 11:11:40,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:40,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:40,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:40,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:40,071 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:40,071 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:40,071 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-29 11:11:40,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-04-29 11:11:40,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-04-29 11:11:40,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:40,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-29 11:11:40,093 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-29 11:11:40,094 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (6 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (5 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (4 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 8 remaining) [2025-04-29 11:11:40,094 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 8 remaining) [2025-04-29 11:11:40,095 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-04-29 11:11:40,095 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:40,096 WARN L247 ceAbstractionStarter]: 3 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-29 11:11:40,097 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 4 thread instances. [2025-04-29 11:11:40,109 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-29 11:11:40,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 132 places, 127 transitions, 294 flow [2025-04-29 11:11:40,138 INFO L116 PetriNetUnfolderBase]: 21/570 cut-off events. [2025-04-29 11:11:40,138 INFO L117 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2025-04-29 11:11:40,139 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621 conditions, 570 events. 21/570 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 2165 event pairs, 6 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 349. Up to 32 conditions per place. [2025-04-29 11:11:40,139 INFO L82 GeneralOperation]: Start removeDead. Operand has 132 places, 127 transitions, 294 flow [2025-04-29 11:11:40,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 132 places, 127 transitions, 294 flow [2025-04-29 11:11:40,141 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:11:40,141 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@79620bc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:11:40,141 INFO L341 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2025-04-29 11:11:40,142 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-29 11:11:40,142 INFO L116 PetriNetUnfolderBase]: 0/26 cut-off events. [2025-04-29 11:11:40,142 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-29 11:11:40,142 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:40,142 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:40,142 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:40,143 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:40,143 INFO L85 PathProgramCache]: Analyzing trace with hash 1088751182, now seen corresponding path program 1 times [2025-04-29 11:11:40,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:40,143 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064263218] [2025-04-29 11:11:40,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:40,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:40,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-04-29 11:11:40,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-04-29 11:11:40,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:40,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:40,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:40,160 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064263218] [2025-04-29 11:11:40,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064263218] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:40,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:40,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:40,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679380590] [2025-04-29 11:11:40,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:40,161 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:40,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:40,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:40,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:40,184 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2025-04-29 11:11:40,184 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,184 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:40,184 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2025-04-29 11:11:40,184 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:40,658 INFO L116 PetriNetUnfolderBase]: 2017/8323 cut-off events. [2025-04-29 11:11:40,658 INFO L117 PetriNetUnfolderBase]: For 1213/1213 co-relation queries the response was YES. [2025-04-29 11:11:40,678 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11724 conditions, 8323 events. 2017/8323 cut-off events. For 1213/1213 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 85467 event pairs, 1191 based on Foata normal form. 1/7612 useless extension candidates. Maximal degree in co-relation 5299. Up to 2119 conditions per place. [2025-04-29 11:11:40,698 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 30 selfloop transitions, 4 changer transitions 0/138 dead transitions. [2025-04-29 11:11:40,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 138 transitions, 384 flow [2025-04-29 11:11:40,701 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:40,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:40,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 451 transitions. [2025-04-29 11:11:40,702 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8877952755905512 [2025-04-29 11:11:40,702 INFO L175 Difference]: Start difference. First operand has 132 places, 127 transitions, 294 flow. Second operand 4 states and 451 transitions. [2025-04-29 11:11:40,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 138 transitions, 384 flow [2025-04-29 11:11:40,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 138 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-29 11:11:40,704 INFO L231 Difference]: Finished difference. Result has 136 places, 128 transitions, 310 flow [2025-04-29 11:11:40,704 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=294, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=123, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=310, PETRI_PLACES=136, PETRI_TRANSITIONS=128} [2025-04-29 11:11:40,705 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 4 predicate places. [2025-04-29 11:11:40,705 INFO L485 AbstractCegarLoop]: Abstraction has has 136 places, 128 transitions, 310 flow [2025-04-29 11:11:40,705 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.25) internal successors, (421), 4 states have internal predecessors, (421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,705 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:40,705 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] [2025-04-29 11:11:40,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:11:40,705 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:40,706 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:40,706 INFO L85 PathProgramCache]: Analyzing trace with hash -752599974, now seen corresponding path program 1 times [2025-04-29 11:11:40,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:40,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648001872] [2025-04-29 11:11:40,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:40,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:40,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-29 11:11:40,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-29 11:11:40,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:40,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:40,796 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:40,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:40,797 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648001872] [2025-04-29 11:11:40,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648001872] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:40,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:40,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:40,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169163707] [2025-04-29 11:11:40,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:40,797 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:40,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:40,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:40,883 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 127 [2025-04-29 11:11:40,884 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 128 transitions, 310 flow. Second operand has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:40,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:40,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 127 [2025-04-29 11:11:40,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:41,942 INFO L116 PetriNetUnfolderBase]: 6236/15873 cut-off events. [2025-04-29 11:11:41,942 INFO L117 PetriNetUnfolderBase]: For 1708/1708 co-relation queries the response was YES. [2025-04-29 11:11:41,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25937 conditions, 15873 events. 6236/15873 cut-off events. For 1708/1708 co-relation queries the response was YES. Maximal size of possible extension queue 633. Compared 160422 event pairs, 2634 based on Foata normal form. 0/14913 useless extension candidates. Maximal degree in co-relation 23591. Up to 6781 conditions per place. [2025-04-29 11:11:42,026 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 62 selfloop transitions, 5 changer transitions 0/159 dead transitions. [2025-04-29 11:11:42,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 159 transitions, 506 flow [2025-04-29 11:11:42,027 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:42,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:42,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 619 transitions. [2025-04-29 11:11:42,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8123359580052494 [2025-04-29 11:11:42,028 INFO L175 Difference]: Start difference. First operand has 136 places, 128 transitions, 310 flow. Second operand 6 states and 619 transitions. [2025-04-29 11:11:42,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 159 transitions, 506 flow [2025-04-29 11:11:42,040 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 159 transitions, 500 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:42,041 INFO L231 Difference]: Finished difference. Result has 138 places, 127 transitions, 312 flow [2025-04-29 11:11:42,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=312, PETRI_PLACES=138, PETRI_TRANSITIONS=127} [2025-04-29 11:11:42,041 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 6 predicate places. [2025-04-29 11:11:42,041 INFO L485 AbstractCegarLoop]: Abstraction has has 138 places, 127 transitions, 312 flow [2025-04-29 11:11:42,042 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 93.5) internal successors, (561), 6 states have internal predecessors, (561), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:42,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:42,042 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] [2025-04-29 11:11:42,042 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-04-29 11:11:42,042 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:42,042 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:42,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1981727150, now seen corresponding path program 1 times [2025-04-29 11:11:42,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:42,043 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385549891] [2025-04-29 11:11:42,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:42,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:42,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-04-29 11:11:42,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-04-29 11:11:42,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:42,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:42,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:42,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:42,057 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385549891] [2025-04-29 11:11:42,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385549891] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:42,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:42,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:42,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755116135] [2025-04-29 11:11:42,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:42,058 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:42,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:42,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:42,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:42,075 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:42,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 127 transitions, 312 flow. Second operand has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:42,075 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:42,075 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:42,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:43,904 INFO L116 PetriNetUnfolderBase]: 7160/22731 cut-off events. [2025-04-29 11:11:43,904 INFO L117 PetriNetUnfolderBase]: For 5157/5671 co-relation queries the response was YES. [2025-04-29 11:11:43,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34720 conditions, 22731 events. 7160/22731 cut-off events. For 5157/5671 co-relation queries the response was YES. Maximal size of possible extension queue 864. Compared 273108 event pairs, 5035 based on Foata normal form. 10/20272 useless extension candidates. Maximal degree in co-relation 27801. Up to 8447 conditions per place. [2025-04-29 11:11:44,006 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 36 selfloop transitions, 7 changer transitions 0/145 dead transitions. [2025-04-29 11:11:44,006 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 145 transitions, 464 flow [2025-04-29 11:11:44,007 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 350 transitions. [2025-04-29 11:11:44,007 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9186351706036745 [2025-04-29 11:11:44,007 INFO L175 Difference]: Start difference. First operand has 138 places, 127 transitions, 312 flow. Second operand 3 states and 350 transitions. [2025-04-29 11:11:44,007 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 145 transitions, 464 flow [2025-04-29 11:11:44,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 145 transitions, 454 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-29 11:11:44,011 INFO L231 Difference]: Finished difference. Result has 137 places, 133 transitions, 356 flow [2025-04-29 11:11:44,011 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=302, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=137, PETRI_TRANSITIONS=133} [2025-04-29 11:11:44,012 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 5 predicate places. [2025-04-29 11:11:44,012 INFO L485 AbstractCegarLoop]: Abstraction has has 137 places, 133 transitions, 356 flow [2025-04-29 11:11:44,012 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.66666666666667) internal successors, (311), 3 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:44,012 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:44,012 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-04-29 11:11:44,012 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-04-29 11:11:44,012 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:44,012 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:44,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2018401394, now seen corresponding path program 1 times [2025-04-29 11:11:44,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:44,013 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531733146] [2025-04-29 11:11:44,013 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:44,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-04-29 11:11:44,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-04-29 11:11:44,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:44,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:11:44,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:44,044 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531733146] [2025-04-29 11:11:44,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531733146] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:44,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:44,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:11:44,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325829688] [2025-04-29 11:11:44,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:44,044 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:11:44,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:44,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:11:44,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:11:44,072 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2025-04-29 11:11:44,073 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 133 transitions, 356 flow. Second operand has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:44,073 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:44,073 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2025-04-29 11:11:44,073 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:45,567 INFO L116 PetriNetUnfolderBase]: 4974/18921 cut-off events. [2025-04-29 11:11:45,567 INFO L117 PetriNetUnfolderBase]: For 2748/2812 co-relation queries the response was YES. [2025-04-29 11:11:45,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28908 conditions, 18921 events. 4974/18921 cut-off events. For 2748/2812 co-relation queries the response was YES. Maximal size of possible extension queue 714. Compared 232866 event pairs, 2071 based on Foata normal form. 259/17043 useless extension candidates. Maximal degree in co-relation 23327. Up to 3630 conditions per place. [2025-04-29 11:11:45,676 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 40 selfloop transitions, 4 changer transitions 0/154 dead transitions. [2025-04-29 11:11:45,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 154 transitions, 498 flow [2025-04-29 11:11:45,680 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:11:45,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-29 11:11:45,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2025-04-29 11:11:45,680 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.90748031496063 [2025-04-29 11:11:45,680 INFO L175 Difference]: Start difference. First operand has 137 places, 133 transitions, 356 flow. Second operand 4 states and 461 transitions. [2025-04-29 11:11:45,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 154 transitions, 498 flow [2025-04-29 11:11:45,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 138 places, 154 transitions, 484 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:45,692 INFO L231 Difference]: Finished difference. Result has 139 places, 134 transitions, 358 flow [2025-04-29 11:11:45,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=358, PETRI_PLACES=139, PETRI_TRANSITIONS=134} [2025-04-29 11:11:45,692 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 7 predicate places. [2025-04-29 11:11:45,692 INFO L485 AbstractCegarLoop]: Abstraction has has 139 places, 134 transitions, 358 flow [2025-04-29 11:11:45,692 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 105.5) internal successors, (422), 4 states have internal predecessors, (422), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:45,692 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:45,692 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] [2025-04-29 11:11:45,693 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-04-29 11:11:45,693 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:45,693 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:45,693 INFO L85 PathProgramCache]: Analyzing trace with hash -205064016, now seen corresponding path program 1 times [2025-04-29 11:11:45,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:45,693 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114877760] [2025-04-29 11:11:45,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:45,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:45,699 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-04-29 11:11:45,701 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-04-29 11:11:45,702 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:45,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:45,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:11:45,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:45,753 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114877760] [2025-04-29 11:11:45,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114877760] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:45,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:45,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:11:45,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363162282] [2025-04-29 11:11:45,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:45,754 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:45,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:45,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:45,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:45,804 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:45,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 134 transitions, 358 flow. Second operand has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:45,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:45,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:45,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:47,845 INFO L116 PetriNetUnfolderBase]: 6308/24151 cut-off events. [2025-04-29 11:11:47,845 INFO L117 PetriNetUnfolderBase]: For 3184/3184 co-relation queries the response was YES. [2025-04-29 11:11:47,903 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36535 conditions, 24151 events. 6308/24151 cut-off events. For 3184/3184 co-relation queries the response was YES. Maximal size of possible extension queue 884. Compared 310070 event pairs, 2802 based on Foata normal form. 3/20923 useless extension candidates. Maximal degree in co-relation 20565. Up to 5820 conditions per place. [2025-04-29 11:11:47,957 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 41 selfloop transitions, 7 changer transitions 0/156 dead transitions. [2025-04-29 11:11:47,957 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 145 places, 156 transitions, 500 flow [2025-04-29 11:11:47,957 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:11:47,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:11:47,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 763 transitions. [2025-04-29 11:11:47,958 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8582677165354331 [2025-04-29 11:11:47,958 INFO L175 Difference]: Start difference. First operand has 139 places, 134 transitions, 358 flow. Second operand 7 states and 763 transitions. [2025-04-29 11:11:47,958 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 145 places, 156 transitions, 500 flow [2025-04-29 11:11:47,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 156 transitions, 494 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:47,965 INFO L231 Difference]: Finished difference. Result has 146 places, 137 transitions, 388 flow [2025-04-29 11:11:47,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=127, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=388, PETRI_PLACES=146, PETRI_TRANSITIONS=137} [2025-04-29 11:11:47,966 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 14 predicate places. [2025-04-29 11:11:47,966 INFO L485 AbstractCegarLoop]: Abstraction has has 146 places, 137 transitions, 388 flow [2025-04-29 11:11:47,966 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.5) internal successors, (621), 6 states have internal predecessors, (621), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:47,966 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:47,966 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] [2025-04-29 11:11:47,966 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-04-29 11:11:47,966 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:47,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash 942216605, now seen corresponding path program 1 times [2025-04-29 11:11:47,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:47,967 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413603180] [2025-04-29 11:11:47,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:47,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:47,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-04-29 11:11:47,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-04-29 11:11:47,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:47,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:47,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:47,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:47,985 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413603180] [2025-04-29 11:11:47,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413603180] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:47,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:47,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:47,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193228319] [2025-04-29 11:11:47,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:47,986 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:47,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:47,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:47,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:47,999 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:47,999 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 137 transitions, 388 flow. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:47,999 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:47,999 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:48,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:50,815 INFO L116 PetriNetUnfolderBase]: 8620/31168 cut-off events. [2025-04-29 11:11:50,815 INFO L117 PetriNetUnfolderBase]: For 11761/13941 co-relation queries the response was YES. [2025-04-29 11:11:50,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52384 conditions, 31168 events. 8620/31168 cut-off events. For 11761/13941 co-relation queries the response was YES. Maximal size of possible extension queue 1070. Compared 411018 event pairs, 4986 based on Foata normal form. 43/27821 useless extension candidates. Maximal degree in co-relation 51105. Up to 9839 conditions per place. [2025-04-29 11:11:50,968 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 38 selfloop transitions, 11 changer transitions 0/157 dead transitions. [2025-04-29 11:11:50,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 148 places, 157 transitions, 565 flow [2025-04-29 11:11:50,968 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:50,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:50,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2025-04-29 11:11:50,968 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.916010498687664 [2025-04-29 11:11:50,968 INFO L175 Difference]: Start difference. First operand has 146 places, 137 transitions, 388 flow. Second operand 3 states and 349 transitions. [2025-04-29 11:11:50,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 148 places, 157 transitions, 565 flow [2025-04-29 11:11:50,989 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 157 transitions, 555 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:11:50,990 INFO L231 Difference]: Finished difference. Result has 147 places, 146 transitions, 474 flow [2025-04-29 11:11:50,990 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=378, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=474, PETRI_PLACES=147, PETRI_TRANSITIONS=146} [2025-04-29 11:11:50,990 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 15 predicate places. [2025-04-29 11:11:50,990 INFO L485 AbstractCegarLoop]: Abstraction has has 147 places, 146 transitions, 474 flow [2025-04-29 11:11:50,991 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:50,991 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:50,991 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 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] [2025-04-29 11:11:50,991 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-04-29 11:11:50,991 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:50,991 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:50,991 INFO L85 PathProgramCache]: Analyzing trace with hash 571102193, now seen corresponding path program 1 times [2025-04-29 11:11:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:50,991 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156657815] [2025-04-29 11:11:50,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:50,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:50,998 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-04-29 11:11:51,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-04-29 11:11:51,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:51,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:51,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:51,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:51,071 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156657815] [2025-04-29 11:11:51,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156657815] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:51,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:51,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:11:51,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235040334] [2025-04-29 11:11:51,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:51,071 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:11:51,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:51,072 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:11:51,072 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:11:51,125 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:51,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 146 transitions, 474 flow. Second operand has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:51,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:51,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:51,126 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:54,553 INFO L116 PetriNetUnfolderBase]: 9234/37141 cut-off events. [2025-04-29 11:11:54,553 INFO L117 PetriNetUnfolderBase]: For 10542/21446 co-relation queries the response was YES. [2025-04-29 11:11:54,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60607 conditions, 37141 events. 9234/37141 cut-off events. For 10542/21446 co-relation queries the response was YES. Maximal size of possible extension queue 1142. Compared 514930 event pairs, 2450 based on Foata normal form. 33/32109 useless extension candidates. Maximal degree in co-relation 28385. Up to 8114 conditions per place. [2025-04-29 11:11:54,788 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 55 selfloop transitions, 10 changer transitions 0/182 dead transitions. [2025-04-29 11:11:54,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 182 transitions, 686 flow [2025-04-29 11:11:54,789 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:11:54,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:11:54,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1086 transitions. [2025-04-29 11:11:54,790 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8551181102362204 [2025-04-29 11:11:54,790 INFO L175 Difference]: Start difference. First operand has 147 places, 146 transitions, 474 flow. Second operand 10 states and 1086 transitions. [2025-04-29 11:11:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 182 transitions, 686 flow [2025-04-29 11:11:54,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 182 transitions, 664 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:54,825 INFO L231 Difference]: Finished difference. Result has 157 places, 149 transitions, 500 flow [2025-04-29 11:11:54,825 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=452, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=500, PETRI_PLACES=157, PETRI_TRANSITIONS=149} [2025-04-29 11:11:54,826 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 25 predicate places. [2025-04-29 11:11:54,826 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 149 transitions, 500 flow [2025-04-29 11:11:54,826 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 103.625) internal successors, (829), 8 states have internal predecessors, (829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:54,826 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:54,826 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:54,826 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-04-29 11:11:54,827 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:54,827 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:54,827 INFO L85 PathProgramCache]: Analyzing trace with hash -1394983407, now seen corresponding path program 1 times [2025-04-29 11:11:54,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:54,827 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308445628] [2025-04-29 11:11:54,827 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:54,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:54,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-04-29 11:11:54,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-04-29 11:11:54,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:54,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:54,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-29 11:11:54,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:54,869 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308445628] [2025-04-29 11:11:54,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308445628] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:54,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:54,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:11:54,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337212629] [2025-04-29 11:11:54,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:54,870 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:54,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:54,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:54,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:54,873 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 127 [2025-04-29 11:11:54,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 149 transitions, 500 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:54,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:54,874 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 127 [2025-04-29 11:11:54,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,323 INFO L116 PetriNetUnfolderBase]: 472/4808 cut-off events. [2025-04-29 11:11:55,324 INFO L117 PetriNetUnfolderBase]: For 1408/1554 co-relation queries the response was YES. [2025-04-29 11:11:55,338 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7267 conditions, 4808 events. 472/4808 cut-off events. For 1408/1554 co-relation queries the response was YES. Maximal size of possible extension queue 179. Compared 52119 event pairs, 234 based on Foata normal form. 128/4526 useless extension candidates. Maximal degree in co-relation 6416. Up to 454 conditions per place. [2025-04-29 11:11:55,346 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 16 selfloop transitions, 8 changer transitions 0/147 dead transitions. [2025-04-29 11:11:55,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 147 transitions, 541 flow [2025-04-29 11:11:55,347 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:55,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:55,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 358 transitions. [2025-04-29 11:11:55,348 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.9396325459317585 [2025-04-29 11:11:55,348 INFO L175 Difference]: Start difference. First operand has 157 places, 149 transitions, 500 flow. Second operand 3 states and 358 transitions. [2025-04-29 11:11:55,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 147 transitions, 541 flow [2025-04-29 11:11:55,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 153 places, 147 transitions, 515 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-04-29 11:11:55,357 INFO L231 Difference]: Finished difference. Result has 153 places, 140 transitions, 436 flow [2025-04-29 11:11:55,357 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=151, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=436, PETRI_PLACES=153, PETRI_TRANSITIONS=140} [2025-04-29 11:11:55,357 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 21 predicate places. [2025-04-29 11:11:55,357 INFO L485 AbstractCegarLoop]: Abstraction has has 153 places, 140 transitions, 436 flow [2025-04-29 11:11:55,358 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,358 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:55,358 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-04-29 11:11:55,358 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-04-29 11:11:55,358 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:55,358 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:55,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1655280797, now seen corresponding path program 1 times [2025-04-29 11:11:55,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:55,358 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101289344] [2025-04-29 11:11:55,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:55,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:55,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-04-29 11:11:55,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-04-29 11:11:55,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:55,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:55,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:55,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:55,384 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101289344] [2025-04-29 11:11:55,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101289344] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:55,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:55,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:55,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816767394] [2025-04-29 11:11:55,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:55,385 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:55,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:55,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:55,400 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:55,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 140 transitions, 436 flow. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:55,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:55,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:55,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:55,983 INFO L116 PetriNetUnfolderBase]: 934/6023 cut-off events. [2025-04-29 11:11:55,984 INFO L117 PetriNetUnfolderBase]: For 3743/3845 co-relation queries the response was YES. [2025-04-29 11:11:56,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10590 conditions, 6023 events. 934/6023 cut-off events. For 3743/3845 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 68462 event pairs, 666 based on Foata normal form. 4/5493 useless extension candidates. Maximal degree in co-relation 3854. Up to 1548 conditions per place. [2025-04-29 11:11:56,015 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 30 selfloop transitions, 4 changer transitions 0/147 dead transitions. [2025-04-29 11:11:56,015 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 147 transitions, 540 flow [2025-04-29 11:11:56,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:56,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:56,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 339 transitions. [2025-04-29 11:11:56,016 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.889763779527559 [2025-04-29 11:11:56,016 INFO L175 Difference]: Start difference. First operand has 153 places, 140 transitions, 436 flow. Second operand 3 states and 339 transitions. [2025-04-29 11:11:56,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 147 transitions, 540 flow [2025-04-29 11:11:56,019 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 147 transitions, 532 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-29 11:11:56,020 INFO L231 Difference]: Finished difference. Result has 156 places, 143 transitions, 462 flow [2025-04-29 11:11:56,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=428, PETRI_DIFFERENCE_MINUEND_PLACES=152, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=140, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=462, PETRI_PLACES=156, PETRI_TRANSITIONS=143} [2025-04-29 11:11:56,021 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 24 predicate places. [2025-04-29 11:11:56,021 INFO L485 AbstractCegarLoop]: Abstraction has has 156 places, 143 transitions, 462 flow [2025-04-29 11:11:56,021 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:56,021 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:56,021 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-04-29 11:11:56,021 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:56,022 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:56,022 INFO L85 PathProgramCache]: Analyzing trace with hash -147021615, now seen corresponding path program 1 times [2025-04-29 11:11:56,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:56,022 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002589121] [2025-04-29 11:11:56,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:56,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:56,037 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:11:56,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:11:56,042 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:56,042 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:56,224 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:11:56,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:56,224 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002589121] [2025-04-29 11:11:56,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002589121] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:56,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:56,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:11:56,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186375293] [2025-04-29 11:11:56,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:56,225 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:11:56,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:56,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:11:56,226 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:11:56,313 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2025-04-29 11:11:56,314 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 156 places, 143 transitions, 462 flow. Second operand has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:56,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:56,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2025-04-29 11:11:56,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:57,008 INFO L116 PetriNetUnfolderBase]: 1216/8399 cut-off events. [2025-04-29 11:11:57,009 INFO L117 PetriNetUnfolderBase]: For 3335/3563 co-relation queries the response was YES. [2025-04-29 11:11:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13812 conditions, 8399 events. 1216/8399 cut-off events. For 3335/3563 co-relation queries the response was YES. Maximal size of possible extension queue 233. Compared 91244 event pairs, 211 based on Foata normal form. 20/7662 useless extension candidates. Maximal degree in co-relation 5596. Up to 893 conditions per place. [2025-04-29 11:11:57,047 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 76 selfloop transitions, 14 changer transitions 1/201 dead transitions. [2025-04-29 11:11:57,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 201 transitions, 820 flow [2025-04-29 11:11:57,048 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:11:57,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:11:57,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1405 transitions. [2025-04-29 11:11:57,049 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.850999394306481 [2025-04-29 11:11:57,049 INFO L175 Difference]: Start difference. First operand has 156 places, 143 transitions, 462 flow. Second operand 13 states and 1405 transitions. [2025-04-29 11:11:57,049 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 201 transitions, 820 flow [2025-04-29 11:11:57,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 201 transitions, 808 flow, removed 2 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:57,055 INFO L231 Difference]: Finished difference. Result has 170 places, 146 transitions, 512 flow [2025-04-29 11:11:57,055 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=143, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=512, PETRI_PLACES=170, PETRI_TRANSITIONS=146} [2025-04-29 11:11:57,055 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 38 predicate places. [2025-04-29 11:11:57,055 INFO L485 AbstractCegarLoop]: Abstraction has has 170 places, 146 transitions, 512 flow [2025-04-29 11:11:57,056 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 103.0) internal successors, (1030), 10 states have internal predecessors, (1030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:57,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:57,056 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:57,056 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-04-29 11:11:57,056 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:57,057 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:57,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1985043764, now seen corresponding path program 1 times [2025-04-29 11:11:57,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:57,057 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230401638] [2025-04-29 11:11:57,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:57,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:57,069 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-04-29 11:11:57,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-04-29 11:11:57,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:57,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:57,084 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:11:57,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:57,084 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230401638] [2025-04-29 11:11:57,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230401638] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:57,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:57,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:11:57,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858901956] [2025-04-29 11:11:57,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:57,085 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:11:57,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:57,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:11:57,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:11:57,101 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:11:57,101 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 146 transitions, 512 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:57,101 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:57,101 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:11:57,101 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:57,580 INFO L116 PetriNetUnfolderBase]: 883/5706 cut-off events. [2025-04-29 11:11:57,580 INFO L117 PetriNetUnfolderBase]: For 4141/4237 co-relation queries the response was YES. [2025-04-29 11:11:57,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10584 conditions, 5706 events. 883/5706 cut-off events. For 4141/4237 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 62353 event pairs, 677 based on Foata normal form. 4/5201 useless extension candidates. Maximal degree in co-relation 9769. Up to 1476 conditions per place. [2025-04-29 11:11:57,610 INFO L140 encePairwiseOnDemand]: 122/127 looper letters, 30 selfloop transitions, 4 changer transitions 0/152 dead transitions. [2025-04-29 11:11:57,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 152 transitions, 607 flow [2025-04-29 11:11:57,610 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:11:57,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:11:57,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 338 transitions. [2025-04-29 11:11:57,611 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8871391076115486 [2025-04-29 11:11:57,611 INFO L175 Difference]: Start difference. First operand has 170 places, 146 transitions, 512 flow. Second operand 3 states and 338 transitions. [2025-04-29 11:11:57,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 152 transitions, 607 flow [2025-04-29 11:11:57,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 152 transitions, 577 flow, removed 7 selfloop flow, removed 8 redundant places. [2025-04-29 11:11:57,621 INFO L231 Difference]: Finished difference. Result has 166 places, 149 transitions, 518 flow [2025-04-29 11:11:57,621 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=518, PETRI_PLACES=166, PETRI_TRANSITIONS=149} [2025-04-29 11:11:57,621 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 34 predicate places. [2025-04-29 11:11:57,621 INFO L485 AbstractCegarLoop]: Abstraction has has 166 places, 149 transitions, 518 flow [2025-04-29 11:11:57,621 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:57,621 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:57,622 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:57,622 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-04-29 11:11:57,622 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:57,622 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:57,622 INFO L85 PathProgramCache]: Analyzing trace with hash -1950642702, now seen corresponding path program 1 times [2025-04-29 11:11:57,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:57,622 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2078954864] [2025-04-29 11:11:57,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:57,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:57,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 89 statements into 1 equivalence classes. [2025-04-29 11:11:57,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 89 of 89 statements. [2025-04-29 11:11:57,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:57,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:11:57,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:57,898 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2078954864] [2025-04-29 11:11:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2078954864] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:57,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:57,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:11:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257560280] [2025-04-29 11:11:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:57,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:11:57,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:57,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:11:57,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:11:57,966 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 127 [2025-04-29 11:11:57,967 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 149 transitions, 518 flow. Second operand has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:57,967 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:57,967 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 127 [2025-04-29 11:11:57,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:11:59,304 INFO L116 PetriNetUnfolderBase]: 2726/11406 cut-off events. [2025-04-29 11:11:59,304 INFO L117 PetriNetUnfolderBase]: For 4376/4680 co-relation queries the response was YES. [2025-04-29 11:11:59,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21744 conditions, 11406 events. 2726/11406 cut-off events. For 4376/4680 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 124837 event pairs, 1342 based on Foata normal form. 0/10702 useless extension candidates. Maximal degree in co-relation 19455. Up to 2509 conditions per place. [2025-04-29 11:11:59,344 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 59 selfloop transitions, 6 changer transitions 0/180 dead transitions. [2025-04-29 11:11:59,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 180 transitions, 742 flow [2025-04-29 11:11:59,345 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:11:59,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-29 11:11:59,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 629 transitions. [2025-04-29 11:11:59,345 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8254593175853019 [2025-04-29 11:11:59,345 INFO L175 Difference]: Start difference. First operand has 166 places, 149 transitions, 518 flow. Second operand 6 states and 629 transitions. [2025-04-29 11:11:59,345 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 180 transitions, 742 flow [2025-04-29 11:11:59,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 168 places, 180 transitions, 728 flow, removed 3 selfloop flow, removed 2 redundant places. [2025-04-29 11:11:59,363 INFO L231 Difference]: Finished difference. Result has 168 places, 148 transitions, 514 flow [2025-04-29 11:11:59,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=148, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=142, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=514, PETRI_PLACES=168, PETRI_TRANSITIONS=148} [2025-04-29 11:11:59,363 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 36 predicate places. [2025-04-29 11:11:59,363 INFO L485 AbstractCegarLoop]: Abstraction has has 168 places, 148 transitions, 514 flow [2025-04-29 11:11:59,363 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 96.66666666666667) internal successors, (580), 6 states have internal predecessors, (580), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:59,363 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:11:59,364 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:11:59,364 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-04-29 11:11:59,364 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:11:59,364 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:11:59,364 INFO L85 PathProgramCache]: Analyzing trace with hash -1598201492, now seen corresponding path program 1 times [2025-04-29 11:11:59,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:11:59,364 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45631672] [2025-04-29 11:11:59,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:11:59,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:11:59,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-04-29 11:11:59,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-04-29 11:11:59,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:11:59,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:11:59,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:11:59,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:11:59,512 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45631672] [2025-04-29 11:11:59,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45631672] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:11:59,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:11:59,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-04-29 11:11:59,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320786763] [2025-04-29 11:11:59,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:11:59,513 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-29 11:11:59,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:11:59,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-29 11:11:59,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-04-29 11:11:59,628 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2025-04-29 11:11:59,629 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 148 transitions, 514 flow. Second operand has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:11:59,629 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:11:59,629 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2025-04-29 11:11:59,629 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:00,415 INFO L116 PetriNetUnfolderBase]: 1190/7829 cut-off events. [2025-04-29 11:12:00,415 INFO L117 PetriNetUnfolderBase]: For 4015/4243 co-relation queries the response was YES. [2025-04-29 11:12:00,441 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14611 conditions, 7829 events. 1190/7829 cut-off events. For 4015/4243 co-relation queries the response was YES. Maximal size of possible extension queue 248. Compared 84340 event pairs, 159 based on Foata normal form. 48/7309 useless extension candidates. Maximal degree in co-relation 5065. Up to 557 conditions per place. [2025-04-29 11:12:00,454 INFO L140 encePairwiseOnDemand]: 119/127 looper letters, 90 selfloop transitions, 16 changer transitions 8/225 dead transitions. [2025-04-29 11:12:00,454 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 225 transitions, 970 flow [2025-04-29 11:12:00,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-29 11:12:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-29 11:12:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1731 transitions. [2025-04-29 11:12:00,456 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8518700787401575 [2025-04-29 11:12:00,456 INFO L175 Difference]: Start difference. First operand has 168 places, 148 transitions, 514 flow. Second operand 16 states and 1731 transitions. [2025-04-29 11:12:00,456 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 225 transitions, 970 flow [2025-04-29 11:12:00,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 225 transitions, 950 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-04-29 11:12:00,465 INFO L231 Difference]: Finished difference. Result has 174 places, 146 transitions, 514 flow [2025-04-29 11:12:00,466 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=482, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=514, PETRI_PLACES=174, PETRI_TRANSITIONS=146} [2025-04-29 11:12:00,466 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 42 predicate places. [2025-04-29 11:12:00,466 INFO L485 AbstractCegarLoop]: Abstraction has has 174 places, 146 transitions, 514 flow [2025-04-29 11:12:00,466 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 103.0) internal successors, (1236), 12 states have internal predecessors, (1236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:00,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:00,466 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:00,466 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-04-29 11:12:00,467 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:00,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:00,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1291047871, now seen corresponding path program 1 times [2025-04-29 11:12:00,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:00,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487466171] [2025-04-29 11:12:00,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:00,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:00,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-04-29 11:12:00,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-04-29 11:12:00,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:00,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:00,492 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-29 11:12:00,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:00,492 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1487466171] [2025-04-29 11:12:00,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1487466171] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:00,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:00,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:12:00,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784243498] [2025-04-29 11:12:00,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:00,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:12:00,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:00,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:12:00,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:12:00,506 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 127 [2025-04-29 11:12:00,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 146 transitions, 514 flow. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:00,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:00,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 127 [2025-04-29 11:12:00,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:01,165 INFO L116 PetriNetUnfolderBase]: 1353/8930 cut-off events. [2025-04-29 11:12:01,165 INFO L117 PetriNetUnfolderBase]: For 5222/5306 co-relation queries the response was YES. [2025-04-29 11:12:01,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16796 conditions, 8930 events. 1353/8930 cut-off events. For 5222/5306 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 106443 event pairs, 605 based on Foata normal form. 0/8370 useless extension candidates. Maximal degree in co-relation 16013. Up to 1591 conditions per place. [2025-04-29 11:12:01,202 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 30 selfloop transitions, 9 changer transitions 1/159 dead transitions. [2025-04-29 11:12:01,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 159 transitions, 648 flow [2025-04-29 11:12:01,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:12:01,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-29 11:12:01,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 349 transitions. [2025-04-29 11:12:01,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.916010498687664 [2025-04-29 11:12:01,203 INFO L175 Difference]: Start difference. First operand has 174 places, 146 transitions, 514 flow. Second operand 3 states and 349 transitions. [2025-04-29 11:12:01,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 159 transitions, 648 flow [2025-04-29 11:12:01,232 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 159 transitions, 580 flow, removed 6 selfloop flow, removed 21 redundant places. [2025-04-29 11:12:01,233 INFO L231 Difference]: Finished difference. Result has 157 places, 150 transitions, 522 flow [2025-04-29 11:12:01,234 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=446, PETRI_DIFFERENCE_MINUEND_PLACES=153, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=522, PETRI_PLACES=157, PETRI_TRANSITIONS=150} [2025-04-29 11:12:01,234 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 25 predicate places. [2025-04-29 11:12:01,234 INFO L485 AbstractCegarLoop]: Abstraction has has 157 places, 150 transitions, 522 flow [2025-04-29 11:12:01,234 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:01,234 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:01,234 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:01,234 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2025-04-29 11:12:01,234 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:01,235 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:01,235 INFO L85 PathProgramCache]: Analyzing trace with hash -1732410144, now seen corresponding path program 1 times [2025-04-29 11:12:01,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:01,235 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510346993] [2025-04-29 11:12:01,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:01,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:01,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-04-29 11:12:01,247 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-04-29 11:12:01,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:01,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:01,303 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:12:01,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:01,304 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510346993] [2025-04-29 11:12:01,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510346993] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:01,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:01,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-29 11:12:01,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764538276] [2025-04-29 11:12:01,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:01,304 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:12:01,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:01,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:12:01,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:12:01,350 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:12:01,350 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 157 places, 150 transitions, 522 flow. Second operand has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:01,351 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:01,351 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:12:01,351 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:01,926 INFO L116 PetriNetUnfolderBase]: 1110/5974 cut-off events. [2025-04-29 11:12:01,926 INFO L117 PetriNetUnfolderBase]: For 3442/3608 co-relation queries the response was YES. [2025-04-29 11:12:01,943 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11178 conditions, 5974 events. 1110/5974 cut-off events. For 3442/3608 co-relation queries the response was YES. Maximal size of possible extension queue 204. Compared 60288 event pairs, 277 based on Foata normal form. 80/5919 useless extension candidates. Maximal degree in co-relation 10518. Up to 748 conditions per place. [2025-04-29 11:12:01,952 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 63 selfloop transitions, 7 changer transitions 8/202 dead transitions. [2025-04-29 11:12:01,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 202 transitions, 844 flow [2025-04-29 11:12:01,952 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:12:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-29 11:12:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 793 transitions. [2025-04-29 11:12:01,953 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8920134983127109 [2025-04-29 11:12:01,953 INFO L175 Difference]: Start difference. First operand has 157 places, 150 transitions, 522 flow. Second operand 7 states and 793 transitions. [2025-04-29 11:12:01,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 202 transitions, 844 flow [2025-04-29 11:12:01,959 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 161 places, 202 transitions, 826 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-29 11:12:01,960 INFO L231 Difference]: Finished difference. Result has 164 places, 153 transitions, 540 flow [2025-04-29 11:12:01,961 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=504, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=150, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=540, PETRI_PLACES=164, PETRI_TRANSITIONS=153} [2025-04-29 11:12:01,961 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 32 predicate places. [2025-04-29 11:12:01,961 INFO L485 AbstractCegarLoop]: Abstraction has has 164 places, 153 transitions, 540 flow [2025-04-29 11:12:01,961 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 104.66666666666667) internal successors, (628), 6 states have internal predecessors, (628), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:01,961 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:01,962 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:01,962 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-04-29 11:12:01,962 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:01,963 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:01,964 INFO L85 PathProgramCache]: Analyzing trace with hash 681897430, now seen corresponding path program 1 times [2025-04-29 11:12:01,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:01,964 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101419449] [2025-04-29 11:12:01,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:01,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-04-29 11:12:01,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-04-29 11:12:01,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:01,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:02,122 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-04-29 11:12:02,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:02,123 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101419449] [2025-04-29 11:12:02,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101419449] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:02,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:02,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:12:02,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295289319] [2025-04-29 11:12:02,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:02,123 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-29 11:12:02,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:02,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-29 11:12:02,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-04-29 11:12:02,175 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 127 [2025-04-29 11:12:02,176 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 153 transitions, 540 flow. Second operand has 8 states, 8 states have (on average 104.75) internal successors, (838), 8 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:02,176 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:02,176 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 127 [2025-04-29 11:12:02,176 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:02,729 INFO L116 PetriNetUnfolderBase]: 834/3903 cut-off events. [2025-04-29 11:12:02,729 INFO L117 PetriNetUnfolderBase]: For 2146/2174 co-relation queries the response was YES. [2025-04-29 11:12:02,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7625 conditions, 3903 events. 834/3903 cut-off events. For 2146/2174 co-relation queries the response was YES. Maximal size of possible extension queue 106. Compared 33482 event pairs, 83 based on Foata normal form. 48/3915 useless extension candidates. Maximal degree in co-relation 6961. Up to 410 conditions per place. [2025-04-29 11:12:02,748 INFO L140 encePairwiseOnDemand]: 120/127 looper letters, 85 selfloop transitions, 10 changer transitions 22/233 dead transitions. [2025-04-29 11:12:02,748 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 233 transitions, 1022 flow [2025-04-29 11:12:02,748 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:12:02,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-04-29 11:12:02,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1130 transitions. [2025-04-29 11:12:02,749 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.889763779527559 [2025-04-29 11:12:02,749 INFO L175 Difference]: Start difference. First operand has 164 places, 153 transitions, 540 flow. Second operand 10 states and 1130 transitions. [2025-04-29 11:12:02,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 233 transitions, 1022 flow [2025-04-29 11:12:02,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 233 transitions, 1012 flow, removed 1 selfloop flow, removed 3 redundant places. [2025-04-29 11:12:02,756 INFO L231 Difference]: Finished difference. Result has 173 places, 147 transitions, 538 flow [2025-04-29 11:12:02,756 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=530, PETRI_DIFFERENCE_MINUEND_PLACES=161, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=143, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=538, PETRI_PLACES=173, PETRI_TRANSITIONS=147} [2025-04-29 11:12:02,757 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 41 predicate places. [2025-04-29 11:12:02,757 INFO L485 AbstractCegarLoop]: Abstraction has has 173 places, 147 transitions, 538 flow [2025-04-29 11:12:02,757 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 104.75) internal successors, (838), 8 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:02,757 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-29 11:12:02,757 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:02,757 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-04-29 11:12:02,757 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting threadErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 6 more)] === [2025-04-29 11:12:02,759 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:12:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1283682699, now seen corresponding path program 1 times [2025-04-29 11:12:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:12:02,759 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262475843] [2025-04-29 11:12:02,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:12:02,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:12:02,774 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-04-29 11:12:02,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-04-29 11:12:02,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:12:02,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:12:02,961 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:12:02,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:12:02,962 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262475843] [2025-04-29 11:12:02,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262475843] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:12:02,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:12:02,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-04-29 11:12:02,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557948620] [2025-04-29 11:12:02,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:12:02,963 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-29 11:12:02,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:12:02,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-29 11:12:02,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-04-29 11:12:03,025 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 127 [2025-04-29 11:12:03,026 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 147 transitions, 538 flow. Second operand has 10 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:03,026 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-29 11:12:03,026 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 127 [2025-04-29 11:12:03,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-29 11:12:03,554 INFO L116 PetriNetUnfolderBase]: 1014/3760 cut-off events. [2025-04-29 11:12:03,554 INFO L117 PetriNetUnfolderBase]: For 2357/2357 co-relation queries the response was YES. [2025-04-29 11:12:03,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8036 conditions, 3760 events. 1014/3760 cut-off events. For 2357/2357 co-relation queries the response was YES. Maximal size of possible extension queue 122. Compared 31691 event pairs, 51 based on Foata normal form. 12/3748 useless extension candidates. Maximal degree in co-relation 7369. Up to 496 conditions per place. [2025-04-29 11:12:03,569 INFO L140 encePairwiseOnDemand]: 121/127 looper letters, 0 selfloop transitions, 0 changer transitions 220/220 dead transitions. [2025-04-29 11:12:03,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 220 transitions, 973 flow [2025-04-29 11:12:03,569 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-29 11:12:03,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-29 11:12:03,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1439 transitions. [2025-04-29 11:12:03,570 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.8715929739551787 [2025-04-29 11:12:03,570 INFO L175 Difference]: Start difference. First operand has 173 places, 147 transitions, 538 flow. Second operand 13 states and 1439 transitions. [2025-04-29 11:12:03,570 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 220 transitions, 973 flow [2025-04-29 11:12:03,578 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 220 transitions, 903 flow, removed 18 selfloop flow, removed 18 redundant places. [2025-04-29 11:12:03,579 INFO L231 Difference]: Finished difference. Result has 151 places, 0 transitions, 0 flow [2025-04-29 11:12:03,579 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=127, PETRI_DIFFERENCE_MINUEND_FLOW=347, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=124, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=0, PETRI_PLACES=151, PETRI_TRANSITIONS=0} [2025-04-29 11:12:03,579 INFO L279 CegarLoopForPetriNet]: 132 programPoint places, 19 predicate places. [2025-04-29 11:12:03,579 INFO L485 AbstractCegarLoop]: Abstraction has has 151 places, 0 transitions, 0 flow [2025-04-29 11:12:03,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 104.1) internal successors, (1041), 10 states have internal predecessors, (1041), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (8 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (7 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (4 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (2 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (1 of 9 remaining) [2025-04-29 11:12:03,580 INFO L790 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (0 of 9 remaining) [2025-04-29 11:12:03,581 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-04-29 11:12:03,581 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:12:03,583 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 4 thread instances [2025-04-29 11:12:03,583 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-29 11:12:03,588 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.04 11:12:03 BasicIcfg [2025-04-29 11:12:03,588 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-29 11:12:03,588 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-29 11:12:03,589 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-29 11:12:03,589 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-29 11:12:03,589 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:11:33" (3/4) ... [2025-04-29 11:12:03,590 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-04-29 11:12:03,593 INFO L362 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2025-04-29 11:12:03,595 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-04-29 11:12:03,596 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:12:03,596 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-04-29 11:12:03,648 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-04-29 11:12:03,649 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-04-29 11:12:03,649 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-29 11:12:03,649 INFO L158 Benchmark]: Toolchain (without parser) took 31068.66ms. Allocated memory was 142.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 112.4MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: CACSL2BoogieTranslator took 203.60ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: Boogie Procedure Inliner took 21.00ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: Boogie Preprocessor took 27.74ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: RCFGBuilder took 268.66ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.1MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:03,650 INFO L158 Benchmark]: TraceAbstraction took 30482.80ms. Allocated memory was 142.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 81.6MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. [2025-04-29 11:12:03,651 INFO L158 Benchmark]: Witness Printer took 60.33ms. Allocated memory is still 6.6GB. Free memory was 3.1GB in the beginning and 3.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-04-29 11:12:03,651 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64ms. Allocated memory is still 201.3MB. Free memory is still 122.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 203.60ms. Allocated memory is still 142.6MB. Free memory was 112.4MB in the beginning and 98.3MB in the end (delta: 14.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 21.00ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 96.9MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.74ms. Allocated memory is still 142.6MB. Free memory was 96.9MB in the beginning and 95.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 268.66ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 82.1MB in the end (delta: 13.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 30482.80ms. Allocated memory was 142.6MB in the beginning and 6.6GB in the end (delta: 6.5GB). Free memory was 81.6MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.5GB. Max. memory is 16.1GB. * Witness Printer took 60.33ms. Allocated memory is still 6.6GB. Free memory was 3.1GB in the beginning and 3.1GB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 34]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 29]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 18]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 90 locations, 91 edges, 6 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 283 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 170 mSDsluCounter, 61 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 42 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 328 IncrementalHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 19 mSDtfsCounter, 328 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=185occurred in iteration=3, InterpolantAutomatonStates: 24, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 182 NumberOfCodeBlocks, 182 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 138 ConstructedInterpolants, 0 QuantifiedInterpolants, 427 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 4 procedures, 107 locations, 109 edges, 7 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 1.7s, OverallIterations: 8, TraceHistogramMax: 3, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 436 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 298 mSDsluCounter, 91 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 635 IncrementalHoareTripleChecker+Invalid, 648 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 19 mSDtfsCounter, 635 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=310occurred in iteration=6, InterpolantAutomatonStates: 37, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 302 NumberOfCodeBlocks, 302 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 239 ConstructedInterpolants, 0 QuantifiedInterpolants, 744 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 5/5 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 3 thread instances CFG has 5 procedures, 124 locations, 127 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 3.8s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 726 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 518 mSDsluCounter, 203 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 111 mSDsCounter, 23 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1101 IncrementalHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 23 mSolverCounterUnsat, 92 mSDtfsCounter, 1101 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=421occurred in iteration=7, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 512 NumberOfCodeBlocks, 512 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 429 ConstructedInterpolants, 0 QuantifiedInterpolants, 1402 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data with 4 thread instances CFG has 6 procedures, 141 locations, 145 edges, 9 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 23.5s, OverallIterations: 17, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 21.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1690 SdHoareTripleChecker+Valid, 1.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1338 mSDsluCounter, 336 SdHoareTripleChecker+Invalid, 1.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 283 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3215 IncrementalHoareTripleChecker+Invalid, 3264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 53 mSDtfsCounter, 3215 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 129 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=540occurred in iteration=15, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 1257 NumberOfCodeBlocks, 1257 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1240 ConstructedInterpolants, 0 QuantifiedInterpolants, 3970 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 88/88 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-04-29 11:12:03,669 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE