./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/pthread-nondet/nondet-array-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/pthread-nondet/nondet-array-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:29:50,568 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:29:50,624 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:29:50,630 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:29:50,630 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:29:50,649 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:29:50,649 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:29:50,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:29:50,649 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:29:50,649 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:29:50,649 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:29:50,649 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:29:50,650 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:29:50,650 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:29:50,651 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:29:50,651 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:50,651 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:29:50,652 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! data-race) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2796c466e7d8363340777400f1e90c0fc7eb53096f49ded0fb8aa6814bf1ef21 [2025-02-08 05:29:50,898 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:29:50,905 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:29:50,908 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:29:50,908 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:29:50,909 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:29:50,910 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-02-08 05:29:52,078 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ef27bdc5/77feea07d258480ca4716911d5cd9534/FLAG0ad304b1b [2025-02-08 05:29:52,366 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:29:52,367 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/pthread-nondet/nondet-array-2.i [2025-02-08 05:29:52,380 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ef27bdc5/77feea07d258480ca4716911d5cd9534/FLAG0ad304b1b [2025-02-08 05:29:52,652 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2ef27bdc5/77feea07d258480ca4716911d5cd9534 [2025-02-08 05:29:52,654 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:29:52,655 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:29:52,657 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:52,657 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:29:52,660 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:29:52,660 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:52,662 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63091d9c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52, skipping insertion in model container [2025-02-08 05:29:52,662 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:52,687 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:29:52,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:52,904 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:29:52,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:29:52,971 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:29:52,972 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52 WrapperNode [2025-02-08 05:29:52,972 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:29:52,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:52,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:29:52,974 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:29:52,978 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:52,986 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,003 INFO L138 Inliner]: procedures = 169, calls = 28, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2025-02-08 05:29:53,003 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:29:53,004 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:29:53,004 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:29:53,004 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:29:53,009 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,011 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,013 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,014 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,022 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,024 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,025 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,025 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,027 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:29:53,027 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:29:53,027 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:29:53,027 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:29:53,028 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (1/1) ... [2025-02-08 05:29:53,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:29:53,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:29:53,052 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:29:53,056 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:29:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:29:53,067 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure thr [2025-02-08 05:29:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure thr [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:29:53,068 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:29:53,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:29:53,069 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:29:53,161 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:29:53,162 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:29:53,351 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698: havoc main_~#t~1#1.base, main_~#t~1#1.offset; [2025-02-08 05:29:53,352 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: SUMMARY for call ULTIMATE.dealloc(main_~#t~1#1.base, main_~#t~1#1.offset); srcloc: null [2025-02-08 05:29:53,388 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:29:53,391 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:29:53,403 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:29:53,404 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:29:53,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:53 BoogieIcfgContainer [2025-02-08 05:29:53,405 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:29:53,407 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:29:53,407 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:29:53,410 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:29:53,411 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:29:52" (1/3) ... [2025-02-08 05:29:53,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db84f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:53, skipping insertion in model container [2025-02-08 05:29:53,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:29:52" (2/3) ... [2025-02-08 05:29:53,412 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1db84f4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:29:53, skipping insertion in model container [2025-02-08 05:29:53,412 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:29:53" (3/3) ... [2025-02-08 05:29:53,413 INFO L128 eAbstractionObserver]: Analyzing ICFG nondet-array-2.i [2025-02-08 05:29:53,423 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:29:53,425 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG nondet-array-2.i that has 2 procedures, 124 locations, 1 initial locations, 3 loop locations, and 6 error locations. [2025-02-08 05:29:53,425 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:29:53,486 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-02-08 05:29:53,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 127 places, 129 transitions, 265 flow [2025-02-08 05:29:53,571 INFO L124 PetriNetUnfolderBase]: 8/187 cut-off events. [2025-02-08 05:29:53,572 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:29:53,580 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 187 events. 8/187 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 457 event pairs, 0 based on Foata normal form. 0/167 useless extension candidates. Maximal degree in co-relation 95. Up to 4 conditions per place. [2025-02-08 05:29:53,581 INFO L82 GeneralOperation]: Start removeDead. Operand has 127 places, 129 transitions, 265 flow [2025-02-08 05:29:53,586 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 127 places, 129 transitions, 265 flow [2025-02-08 05:29:53,595 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:29:53,608 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e18efd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:29:53,608 INFO L334 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2025-02-08 05:29:53,631 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:29:53,631 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-02-08 05:29:53,631 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:53,631 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:53,633 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:53,633 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:53,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:53,640 INFO L85 PathProgramCache]: Analyzing trace with hash -1993874590, now seen corresponding path program 1 times [2025-02-08 05:29:53,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:53,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980894478] [2025-02-08 05:29:53,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:53,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:29:53,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:29:53,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:53,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:53,976 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:53,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:53,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980894478] [2025-02-08 05:29:53,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980894478] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:53,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:53,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:53,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011368153] [2025-02-08 05:29:53,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:53,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:29:53,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:54,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:29:54,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:29:54,162 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 129 [2025-02-08 05:29:54,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 129 transitions, 265 flow. Second operand has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:54,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:54,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 129 [2025-02-08 05:29:54,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:54,227 INFO L124 PetriNetUnfolderBase]: 3/196 cut-off events. [2025-02-08 05:29:54,227 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2025-02-08 05:29:54,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 235 conditions, 196 events. 3/196 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 312 event pairs, 0 based on Foata normal form. 9/186 useless extension candidates. Maximal degree in co-relation 67. Up to 17 conditions per place. [2025-02-08 05:29:54,229 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 16 selfloop transitions, 8 changer transitions 7/136 dead transitions. [2025-02-08 05:29:54,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 136 transitions, 339 flow [2025-02-08 05:29:54,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:29:54,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:29:54,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 465 transitions. [2025-02-08 05:29:54,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9011627906976745 [2025-02-08 05:29:54,241 INFO L175 Difference]: Start difference. First operand has 127 places, 129 transitions, 265 flow. Second operand 4 states and 465 transitions. [2025-02-08 05:29:54,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 136 transitions, 339 flow [2025-02-08 05:29:54,245 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 128 places, 136 transitions, 339 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:54,252 INFO L231 Difference]: Finished difference. Result has 131 places, 126 transitions, 305 flow [2025-02-08 05:29:54,254 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=255, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=305, PETRI_PLACES=131, PETRI_TRANSITIONS=126} [2025-02-08 05:29:54,261 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 4 predicate places. [2025-02-08 05:29:54,261 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 126 transitions, 305 flow [2025-02-08 05:29:54,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 108.4) internal successors, (542), 5 states have internal predecessors, (542), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:54,262 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:54,262 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:54,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:29:54,262 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:54,263 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:54,263 INFO L85 PathProgramCache]: Analyzing trace with hash 978748974, now seen corresponding path program 1 times [2025-02-08 05:29:54,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:54,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36422234] [2025-02-08 05:29:54,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:54,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:29:54,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:29:54,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:54,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:54,744 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:54,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:54,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36422234] [2025-02-08 05:29:54,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36422234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:54,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:54,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:54,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153721803] [2025-02-08 05:29:54,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:54,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:54,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:54,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:54,747 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:54,933 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 129 [2025-02-08 05:29:54,933 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 126 transitions, 305 flow. Second operand has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:54,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:54,934 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 129 [2025-02-08 05:29:54,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:55,037 INFO L124 PetriNetUnfolderBase]: 83/506 cut-off events. [2025-02-08 05:29:55,038 INFO L125 PetriNetUnfolderBase]: For 64/70 co-relation queries the response was YES. [2025-02-08 05:29:55,039 INFO L83 FinitePrefix]: Finished finitePrefix Result has 799 conditions, 506 events. 83/506 cut-off events. For 64/70 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2508 event pairs, 47 based on Foata normal form. 0/455 useless extension candidates. Maximal degree in co-relation 640. Up to 191 conditions per place. [2025-02-08 05:29:55,040 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 35 selfloop transitions, 22 changer transitions 0/147 dead transitions. [2025-02-08 05:29:55,040 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 147 transitions, 461 flow [2025-02-08 05:29:55,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:55,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:55,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 602 transitions. [2025-02-08 05:29:55,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-02-08 05:29:55,042 INFO L175 Difference]: Start difference. First operand has 131 places, 126 transitions, 305 flow. Second operand 6 states and 602 transitions. [2025-02-08 05:29:55,042 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 147 transitions, 461 flow [2025-02-08 05:29:55,044 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 147 transitions, 459 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:55,045 INFO L231 Difference]: Finished difference. Result has 140 places, 147 transitions, 453 flow [2025-02-08 05:29:55,045 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=303, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=126, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=453, PETRI_PLACES=140, PETRI_TRANSITIONS=147} [2025-02-08 05:29:55,046 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 13 predicate places. [2025-02-08 05:29:55,046 INFO L471 AbstractCegarLoop]: Abstraction has has 140 places, 147 transitions, 453 flow [2025-02-08 05:29:55,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 92.66666666666667) internal successors, (556), 6 states have internal predecessors, (556), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:55,046 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:55,047 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:55,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 05:29:55,047 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:55,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:55,047 INFO L85 PathProgramCache]: Analyzing trace with hash -2103357255, now seen corresponding path program 1 times [2025-02-08 05:29:55,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:55,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175833910] [2025-02-08 05:29:55,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:55,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:55,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:29:55,060 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:29:55,060 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:55,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:55,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:55,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:55,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175833910] [2025-02-08 05:29:55,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175833910] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:55,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:55,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:29:55,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091797098] [2025-02-08 05:29:55,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:55,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:29:55,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:55,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:29:55,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:29:55,086 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 129 [2025-02-08 05:29:55,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 147 transitions, 453 flow. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:55,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:55,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 129 [2025-02-08 05:29:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:55,112 INFO L124 PetriNetUnfolderBase]: 33/309 cut-off events. [2025-02-08 05:29:55,112 INFO L125 PetriNetUnfolderBase]: For 37/39 co-relation queries the response was YES. [2025-02-08 05:29:55,113 INFO L83 FinitePrefix]: Finished finitePrefix Result has 500 conditions, 309 events. 33/309 cut-off events. For 37/39 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 1005 event pairs, 0 based on Foata normal form. 0/287 useless extension candidates. Maximal degree in co-relation 418. Up to 45 conditions per place. [2025-02-08 05:29:55,114 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 3 selfloop transitions, 2 changer transitions 0/146 dead transitions. [2025-02-08 05:29:55,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 146 transitions, 461 flow [2025-02-08 05:29:55,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:29:55,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:29:55,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2025-02-08 05:29:55,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.937984496124031 [2025-02-08 05:29:55,115 INFO L175 Difference]: Start difference. First operand has 140 places, 147 transitions, 453 flow. Second operand 3 states and 363 transitions. [2025-02-08 05:29:55,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 146 transitions, 461 flow [2025-02-08 05:29:55,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 141 places, 146 transitions, 461 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:55,121 INFO L231 Difference]: Finished difference. Result has 141 places, 146 transitions, 455 flow [2025-02-08 05:29:55,121 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=144, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=455, PETRI_PLACES=141, PETRI_TRANSITIONS=146} [2025-02-08 05:29:55,122 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 14 predicate places. [2025-02-08 05:29:55,122 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 146 transitions, 455 flow [2025-02-08 05:29:55,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:55,122 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:55,122 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:55,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:29:55,122 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:55,123 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:55,123 INFO L85 PathProgramCache]: Analyzing trace with hash 1587110973, now seen corresponding path program 1 times [2025-02-08 05:29:55,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:55,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359771181] [2025-02-08 05:29:55,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:55,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:55,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:29:55,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:29:55,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:55,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:55,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359771181] [2025-02-08 05:29:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359771181] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454121706] [2025-02-08 05:29:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:55,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:55,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:55,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:55,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:55,516 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 129 [2025-02-08 05:29:55,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 146 transitions, 455 flow. Second operand has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:55,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:55,517 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 129 [2025-02-08 05:29:55,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:55,625 INFO L124 PetriNetUnfolderBase]: 131/551 cut-off events. [2025-02-08 05:29:55,626 INFO L125 PetriNetUnfolderBase]: For 147/162 co-relation queries the response was YES. [2025-02-08 05:29:55,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1188 conditions, 551 events. 131/551 cut-off events. For 147/162 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2617 event pairs, 23 based on Foata normal form. 0/511 useless extension candidates. Maximal degree in co-relation 1097. Up to 247 conditions per place. [2025-02-08 05:29:55,629 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 38 selfloop transitions, 48 changer transitions 0/189 dead transitions. [2025-02-08 05:29:55,629 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 189 transitions, 783 flow [2025-02-08 05:29:55,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:55,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:55,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 668 transitions. [2025-02-08 05:29:55,630 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8630490956072352 [2025-02-08 05:29:55,630 INFO L175 Difference]: Start difference. First operand has 141 places, 146 transitions, 455 flow. Second operand 6 states and 668 transitions. [2025-02-08 05:29:55,631 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 189 transitions, 783 flow [2025-02-08 05:29:55,633 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 144 places, 189 transitions, 779 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:29:55,635 INFO L231 Difference]: Finished difference. Result has 149 places, 189 transitions, 839 flow [2025-02-08 05:29:55,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=839, PETRI_PLACES=149, PETRI_TRANSITIONS=189} [2025-02-08 05:29:55,636 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 22 predicate places. [2025-02-08 05:29:55,636 INFO L471 AbstractCegarLoop]: Abstraction has has 149 places, 189 transitions, 839 flow [2025-02-08 05:29:55,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 103.16666666666667) internal successors, (619), 6 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:55,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:55,637 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 05:29:55,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash -387382517, now seen corresponding path program 1 times [2025-02-08 05:29:55,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:55,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716625934] [2025-02-08 05:29:55,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:55,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:29:55,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:29:55,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:55,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:55,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:55,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716625934] [2025-02-08 05:29:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716625934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:55,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:55,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810377890] [2025-02-08 05:29:55,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:55,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:55,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:55,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:55,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:56,098 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 129 [2025-02-08 05:29:56,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 189 transitions, 839 flow. Second operand has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:56,099 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 129 [2025-02-08 05:29:56,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:56,203 INFO L124 PetriNetUnfolderBase]: 159/718 cut-off events. [2025-02-08 05:29:56,204 INFO L125 PetriNetUnfolderBase]: For 551/624 co-relation queries the response was YES. [2025-02-08 05:29:56,206 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1964 conditions, 718 events. 159/718 cut-off events. For 551/624 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 4098 event pairs, 26 based on Foata normal form. 0/678 useless extension candidates. Maximal degree in co-relation 1774. Up to 300 conditions per place. [2025-02-08 05:29:56,209 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 87 selfloop transitions, 32 changer transitions 0/217 dead transitions. [2025-02-08 05:29:56,209 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 154 places, 217 transitions, 1248 flow [2025-02-08 05:29:56,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:56,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:56,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 633 transitions. [2025-02-08 05:29:56,212 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8178294573643411 [2025-02-08 05:29:56,212 INFO L175 Difference]: Start difference. First operand has 149 places, 189 transitions, 839 flow. Second operand 6 states and 633 transitions. [2025-02-08 05:29:56,212 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 154 places, 217 transitions, 1248 flow [2025-02-08 05:29:56,220 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 154 places, 217 transitions, 1230 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:56,224 INFO L231 Difference]: Finished difference. Result has 159 places, 216 transitions, 1147 flow [2025-02-08 05:29:56,225 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=821, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=169, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1147, PETRI_PLACES=159, PETRI_TRANSITIONS=216} [2025-02-08 05:29:56,225 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 32 predicate places. [2025-02-08 05:29:56,226 INFO L471 AbstractCegarLoop]: Abstraction has has 159 places, 216 transitions, 1147 flow [2025-02-08 05:29:56,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.83333333333333) internal successors, (599), 6 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,226 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:56,227 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:56,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:29:56,227 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:56,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:56,230 INFO L85 PathProgramCache]: Analyzing trace with hash -209642857, now seen corresponding path program 1 times [2025-02-08 05:29:56,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:56,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312391255] [2025-02-08 05:29:56,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:56,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:56,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:29:56,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:29:56,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:56,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:56,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:56,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312391255] [2025-02-08 05:29:56,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312391255] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:56,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:56,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:29:56,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381655369] [2025-02-08 05:29:56,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:56,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:29:56,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:56,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:29:56,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:29:56,272 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 129 [2025-02-08 05:29:56,273 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 159 places, 216 transitions, 1147 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,273 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:56,273 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 129 [2025-02-08 05:29:56,273 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:56,326 INFO L124 PetriNetUnfolderBase]: 134/590 cut-off events. [2025-02-08 05:29:56,326 INFO L125 PetriNetUnfolderBase]: For 468/485 co-relation queries the response was YES. [2025-02-08 05:29:56,328 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1655 conditions, 590 events. 134/590 cut-off events. For 468/485 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3030 event pairs, 6 based on Foata normal form. 1/587 useless extension candidates. Maximal degree in co-relation 1563. Up to 129 conditions per place. [2025-02-08 05:29:56,330 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 5 selfloop transitions, 2 changer transitions 19/215 dead transitions. [2025-02-08 05:29:56,330 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 215 transitions, 1159 flow [2025-02-08 05:29:56,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:29:56,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:29:56,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2025-02-08 05:29:56,331 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9276485788113695 [2025-02-08 05:29:56,331 INFO L175 Difference]: Start difference. First operand has 159 places, 216 transitions, 1147 flow. Second operand 3 states and 359 transitions. [2025-02-08 05:29:56,331 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 215 transitions, 1159 flow [2025-02-08 05:29:56,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 160 places, 215 transitions, 1103 flow, removed 28 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:56,338 INFO L231 Difference]: Finished difference. Result has 160 places, 196 transitions, 1043 flow [2025-02-08 05:29:56,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=1089, PETRI_DIFFERENCE_MINUEND_PLACES=158, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1043, PETRI_PLACES=160, PETRI_TRANSITIONS=196} [2025-02-08 05:29:56,339 INFO L279 CegarLoopForPetriNet]: 127 programPoint places, 33 predicate places. [2025-02-08 05:29:56,339 INFO L471 AbstractCegarLoop]: Abstraction has has 160 places, 196 transitions, 1043 flow [2025-02-08 05:29:56,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,340 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:56,340 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:56,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 05:29:56,340 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 7 more)] === [2025-02-08 05:29:56,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:56,341 INFO L85 PathProgramCache]: Analyzing trace with hash -2072897036, now seen corresponding path program 1 times [2025-02-08 05:29:56,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:56,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364354088] [2025-02-08 05:29:56,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:56,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:56,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:29:56,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:29:56,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:56,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:29:56,359 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:29:56,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 05:29:56,372 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 05:29:56,372 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:56,372 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:29:56,418 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:29:56,418 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:29:56,419 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (9 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (8 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (7 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (6 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 10 remaining) [2025-02-08 05:29:56,420 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 10 remaining) [2025-02-08 05:29:56,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:29:56,421 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:56,422 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:29:56,422 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-02-08 05:29:56,436 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-02-08 05:29:56,438 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 152 transitions, 320 flow [2025-02-08 05:29:56,458 INFO L124 PetriNetUnfolderBase]: 16/329 cut-off events. [2025-02-08 05:29:56,458 INFO L125 PetriNetUnfolderBase]: For 6/7 co-relation queries the response was YES. [2025-02-08 05:29:56,459 INFO L83 FinitePrefix]: Finished finitePrefix Result has 341 conditions, 329 events. 16/329 cut-off events. For 6/7 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 944 event pairs, 0 based on Foata normal form. 0/292 useless extension candidates. Maximal degree in co-relation 189. Up to 8 conditions per place. [2025-02-08 05:29:56,459 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 152 transitions, 320 flow [2025-02-08 05:29:56,460 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 152 transitions, 320 flow [2025-02-08 05:29:56,461 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:29:56,461 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e18efd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:29:56,461 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2025-02-08 05:29:56,464 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:29:56,464 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-02-08 05:29:56,464 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:29:56,464 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:56,464 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:56,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:29:56,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:56,465 INFO L85 PathProgramCache]: Analyzing trace with hash 842286434, now seen corresponding path program 1 times [2025-02-08 05:29:56,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:56,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503346789] [2025-02-08 05:29:56,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:56,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:56,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:29:56,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:29:56,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:56,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:56,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:56,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:56,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503346789] [2025-02-08 05:29:56,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503346789] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:56,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:56,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:56,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963149943] [2025-02-08 05:29:56,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:56,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:29:56,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:56,510 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:29:56,510 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:29:56,592 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 152 [2025-02-08 05:29:56,593 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 152 transitions, 320 flow. Second operand has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,593 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:56,593 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 152 [2025-02-08 05:29:56,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:56,635 INFO L124 PetriNetUnfolderBase]: 10/400 cut-off events. [2025-02-08 05:29:56,636 INFO L125 PetriNetUnfolderBase]: For 37/64 co-relation queries the response was YES. [2025-02-08 05:29:56,636 INFO L83 FinitePrefix]: Finished finitePrefix Result has 485 conditions, 400 events. 10/400 cut-off events. For 37/64 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 1300 event pairs, 0 based on Foata normal form. 19/377 useless extension candidates. Maximal degree in co-relation 231. Up to 42 conditions per place. [2025-02-08 05:29:56,637 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 24 selfloop transitions, 9 changer transitions 4/163 dead transitions. [2025-02-08 05:29:56,637 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 163 transitions, 420 flow [2025-02-08 05:29:56,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:29:56,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:29:56,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 555 transitions. [2025-02-08 05:29:56,639 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912828947368421 [2025-02-08 05:29:56,639 INFO L175 Difference]: Start difference. First operand has 151 places, 152 transitions, 320 flow. Second operand 4 states and 555 transitions. [2025-02-08 05:29:56,639 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 163 transitions, 420 flow [2025-02-08 05:29:56,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 163 transitions, 420 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:56,641 INFO L231 Difference]: Finished difference. Result has 155 places, 153 transitions, 378 flow [2025-02-08 05:29:56,641 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=147, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=138, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=378, PETRI_PLACES=155, PETRI_TRANSITIONS=153} [2025-02-08 05:29:56,641 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 4 predicate places. [2025-02-08 05:29:56,641 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 153 transitions, 378 flow [2025-02-08 05:29:56,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 129.4) internal successors, (647), 5 states have internal predecessors, (647), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,642 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:56,642 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:56,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:29:56,642 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:29:56,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:56,643 INFO L85 PathProgramCache]: Analyzing trace with hash -1294572346, now seen corresponding path program 1 times [2025-02-08 05:29:56,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:56,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495164700] [2025-02-08 05:29:56,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:56,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:56,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:29:56,651 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:29:56,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:56,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:56,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:56,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:56,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495164700] [2025-02-08 05:29:56,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495164700] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:56,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:56,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364862267] [2025-02-08 05:29:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:56,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:56,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:56,800 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:56,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:56,931 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 108 out of 152 [2025-02-08 05:29:56,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 153 transitions, 378 flow. Second operand has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:56,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:56,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 108 of 152 [2025-02-08 05:29:56,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:57,251 INFO L124 PetriNetUnfolderBase]: 1178/4239 cut-off events. [2025-02-08 05:29:57,252 INFO L125 PetriNetUnfolderBase]: For 458/480 co-relation queries the response was YES. [2025-02-08 05:29:57,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6807 conditions, 4239 events. 1178/4239 cut-off events. For 458/480 co-relation queries the response was YES. Maximal size of possible extension queue 168. Compared 36397 event pairs, 769 based on Foata normal form. 0/3826 useless extension candidates. Maximal degree in co-relation 4257. Up to 1921 conditions per place. [2025-02-08 05:29:57,274 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 45 selfloop transitions, 38 changer transitions 0/191 dead transitions. [2025-02-08 05:29:57,275 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 159 places, 191 transitions, 625 flow [2025-02-08 05:29:57,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:57,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 727 transitions. [2025-02-08 05:29:57,321 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7971491228070176 [2025-02-08 05:29:57,321 INFO L175 Difference]: Start difference. First operand has 155 places, 153 transitions, 378 flow. Second operand 6 states and 727 transitions. [2025-02-08 05:29:57,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 159 places, 191 transitions, 625 flow [2025-02-08 05:29:57,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 159 places, 191 transitions, 623 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:57,325 INFO L231 Difference]: Finished difference. Result has 164 places, 190 transitions, 630 flow [2025-02-08 05:29:57,325 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=376, PETRI_DIFFERENCE_MINUEND_PLACES=154, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=153, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=164, PETRI_TRANSITIONS=190} [2025-02-08 05:29:57,326 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 13 predicate places. [2025-02-08 05:29:57,326 INFO L471 AbstractCegarLoop]: Abstraction has has 164 places, 190 transitions, 630 flow [2025-02-08 05:29:57,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 109.66666666666667) internal successors, (658), 6 states have internal predecessors, (658), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:57,326 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:57,326 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:57,326 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:29:57,326 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:29:57,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:57,327 INFO L85 PathProgramCache]: Analyzing trace with hash -458135919, now seen corresponding path program 1 times [2025-02-08 05:29:57,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:57,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121875925] [2025-02-08 05:29:57,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:57,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:57,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:29:57,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:29:57,335 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:57,335 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:57,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:57,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:57,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121875925] [2025-02-08 05:29:57,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121875925] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:57,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:57,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:29:57,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202348128] [2025-02-08 05:29:57,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:57,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:29:57,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:57,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:29:57,348 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:29:57,359 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-02-08 05:29:57,359 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 164 places, 190 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:57,359 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:57,359 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-02-08 05:29:57,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:57,634 INFO L124 PetriNetUnfolderBase]: 670/3615 cut-off events. [2025-02-08 05:29:57,635 INFO L125 PetriNetUnfolderBase]: For 560/592 co-relation queries the response was YES. [2025-02-08 05:29:57,642 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5978 conditions, 3615 events. 670/3615 cut-off events. For 560/592 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 32236 event pairs, 124 based on Foata normal form. 0/3290 useless extension candidates. Maximal degree in co-relation 4954. Up to 762 conditions per place. [2025-02-08 05:29:57,652 INFO L140 encePairwiseOnDemand]: 144/152 looper letters, 15 selfloop transitions, 6 changer transitions 0/199 dead transitions. [2025-02-08 05:29:57,652 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 199 transitions, 701 flow [2025-02-08 05:29:57,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:29:57,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:29:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 431 transitions. [2025-02-08 05:29:57,653 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9451754385964912 [2025-02-08 05:29:57,653 INFO L175 Difference]: Start difference. First operand has 164 places, 190 transitions, 630 flow. Second operand 3 states and 431 transitions. [2025-02-08 05:29:57,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 199 transitions, 701 flow [2025-02-08 05:29:57,658 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 166 places, 199 transitions, 701 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:29:57,663 INFO L231 Difference]: Finished difference. Result has 168 places, 196 transitions, 682 flow [2025-02-08 05:29:57,663 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=164, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=190, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=184, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=682, PETRI_PLACES=168, PETRI_TRANSITIONS=196} [2025-02-08 05:29:57,663 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 17 predicate places. [2025-02-08 05:29:57,663 INFO L471 AbstractCegarLoop]: Abstraction has has 168 places, 196 transitions, 682 flow [2025-02-08 05:29:57,664 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.0) internal successors, (411), 3 states have internal predecessors, (411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:57,664 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:57,664 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:57,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:29:57,664 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:29:57,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:57,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1957623659, now seen corresponding path program 1 times [2025-02-08 05:29:57,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:57,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855957890] [2025-02-08 05:29:57,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:57,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:57,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:29:57,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:29:57,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:57,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:57,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:57,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855957890] [2025-02-08 05:29:57,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855957890] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:57,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:57,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:57,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151880846] [2025-02-08 05:29:57,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:57,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:57,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:57,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:57,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:58,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-02-08 05:29:58,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 168 places, 196 transitions, 682 flow. Second operand has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:58,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:58,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-02-08 05:29:58,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:29:59,218 INFO L124 PetriNetUnfolderBase]: 3407/12504 cut-off events. [2025-02-08 05:29:59,218 INFO L125 PetriNetUnfolderBase]: For 2995/3140 co-relation queries the response was YES. [2025-02-08 05:29:59,240 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24834 conditions, 12504 events. 3407/12504 cut-off events. For 2995/3140 co-relation queries the response was YES. Maximal size of possible extension queue 367. Compared 131734 event pairs, 722 based on Foata normal form. 1/11316 useless extension candidates. Maximal degree in co-relation 21053. Up to 4281 conditions per place. [2025-02-08 05:29:59,282 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 95 selfloop transitions, 96 changer transitions 0/322 dead transitions. [2025-02-08 05:29:59,283 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 322 transitions, 1580 flow [2025-02-08 05:29:59,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:29:59,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:29:59,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 828 transitions. [2025-02-08 05:29:59,285 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9078947368421053 [2025-02-08 05:29:59,285 INFO L175 Difference]: Start difference. First operand has 168 places, 196 transitions, 682 flow. Second operand 6 states and 828 transitions. [2025-02-08 05:29:59,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 322 transitions, 1580 flow [2025-02-08 05:29:59,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 322 transitions, 1568 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:29:59,309 INFO L231 Difference]: Finished difference. Result has 175 places, 290 transitions, 1466 flow [2025-02-08 05:29:59,310 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=670, PETRI_DIFFERENCE_MINUEND_PLACES=166, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=196, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=148, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1466, PETRI_PLACES=175, PETRI_TRANSITIONS=290} [2025-02-08 05:29:59,311 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 24 predicate places. [2025-02-08 05:29:59,311 INFO L471 AbstractCegarLoop]: Abstraction has has 175 places, 290 transitions, 1466 flow [2025-02-08 05:29:59,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.16666666666667) internal successors, (721), 6 states have internal predecessors, (721), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:59,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:29:59,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:29:59,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:29:59,312 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:29:59,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:29:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 1779137774, now seen corresponding path program 1 times [2025-02-08 05:29:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:29:59,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783338785] [2025-02-08 05:29:59,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:29:59,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:29:59,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-02-08 05:29:59,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-02-08 05:29:59,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:29:59,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:29:59,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:29:59,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:29:59,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783338785] [2025-02-08 05:29:59,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783338785] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:29:59,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:29:59,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:29:59,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [315819193] [2025-02-08 05:29:59,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:29:59,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:29:59,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:29:59,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:29:59,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:29:59,773 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 152 [2025-02-08 05:29:59,774 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 290 transitions, 1466 flow. Second operand has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:29:59,774 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:29:59,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 152 [2025-02-08 05:29:59,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:01,277 INFO L124 PetriNetUnfolderBase]: 4645/17035 cut-off events. [2025-02-08 05:30:01,277 INFO L125 PetriNetUnfolderBase]: For 11889/12725 co-relation queries the response was YES. [2025-02-08 05:30:01,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42404 conditions, 17035 events. 4645/17035 cut-off events. For 11889/12725 co-relation queries the response was YES. Maximal size of possible extension queue 570. Compared 193978 event pairs, 1005 based on Foata normal form. 55/15438 useless extension candidates. Maximal degree in co-relation 35461. Up to 6495 conditions per place. [2025-02-08 05:30:01,347 INFO L140 encePairwiseOnDemand]: 137/152 looper letters, 147 selfloop transitions, 72 changer transitions 0/359 dead transitions. [2025-02-08 05:30:01,347 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 359 transitions, 2356 flow [2025-02-08 05:30:01,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:01,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:01,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 758 transitions. [2025-02-08 05:30:01,349 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.831140350877193 [2025-02-08 05:30:01,349 INFO L175 Difference]: Start difference. First operand has 175 places, 290 transitions, 1466 flow. Second operand 6 states and 758 transitions. [2025-02-08 05:30:01,349 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 359 transitions, 2356 flow [2025-02-08 05:30:01,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 180 places, 359 transitions, 2338 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:01,391 INFO L231 Difference]: Finished difference. Result has 185 places, 357 transitions, 2242 flow [2025-02-08 05:30:01,391 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=1448, PETRI_DIFFERENCE_MINUEND_PLACES=175, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=290, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=254, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2242, PETRI_PLACES=185, PETRI_TRANSITIONS=357} [2025-02-08 05:30:01,392 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 34 predicate places. [2025-02-08 05:30:01,392 INFO L471 AbstractCegarLoop]: Abstraction has has 185 places, 357 transitions, 2242 flow [2025-02-08 05:30:01,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 116.83333333333333) internal successors, (701), 6 states have internal predecessors, (701), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:01,392 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:01,392 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:01,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:30:01,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:01,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:01,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1678667092, now seen corresponding path program 1 times [2025-02-08 05:30:01,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:01,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355596050] [2025-02-08 05:30:01,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:01,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:01,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 62 statements into 1 equivalence classes. [2025-02-08 05:30:01,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 62 of 62 statements. [2025-02-08 05:30:01,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:01,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:01,416 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:01,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:01,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355596050] [2025-02-08 05:30:01,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355596050] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:01,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:01,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:01,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530920137] [2025-02-08 05:30:01,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:01,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:01,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:01,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:01,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:01,429 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-02-08 05:30:01,429 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 185 places, 357 transitions, 2242 flow. Second operand has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:01,429 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:01,429 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-02-08 05:30:01,429 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:02,802 INFO L124 PetriNetUnfolderBase]: 3720/14670 cut-off events. [2025-02-08 05:30:02,803 INFO L125 PetriNetUnfolderBase]: For 11049/11504 co-relation queries the response was YES. [2025-02-08 05:30:02,850 INFO L83 FinitePrefix]: Finished finitePrefix Result has 36181 conditions, 14670 events. 3720/14670 cut-off events. For 11049/11504 co-relation queries the response was YES. Maximal size of possible extension queue 545. Compared 166295 event pairs, 358 based on Foata normal form. 28/13567 useless extension candidates. Maximal degree in co-relation 31262. Up to 3155 conditions per place. [2025-02-08 05:30:02,894 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 7 changer transitions 0/364 dead transitions. [2025-02-08 05:30:02,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 364 transitions, 2316 flow [2025-02-08 05:30:02,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2025-02-08 05:30:02,896 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9364035087719298 [2025-02-08 05:30:02,896 INFO L175 Difference]: Start difference. First operand has 185 places, 357 transitions, 2242 flow. Second operand 3 states and 427 transitions. [2025-02-08 05:30:02,896 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 364 transitions, 2316 flow [2025-02-08 05:30:02,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 364 transitions, 2176 flow, removed 70 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:02,950 INFO L231 Difference]: Finished difference. Result has 189 places, 362 transitions, 2158 flow [2025-02-08 05:30:02,950 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2102, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=350, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2158, PETRI_PLACES=189, PETRI_TRANSITIONS=362} [2025-02-08 05:30:02,950 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 38 predicate places. [2025-02-08 05:30:02,950 INFO L471 AbstractCegarLoop]: Abstraction has has 189 places, 362 transitions, 2158 flow [2025-02-08 05:30:02,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:02,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:02,951 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:30:02,951 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:02,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:02,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1651562113, now seen corresponding path program 1 times [2025-02-08 05:30:02,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:02,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762376808] [2025-02-08 05:30:02,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:02,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:02,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:30:02,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:30:02,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:02,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:03,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:03,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:03,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [762376808] [2025-02-08 05:30:03,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [762376808] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:03,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:03,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:30:03,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188243593] [2025-02-08 05:30:03,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:03,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:30:03,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:03,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:30:03,300 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:30:03,681 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 152 [2025-02-08 05:30:03,683 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 189 places, 362 transitions, 2158 flow. Second operand has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:03,683 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:03,683 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 152 [2025-02-08 05:30:03,683 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:06,206 INFO L124 PetriNetUnfolderBase]: 7011/22053 cut-off events. [2025-02-08 05:30:06,206 INFO L125 PetriNetUnfolderBase]: For 23505/24427 co-relation queries the response was YES. [2025-02-08 05:30:06,273 INFO L83 FinitePrefix]: Finished finitePrefix Result has 66049 conditions, 22053 events. 7011/22053 cut-off events. For 23505/24427 co-relation queries the response was YES. Maximal size of possible extension queue 917. Compared 252278 event pairs, 930 based on Foata normal form. 333/20977 useless extension candidates. Maximal degree in co-relation 59730. Up to 5009 conditions per place. [2025-02-08 05:30:06,331 INFO L140 encePairwiseOnDemand]: 133/152 looper letters, 326 selfloop transitions, 238 changer transitions 1/697 dead transitions. [2025-02-08 05:30:06,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 198 places, 697 transitions, 5706 flow [2025-02-08 05:30:06,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 05:30:06,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-02-08 05:30:06,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1275 transitions. [2025-02-08 05:30:06,334 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8388157894736842 [2025-02-08 05:30:06,334 INFO L175 Difference]: Start difference. First operand has 189 places, 362 transitions, 2158 flow. Second operand 10 states and 1275 transitions. [2025-02-08 05:30:06,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 198 places, 697 transitions, 5706 flow [2025-02-08 05:30:06,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 196 places, 697 transitions, 5692 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:06,419 INFO L231 Difference]: Finished difference. Result has 203 places, 535 transitions, 4595 flow [2025-02-08 05:30:06,419 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=2144, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=4595, PETRI_PLACES=203, PETRI_TRANSITIONS=535} [2025-02-08 05:30:06,420 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 52 predicate places. [2025-02-08 05:30:06,420 INFO L471 AbstractCegarLoop]: Abstraction has has 203 places, 535 transitions, 4595 flow [2025-02-08 05:30:06,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.7) internal successors, (1137), 10 states have internal predecessors, (1137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:06,420 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:06,421 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:06,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:30:06,421 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:06,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:06,421 INFO L85 PathProgramCache]: Analyzing trace with hash -977113703, now seen corresponding path program 1 times [2025-02-08 05:30:06,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:06,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327107660] [2025-02-08 05:30:06,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:06,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:06,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 68 statements into 1 equivalence classes. [2025-02-08 05:30:06,438 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 68 of 68 statements. [2025-02-08 05:30:06,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:06,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:06,861 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:06,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:06,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327107660] [2025-02-08 05:30:06,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327107660] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:06,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:06,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:30:06,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3355468] [2025-02-08 05:30:06,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:06,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:30:06,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:06,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:30:06,862 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:30:07,445 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 152 [2025-02-08 05:30:07,446 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 203 places, 535 transitions, 4595 flow. Second operand has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:07,447 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:07,447 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 152 [2025-02-08 05:30:07,447 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:10,311 INFO L124 PetriNetUnfolderBase]: 6443/22042 cut-off events. [2025-02-08 05:30:10,311 INFO L125 PetriNetUnfolderBase]: For 48246/49766 co-relation queries the response was YES. [2025-02-08 05:30:10,426 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75870 conditions, 22042 events. 6443/22042 cut-off events. For 48246/49766 co-relation queries the response was YES. Maximal size of possible extension queue 875. Compared 259757 event pairs, 944 based on Foata normal form. 363/20607 useless extension candidates. Maximal degree in co-relation 71438. Up to 5177 conditions per place. [2025-02-08 05:30:10,632 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 476 selfloop transitions, 38 changer transitions 0/680 dead transitions. [2025-02-08 05:30:10,633 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 680 transitions, 7431 flow [2025-02-08 05:30:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:30:10,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:30:10,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1076 transitions. [2025-02-08 05:30:10,635 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7865497076023392 [2025-02-08 05:30:10,635 INFO L175 Difference]: Start difference. First operand has 203 places, 535 transitions, 4595 flow. Second operand 9 states and 1076 transitions. [2025-02-08 05:30:10,635 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 680 transitions, 7431 flow [2025-02-08 05:30:10,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 208 places, 680 transitions, 7394 flow, removed 17 selfloop flow, removed 2 redundant places. [2025-02-08 05:30:10,791 INFO L231 Difference]: Finished difference. Result has 208 places, 534 transitions, 4638 flow [2025-02-08 05:30:10,791 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4562, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=534, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4638, PETRI_PLACES=208, PETRI_TRANSITIONS=534} [2025-02-08 05:30:10,791 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-02-08 05:30:10,791 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 534 transitions, 4638 flow [2025-02-08 05:30:10,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 113.0) internal successors, (1130), 10 states have internal predecessors, (1130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:10,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:10,792 INFO L206 CegarLoopForPetriNet]: trace histogram [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] [2025-02-08 05:30:10,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-08 05:30:10,792 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:10,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:10,793 INFO L85 PathProgramCache]: Analyzing trace with hash 964399959, now seen corresponding path program 1 times [2025-02-08 05:30:10,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:10,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834986234] [2025-02-08 05:30:10,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:10,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:10,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 69 statements into 1 equivalence classes. [2025-02-08 05:30:10,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 69 of 69 statements. [2025-02-08 05:30:10,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:10,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:11,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-02-08 05:30:11,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:11,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834986234] [2025-02-08 05:30:11,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834986234] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:11,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:11,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-08 05:30:11,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373886646] [2025-02-08 05:30:11,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:11,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:30:11,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:11,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:30:11,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:30:11,659 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 152 [2025-02-08 05:30:11,660 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 534 transitions, 4638 flow. Second operand has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:11,660 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:11,660 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 152 [2025-02-08 05:30:11,660 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:14,748 INFO L124 PetriNetUnfolderBase]: 6833/22454 cut-off events. [2025-02-08 05:30:14,748 INFO L125 PetriNetUnfolderBase]: For 53949/55284 co-relation queries the response was YES. [2025-02-08 05:30:14,823 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80174 conditions, 22454 events. 6833/22454 cut-off events. For 53949/55284 co-relation queries the response was YES. Maximal size of possible extension queue 872. Compared 261055 event pairs, 1112 based on Foata normal form. 287/20931 useless extension candidates. Maximal degree in co-relation 75918. Up to 6626 conditions per place. [2025-02-08 05:30:14,886 INFO L140 encePairwiseOnDemand]: 142/152 looper letters, 500 selfloop transitions, 36 changer transitions 0/679 dead transitions. [2025-02-08 05:30:14,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 215 places, 679 transitions, 7510 flow [2025-02-08 05:30:14,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:30:14,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:30:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1028 transitions. [2025-02-08 05:30:14,888 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7514619883040936 [2025-02-08 05:30:14,888 INFO L175 Difference]: Start difference. First operand has 208 places, 534 transitions, 4638 flow. Second operand 9 states and 1028 transitions. [2025-02-08 05:30:14,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 215 places, 679 transitions, 7510 flow [2025-02-08 05:30:15,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 679 transitions, 7434 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:30:15,056 INFO L231 Difference]: Finished difference. Result has 207 places, 533 transitions, 4630 flow [2025-02-08 05:30:15,056 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=36, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=497, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=4630, PETRI_PLACES=207, PETRI_TRANSITIONS=533} [2025-02-08 05:30:15,057 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 56 predicate places. [2025-02-08 05:30:15,057 INFO L471 AbstractCegarLoop]: Abstraction has has 207 places, 533 transitions, 4630 flow [2025-02-08 05:30:15,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 107.1) internal successors, (1071), 10 states have internal predecessors, (1071), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:15,057 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:15,057 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:15,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 05:30:15,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:15,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:15,058 INFO L85 PathProgramCache]: Analyzing trace with hash -799149325, now seen corresponding path program 1 times [2025-02-08 05:30:15,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:15,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [813589075] [2025-02-08 05:30:15,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:15,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:15,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-02-08 05:30:15,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-02-08 05:30:15,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:15,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:15,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:15,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [813589075] [2025-02-08 05:30:15,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [813589075] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:15,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:15,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:15,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303652641] [2025-02-08 05:30:15,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:15,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:15,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:15,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:15,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:15,325 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 152 [2025-02-08 05:30:15,326 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 207 places, 533 transitions, 4630 flow. Second operand has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:15,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:15,326 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 152 [2025-02-08 05:30:15,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:18,495 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][213], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), 15#L695-4true, 264#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 162#true, 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-02-08 05:30:18,495 INFO L294 olderBase$Statistics]: this new event has 109 ancestors and is not cut-off event [2025-02-08 05:30:18,495 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-02-08 05:30:18,495 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-02-08 05:30:18,495 INFO L297 olderBase$Statistics]: existing Event has 109 ancestors and is not cut-off event [2025-02-08 05:30:19,539 INFO L124 PetriNetUnfolderBase]: 11929/32731 cut-off events. [2025-02-08 05:30:19,539 INFO L125 PetriNetUnfolderBase]: For 85228/86546 co-relation queries the response was YES. [2025-02-08 05:30:19,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119448 conditions, 32731 events. 11929/32731 cut-off events. For 85228/86546 co-relation queries the response was YES. Maximal size of possible extension queue 1399. Compared 371409 event pairs, 1384 based on Foata normal form. 29/30628 useless extension candidates. Maximal degree in co-relation 113172. Up to 14386 conditions per place. [2025-02-08 05:30:19,794 INFO L140 encePairwiseOnDemand]: 129/152 looper letters, 367 selfloop transitions, 354 changer transitions 0/890 dead transitions. [2025-02-08 05:30:19,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 212 places, 890 transitions, 9346 flow [2025-02-08 05:30:19,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:19,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:19,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 824 transitions. [2025-02-08 05:30:19,797 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9035087719298246 [2025-02-08 05:30:19,797 INFO L175 Difference]: Start difference. First operand has 207 places, 533 transitions, 4630 flow. Second operand 6 states and 824 transitions. [2025-02-08 05:30:19,797 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 212 places, 890 transitions, 9346 flow [2025-02-08 05:30:20,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 204 places, 890 transitions, 9126 flow, removed 0 selfloop flow, removed 8 redundant places. [2025-02-08 05:30:20,086 INFO L231 Difference]: Finished difference. Result has 208 places, 821 transitions, 8451 flow [2025-02-08 05:30:20,087 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=4558, PETRI_DIFFERENCE_MINUEND_PLACES=199, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=533, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=121, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=308, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=8451, PETRI_PLACES=208, PETRI_TRANSITIONS=821} [2025-02-08 05:30:20,087 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 57 predicate places. [2025-02-08 05:30:20,088 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 821 transitions, 8451 flow [2025-02-08 05:30:20,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.33333333333333) internal successors, (722), 6 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:20,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:20,089 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:20,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 05:30:20,089 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thrErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:20,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:20,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1952667591, now seen corresponding path program 1 times [2025-02-08 05:30:20,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:20,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344537419] [2025-02-08 05:30:20,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:20,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:20,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 05:30:20,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 05:30:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:20,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:20,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:20,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344537419] [2025-02-08 05:30:20,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344537419] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:20,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:20,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013148342] [2025-02-08 05:30:20,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:20,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:20,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:20,140 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:20,140 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:20,156 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 152 [2025-02-08 05:30:20,157 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 821 transitions, 8451 flow. Second operand has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:20,157 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:20,157 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 152 [2025-02-08 05:30:20,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:23,327 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][217], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, 283#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 173#true, Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true, 55#L695-2true]) [2025-02-08 05:30:23,328 INFO L294 olderBase$Statistics]: this new event has 111 ancestors and is cut-off event [2025-02-08 05:30:23,328 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:30:23,328 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:30:23,328 INFO L297 olderBase$Statistics]: existing Event has 111 ancestors and is cut-off event [2025-02-08 05:30:23,421 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] thrEXIT-->L706: Formula: (= |v_ULTIMATE.start_main_#t~mem10#1_8| v_thrThread1of2ForFork0_thidvar0_4) InVars {thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} OutVars{thrThread1of2ForFork0_thidvar0=v_thrThread1of2ForFork0_thidvar0_4, ULTIMATE.start_main_#t~mem10#1=|v_ULTIMATE.start_main_#t~mem10#1_8|} AuxVars[] AssignedVars[][782], [Black: 190#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0), Black: 192#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 191#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), Black: 188#true, Black: 201#(= |thrThread1of2ForFork0_#t~nondet4| |#race~x~0|), 152#true, 273#true, 156#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 278#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 277#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 276#(and (= |thrThread2of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset| 1))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|)), Black: 275#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread2of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread2of2ForFork0_#t~nondet3|), 285#(= |thrThread2of2ForFork0_#t~nondet4| |#race~x~0|), Black: 154#true, 120#L706true, Black: 158#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= |ULTIMATE.start_main_~n~0#1| 0)), Black: 225#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 221#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 207#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|)), 193#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) 0) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) 0)), 162#true, Black: 219#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 223#(and (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|) (= (select |#valid| 3) 1) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| 3) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 217#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3)) (= (select (select |#race| 3) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|)), 80#L695-1true, Black: 164#(= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|), Black: 165#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 149#true, Black: 166#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), Black: 167#(and (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 2 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ 3 |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4))) |ULTIMATE.start_main_#t~nondet7#1|) (= (select (select |#race| |ULTIMATE.start_main_~#t~1#1.base|) (+ |ULTIMATE.start_main_~#t~1#1.offset| (* |ULTIMATE.start_main_~i~0#1| 4) 1)) |ULTIMATE.start_main_#t~nondet7#1|)), 215#(and (= (select |#valid| 3) 1) (= 3 |~#a~0.base|) (not (= |ULTIMATE.start_main_~#t~1#1.base| 3))), Black: 175#(= |#race~x~0| 0), Black: 183#(and (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 3 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 182#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= |thrThread1of2ForFork0_#t~nondet3| (select (select |#race| |~#a~0.base|) (+ 2 (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|))) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 181#(and (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|) (= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset| 1)) |thrThread1of2ForFork0_#t~nondet3|)), Black: 180#(= (select (select |#race| |~#a~0.base|) (+ (* thrThread1of2ForFork0_~t~0 4) |~#a~0.offset|)) |thrThread1of2ForFork0_#t~nondet3|), 178#true]) [2025-02-08 05:30:23,422 INFO L294 olderBase$Statistics]: this new event has 113 ancestors and is cut-off event [2025-02-08 05:30:23,422 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:30:23,422 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:30:23,422 INFO L297 olderBase$Statistics]: existing Event has 113 ancestors and is cut-off event [2025-02-08 05:30:24,241 INFO L124 PetriNetUnfolderBase]: 10379/30619 cut-off events. [2025-02-08 05:30:24,242 INFO L125 PetriNetUnfolderBase]: For 86758/88512 co-relation queries the response was YES. [2025-02-08 05:30:24,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 115214 conditions, 30619 events. 10379/30619 cut-off events. For 86758/88512 co-relation queries the response was YES. Maximal size of possible extension queue 1486. Compared 360619 event pairs, 744 based on Foata normal form. 72/29750 useless extension candidates. Maximal degree in co-relation 109283. Up to 7301 conditions per place. [2025-02-08 05:30:24,438 INFO L140 encePairwiseOnDemand]: 146/152 looper letters, 16 selfloop transitions, 9 changer transitions 0/827 dead transitions. [2025-02-08 05:30:24,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 210 places, 827 transitions, 8526 flow [2025-02-08 05:30:24,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:24,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:24,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 426 transitions. [2025-02-08 05:30:24,444 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9342105263157895 [2025-02-08 05:30:24,444 INFO L175 Difference]: Start difference. First operand has 208 places, 821 transitions, 8451 flow. Second operand 3 states and 426 transitions. [2025-02-08 05:30:24,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 210 places, 827 transitions, 8526 flow [2025-02-08 05:30:24,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 210 places, 827 transitions, 8442 flow, removed 42 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:24,978 INFO L231 Difference]: Finished difference. Result has 212 places, 826 transitions, 8435 flow [2025-02-08 05:30:24,978 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=152, PETRI_DIFFERENCE_MINUEND_FLOW=8367, PETRI_DIFFERENCE_MINUEND_PLACES=208, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=821, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=812, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=8435, PETRI_PLACES=212, PETRI_TRANSITIONS=826} [2025-02-08 05:30:24,979 INFO L279 CegarLoopForPetriNet]: 151 programPoint places, 61 predicate places. [2025-02-08 05:30:24,979 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 826 transitions, 8435 flow [2025-02-08 05:30:24,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 138.0) internal successors, (414), 3 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:24,979 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:24,979 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:24,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-08 05:30:24,979 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2025-02-08 05:30:24,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:24,980 INFO L85 PathProgramCache]: Analyzing trace with hash -272088769, now seen corresponding path program 1 times [2025-02-08 05:30:24,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:24,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909734435] [2025-02-08 05:30:24,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:24,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:24,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:30:25,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:30:25,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:25,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:25,001 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-08 05:30:25,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-02-08 05:30:25,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-02-08 05:30:25,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:25,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-08 05:30:25,024 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-08 05:30:25,024 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-08 05:30:25,024 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 13 remaining) [2025-02-08 05:30:25,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2025-02-08 05:30:25,024 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2025-02-08 05:30:25,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2025-02-08 05:30:25,028 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (5 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr1ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2025-02-08 05:30:25,029 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thrErr0ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2025-02-08 05:30:25,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-08 05:30:25,029 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:25,029 WARN L246 ceAbstractionStarter]: 2 thread instances were not sufficient, I will increase this number and restart the analysis [2025-02-08 05:30:25,029 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 3 thread instances. [2025-02-08 05:30:25,049 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-02-08 05:30:25,053 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 175 places, 175 transitions, 377 flow [2025-02-08 05:30:25,081 INFO L124 PetriNetUnfolderBase]: 33/574 cut-off events. [2025-02-08 05:30:25,081 INFO L125 PetriNetUnfolderBase]: For 19/21 co-relation queries the response was YES. [2025-02-08 05:30:25,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 599 conditions, 574 events. 33/574 cut-off events. For 19/21 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1972 event pairs, 1 based on Foata normal form. 0/508 useless extension candidates. Maximal degree in co-relation 337. Up to 16 conditions per place. [2025-02-08 05:30:25,082 INFO L82 GeneralOperation]: Start removeDead. Operand has 175 places, 175 transitions, 377 flow [2025-02-08 05:30:25,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 175 places, 175 transitions, 377 flow [2025-02-08 05:30:25,085 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:30:25,085 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@5e18efd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:30:25,085 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-02-08 05:30:25,087 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:30:25,087 INFO L124 PetriNetUnfolderBase]: 1/64 cut-off events. [2025-02-08 05:30:25,087 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:30:25,087 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:25,087 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:25,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:25,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 942890658, now seen corresponding path program 1 times [2025-02-08 05:30:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:25,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891471908] [2025-02-08 05:30:25,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:25,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:25,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 05:30:25,094 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 05:30:25,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:25,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:25,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:25,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:25,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891471908] [2025-02-08 05:30:25,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891471908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:25,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:25,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:25,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948089100] [2025-02-08 05:30:25,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:25,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 05:30:25,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:25,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 05:30:25,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-08 05:30:25,204 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 149 out of 175 [2025-02-08 05:30:25,205 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 175 places, 175 transitions, 377 flow. Second operand has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:25,205 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:25,205 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 149 of 175 [2025-02-08 05:30:25,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:25,375 INFO L124 PetriNetUnfolderBase]: 25/757 cut-off events. [2025-02-08 05:30:25,375 INFO L125 PetriNetUnfolderBase]: For 58/86 co-relation queries the response was YES. [2025-02-08 05:30:25,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 926 conditions, 757 events. 25/757 cut-off events. For 58/86 co-relation queries the response was YES. Maximal size of possible extension queue 19. Compared 3340 event pairs, 0 based on Foata normal form. 37/713 useless extension candidates. Maximal degree in co-relation 480. Up to 91 conditions per place. [2025-02-08 05:30:25,377 INFO L140 encePairwiseOnDemand]: 160/175 looper letters, 27 selfloop transitions, 9 changer transitions 4/187 dead transitions. [2025-02-08 05:30:25,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 187 transitions, 488 flow [2025-02-08 05:30:25,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 05:30:25,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-02-08 05:30:25,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 642 transitions. [2025-02-08 05:30:25,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9171428571428571 [2025-02-08 05:30:25,378 INFO L175 Difference]: Start difference. First operand has 175 places, 175 transitions, 377 flow. Second operand 4 states and 642 transitions. [2025-02-08 05:30:25,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 187 transitions, 488 flow [2025-02-08 05:30:25,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 187 transitions, 488 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:25,380 INFO L231 Difference]: Finished difference. Result has 179 places, 176 transitions, 435 flow [2025-02-08 05:30:25,380 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=170, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=161, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=435, PETRI_PLACES=179, PETRI_TRANSITIONS=176} [2025-02-08 05:30:25,380 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 4 predicate places. [2025-02-08 05:30:25,380 INFO L471 AbstractCegarLoop]: Abstraction has has 179 places, 176 transitions, 435 flow [2025-02-08 05:30:25,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 150.4) internal successors, (752), 5 states have internal predecessors, (752), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:25,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:25,381 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:25,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 05:30:25,381 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:25,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:25,381 INFO L85 PathProgramCache]: Analyzing trace with hash 1824158773, now seen corresponding path program 1 times [2025-02-08 05:30:25,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:25,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812104833] [2025-02-08 05:30:25,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:25,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:25,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-02-08 05:30:25,390 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-02-08 05:30:25,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:25,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:25,489 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:25,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:25,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812104833] [2025-02-08 05:30:25,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812104833] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:25,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:25,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:25,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136375042] [2025-02-08 05:30:25,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:25,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:25,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:25,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:25,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:25,623 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 175 [2025-02-08 05:30:25,624 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 176 transitions, 435 flow. Second operand has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:25,624 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:25,624 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 175 [2025-02-08 05:30:25,624 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:28,037 INFO L124 PetriNetUnfolderBase]: 10841/30705 cut-off events. [2025-02-08 05:30:28,037 INFO L125 PetriNetUnfolderBase]: For 3370/3494 co-relation queries the response was YES. [2025-02-08 05:30:28,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 49795 conditions, 30705 events. 10841/30705 cut-off events. For 3370/3494 co-relation queries the response was YES. Maximal size of possible extension queue 934. Compared 345789 event pairs, 8007 based on Foata normal form. 0/27748 useless extension candidates. Maximal degree in co-relation 21955. Up to 15381 conditions per place. [2025-02-08 05:30:28,178 INFO L140 encePairwiseOnDemand]: 156/175 looper letters, 52 selfloop transitions, 54 changer transitions 0/231 dead transitions. [2025-02-08 05:30:28,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 231 transitions, 769 flow [2025-02-08 05:30:28,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:30:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:30:28,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 852 transitions. [2025-02-08 05:30:28,180 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8114285714285714 [2025-02-08 05:30:28,180 INFO L175 Difference]: Start difference. First operand has 179 places, 176 transitions, 435 flow. Second operand 6 states and 852 transitions. [2025-02-08 05:30:28,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 231 transitions, 769 flow [2025-02-08 05:30:28,184 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 183 places, 231 transitions, 767 flow, removed 1 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:28,185 INFO L231 Difference]: Finished difference. Result has 188 places, 229 transitions, 791 flow [2025-02-08 05:30:28,186 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=433, PETRI_DIFFERENCE_MINUEND_PLACES=178, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=176, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=791, PETRI_PLACES=188, PETRI_TRANSITIONS=229} [2025-02-08 05:30:28,186 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 13 predicate places. [2025-02-08 05:30:28,186 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 229 transitions, 791 flow [2025-02-08 05:30:28,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:28,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:28,187 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:28,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-08 05:30:28,187 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting thrErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:28,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:28,187 INFO L85 PathProgramCache]: Analyzing trace with hash -429026154, now seen corresponding path program 1 times [2025-02-08 05:30:28,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:28,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715170307] [2025-02-08 05:30:28,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:28,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:28,192 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 05:30:28,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 05:30:28,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:28,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715170307] [2025-02-08 05:30:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715170307] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 05:30:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928051527] [2025-02-08 05:30:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:30:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:28,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:30:28,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:30:28,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 175 [2025-02-08 05:30:28,222 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 229 transitions, 791 flow. Second operand has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:28,222 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:28,222 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 175 [2025-02-08 05:30:28,222 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:30:31,517 INFO L124 PetriNetUnfolderBase]: 9552/38538 cut-off events. [2025-02-08 05:30:31,517 INFO L125 PetriNetUnfolderBase]: For 7584/7994 co-relation queries the response was YES. [2025-02-08 05:30:31,627 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65206 conditions, 38538 events. 9552/38538 cut-off events. For 7584/7994 co-relation queries the response was YES. Maximal size of possible extension queue 1294. Compared 517301 event pairs, 2680 based on Foata normal form. 1/34841 useless extension candidates. Maximal degree in co-relation 54593. Up to 9627 conditions per place. [2025-02-08 05:30:31,732 INFO L140 encePairwiseOnDemand]: 163/175 looper letters, 23 selfloop transitions, 9 changer transitions 0/243 dead transitions. [2025-02-08 05:30:31,733 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 190 places, 243 transitions, 904 flow [2025-02-08 05:30:31,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:30:31,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:30:31,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 494 transitions. [2025-02-08 05:30:31,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.940952380952381 [2025-02-08 05:30:31,734 INFO L175 Difference]: Start difference. First operand has 188 places, 229 transitions, 791 flow. Second operand 3 states and 494 transitions. [2025-02-08 05:30:31,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 190 places, 243 transitions, 904 flow [2025-02-08 05:30:31,790 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 243 transitions, 904 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:30:31,792 INFO L231 Difference]: Finished difference. Result has 192 places, 238 transitions, 869 flow [2025-02-08 05:30:31,792 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=175, PETRI_DIFFERENCE_MINUEND_FLOW=791, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=229, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=220, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=869, PETRI_PLACES=192, PETRI_TRANSITIONS=238} [2025-02-08 05:30:31,792 INFO L279 CegarLoopForPetriNet]: 175 programPoint places, 17 predicate places. [2025-02-08 05:30:31,792 INFO L471 AbstractCegarLoop]: Abstraction has has 192 places, 238 transitions, 869 flow [2025-02-08 05:30:31,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:31,792 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:30:31,793 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:30:31,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-08 05:30:31,793 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thrErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2025-02-08 05:30:31,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:30:31,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1579757926, now seen corresponding path program 1 times [2025-02-08 05:30:31,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:30:31,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83097688] [2025-02-08 05:30:31,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:30:31,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:30:31,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 05:30:31,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 05:30:31,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:30:31,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:30:31,932 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:30:31,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:30:31,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83097688] [2025-02-08 05:30:31,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83097688] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:30:31,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:30:31,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:30:31,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866335896] [2025-02-08 05:30:31,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:30:31,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:30:31,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:30:31,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:30:31,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:30:32,167 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 175 [2025-02-08 05:30:32,168 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 192 places, 238 transitions, 869 flow. Second operand has 6 states, 6 states have (on average 137.16666666666666) internal successors, (823), 6 states have internal predecessors, (823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:30:32,168 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:30:32,168 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 175 [2025-02-08 05:30:32,168 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand