./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.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 bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:28:03,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:28:03,320 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-01-09 21:28:03,326 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:28:03,327 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:28:03,348 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:28:03,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:28:03,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:28:03,349 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:28:03,349 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:28:03,350 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:28:03,350 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:28:03,350 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:28:03,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:28:03,351 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:28:03,351 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:03,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:03,352 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:28:03,352 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:28:03,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:28:03,353 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 -> bde6fe221f69c3fccb0f7c90e011f0b13ab5ca582ddcd328a459cbb512a8fd7f [2025-01-09 21:28:03,571 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:28:03,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:28:03,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:28:03,579 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:28:03,580 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:28:03,580 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-01-09 21:28:04,777 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3540be85a/99eb94efc80243deb4a06a0832dbb986/FLAG7f5e29665 [2025-01-09 21:28:05,120 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:28:05,120 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/28-race_reach_71-funloop_racing.i [2025-01-09 21:28:05,131 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3540be85a/99eb94efc80243deb4a06a0832dbb986/FLAG7f5e29665 [2025-01-09 21:28:05,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3540be85a/99eb94efc80243deb4a06a0832dbb986 [2025-01-09 21:28:05,345 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:28:05,346 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:28:05,347 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:05,347 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:28:05,350 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:28:05,351 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,352 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@756e6a64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05, skipping insertion in model container [2025-01-09 21:28:05,352 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,373 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:28:05,667 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:05,706 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:28:05,773 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:28:05,831 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:28:05,832 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05 WrapperNode [2025-01-09 21:28:05,832 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:28:05,833 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:05,833 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:28:05,833 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:28:05,837 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,860 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,887 INFO L138 Inliner]: procedures = 272, calls = 108, calls flagged for inlining = 7, calls inlined = 10, statements flattened = 412 [2025-01-09 21:28:05,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:28:05,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:28:05,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:28:05,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:28:05,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,936 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,948 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,949 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,956 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:28:05,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:28:05,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:28:05,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:28:05,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (1/1) ... [2025-01-09 21:28:05,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:28:05,984 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:06,004 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 21:28:06,014 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 21:28:06,034 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:28:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:28:06,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:28:06,035 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:28:06,036 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-09 21:28:06,145 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:28:06,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:28:06,674 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:28:06,674 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:28:06,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:28:06,719 INFO L312 CfgBuilder]: Removed 15 assume(true) statements. [2025-01-09 21:28:06,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:06 BoogieIcfgContainer [2025-01-09 21:28:06,720 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:28:06,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:28:06,724 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:28:06,729 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:28:06,730 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:28:05" (1/3) ... [2025-01-09 21:28:06,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39864f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:06, skipping insertion in model container [2025-01-09 21:28:06,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:28:05" (2/3) ... [2025-01-09 21:28:06,731 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39864f80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:28:06, skipping insertion in model container [2025-01-09 21:28:06,731 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:28:06" (3/3) ... [2025-01-09 21:28:06,733 INFO L128 eAbstractionObserver]: Analyzing ICFG 28-race_reach_71-funloop_racing.i [2025-01-09 21:28:06,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:28:06,755 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 28-race_reach_71-funloop_racing.i that has 2 procedures, 397 locations, 1 initial locations, 20 loop locations, and 17 error locations. [2025-01-09 21:28:06,756 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:28:06,827 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2025-01-09 21:28:06,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 400 places, 440 transitions, 887 flow [2025-01-09 21:28:07,050 INFO L124 PetriNetUnfolderBase]: 70/671 cut-off events. [2025-01-09 21:28:07,052 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:28:07,066 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 671 events. 70/671 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 3333 event pairs, 0 based on Foata normal form. 0/569 useless extension candidates. Maximal degree in co-relation 346. Up to 8 conditions per place. [2025-01-09 21:28:07,067 INFO L82 GeneralOperation]: Start removeDead. Operand has 400 places, 440 transitions, 887 flow [2025-01-09 21:28:07,095 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 400 places, 440 transitions, 887 flow [2025-01-09 21:28:07,101 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:07,117 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;@1e65eb0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:07,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2025-01-09 21:28:07,151 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:07,154 INFO L124 PetriNetUnfolderBase]: 4/134 cut-off events. [2025-01-09 21:28:07,154 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:07,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:07,155 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:07,159 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:07,167 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:07,168 INFO L85 PathProgramCache]: Analyzing trace with hash 205815042, now seen corresponding path program 1 times [2025-01-09 21:28:07,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:07,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528154407] [2025-01-09 21:28:07,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:07,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:07,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:28:07,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:28:07,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:07,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:07,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:07,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:07,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528154407] [2025-01-09 21:28:07,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528154407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:07,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:07,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:07,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054601505] [2025-01-09 21:28:07,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:07,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:07,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:07,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:07,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:07,564 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 440 [2025-01-09 21:28:07,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 400 places, 440 transitions, 887 flow. Second operand has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:07,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:07,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 440 [2025-01-09 21:28:07,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:07,967 INFO L124 PetriNetUnfolderBase]: 161/2166 cut-off events. [2025-01-09 21:28:07,967 INFO L125 PetriNetUnfolderBase]: For 8/9 co-relation queries the response was YES. [2025-01-09 21:28:07,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2475 conditions, 2166 events. 161/2166 cut-off events. For 8/9 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 17651 event pairs, 120 based on Foata normal form. 320/2301 useless extension candidates. Maximal degree in co-relation 2142. Up to 302 conditions per place. [2025-01-09 21:28:07,979 INFO L140 encePairwiseOnDemand]: 401/440 looper letters, 29 selfloop transitions, 2 changer transitions 0/399 dead transitions. [2025-01-09 21:28:07,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 396 places, 399 transitions, 867 flow [2025-01-09 21:28:07,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:07,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:07,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1181 transitions. [2025-01-09 21:28:07,994 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8946969696969697 [2025-01-09 21:28:07,995 INFO L175 Difference]: Start difference. First operand has 400 places, 440 transitions, 887 flow. Second operand 3 states and 1181 transitions. [2025-01-09 21:28:07,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 396 places, 399 transitions, 867 flow [2025-01-09 21:28:08,003 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 396 places, 399 transitions, 867 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:08,009 INFO L231 Difference]: Finished difference. Result has 397 places, 399 transitions, 815 flow [2025-01-09 21:28:08,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=803, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=398, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=396, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=815, PETRI_PLACES=397, PETRI_TRANSITIONS=399} [2025-01-09 21:28:08,014 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, -3 predicate places. [2025-01-09 21:28:08,014 INFO L471 AbstractCegarLoop]: Abstraction has has 397 places, 399 transitions, 815 flow [2025-01-09 21:28:08,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.3333333333333) internal successors, (1117), 3 states have internal predecessors, (1117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:08,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:08,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:08,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:28:08,015 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:08,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:08,018 INFO L85 PathProgramCache]: Analyzing trace with hash -895172769, now seen corresponding path program 1 times [2025-01-09 21:28:08,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:08,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113869554] [2025-01-09 21:28:08,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:08,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:08,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:28:08,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:28:08,055 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:08,055 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:08,236 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:08,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113869554] [2025-01-09 21:28:08,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113869554] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:08,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474525320] [2025-01-09 21:28:08,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:08,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:08,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:08,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:28:08,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 21:28:08,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:28:08,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:28:08,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:08,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:08,358 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:28:08,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:08,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:08,400 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:08,429 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:08,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474525320] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:08,430 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:08,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:28:08,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062164924] [2025-01-09 21:28:08,430 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:08,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:28:08,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:08,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:28:08,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:28:08,456 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 440 [2025-01-09 21:28:08,460 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 397 places, 399 transitions, 815 flow. Second operand has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:08,460 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:08,460 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 440 [2025-01-09 21:28:08,460 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:08,830 INFO L124 PetriNetUnfolderBase]: 161/2173 cut-off events. [2025-01-09 21:28:08,831 INFO L125 PetriNetUnfolderBase]: For 9/10 co-relation queries the response was YES. [2025-01-09 21:28:08,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2501 conditions, 2173 events. 161/2173 cut-off events. For 9/10 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 17452 event pairs, 120 based on Foata normal form. 2/1990 useless extension candidates. Maximal degree in co-relation 2406. Up to 302 conditions per place. [2025-01-09 21:28:08,839 INFO L140 encePairwiseOnDemand]: 434/440 looper letters, 33 selfloop transitions, 9 changer transitions 0/407 dead transitions. [2025-01-09 21:28:08,839 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 405 places, 407 transitions, 917 flow [2025-01-09 21:28:08,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:28:08,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:28:08,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 3356 transitions. [2025-01-09 21:28:08,844 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8474747474747475 [2025-01-09 21:28:08,844 INFO L175 Difference]: Start difference. First operand has 397 places, 399 transitions, 815 flow. Second operand 9 states and 3356 transitions. [2025-01-09 21:28:08,844 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 405 places, 407 transitions, 917 flow [2025-01-09 21:28:08,846 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 404 places, 407 transitions, 915 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:08,849 INFO L231 Difference]: Finished difference. Result has 407 places, 405 transitions, 863 flow [2025-01-09 21:28:08,850 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=813, PETRI_DIFFERENCE_MINUEND_PLACES=396, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=399, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=393, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=863, PETRI_PLACES=407, PETRI_TRANSITIONS=405} [2025-01-09 21:28:08,850 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, 7 predicate places. [2025-01-09 21:28:08,850 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 405 transitions, 863 flow [2025-01-09 21:28:08,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 369.8) internal successors, (3698), 10 states have internal predecessors, (3698), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:08,852 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:08,853 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:08,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 21:28:09,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:09,058 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:09,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:09,062 INFO L85 PathProgramCache]: Analyzing trace with hash -1705303745, now seen corresponding path program 2 times [2025-01-09 21:28:09,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:09,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [334702780] [2025-01-09 21:28:09,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:09,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:09,084 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-01-09 21:28:09,105 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-01-09 21:28:09,109 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:28:09,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:09,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:09,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [334702780] [2025-01-09 21:28:09,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [334702780] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:09,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:09,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:09,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349747331] [2025-01-09 21:28:09,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:09,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:09,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:09,649 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:09,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:10,018 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 299 out of 440 [2025-01-09 21:28:10,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 405 transitions, 863 flow. Second operand has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:10,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:10,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 299 of 440 [2025-01-09 21:28:10,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:11,370 INFO L124 PetriNetUnfolderBase]: 2280/9070 cut-off events. [2025-01-09 21:28:11,370 INFO L125 PetriNetUnfolderBase]: For 14/17 co-relation queries the response was YES. [2025-01-09 21:28:11,384 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13562 conditions, 9070 events. 2280/9070 cut-off events. For 14/17 co-relation queries the response was YES. Maximal size of possible extension queue 221. Compared 92208 event pairs, 1582 based on Foata normal form. 0/8280 useless extension candidates. Maximal degree in co-relation 13438. Up to 4230 conditions per place. [2025-01-09 21:28:11,408 INFO L140 encePairwiseOnDemand]: 413/440 looper letters, 133 selfloop transitions, 86 changer transitions 0/522 dead transitions. [2025-01-09 21:28:11,409 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 412 places, 522 transitions, 1535 flow [2025-01-09 21:28:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:28:11,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:28:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2014 transitions. [2025-01-09 21:28:11,412 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7628787878787879 [2025-01-09 21:28:11,414 INFO L175 Difference]: Start difference. First operand has 407 places, 405 transitions, 863 flow. Second operand 6 states and 2014 transitions. [2025-01-09 21:28:11,414 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 412 places, 522 transitions, 1535 flow [2025-01-09 21:28:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 411 places, 522 transitions, 1529 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:11,426 INFO L231 Difference]: Finished difference. Result has 416 places, 490 transitions, 1423 flow [2025-01-09 21:28:11,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=857, PETRI_DIFFERENCE_MINUEND_PLACES=406, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1423, PETRI_PLACES=416, PETRI_TRANSITIONS=490} [2025-01-09 21:28:11,428 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, 16 predicate places. [2025-01-09 21:28:11,428 INFO L471 AbstractCegarLoop]: Abstraction has has 416 places, 490 transitions, 1423 flow [2025-01-09 21:28:11,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 300.5) internal successors, (1803), 6 states have internal predecessors, (1803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:11,430 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:11,430 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:11,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:28:11,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:11,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1581337105, now seen corresponding path program 1 times [2025-01-09 21:28:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:11,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86906325] [2025-01-09 21:28:11,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:11,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:11,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 21:28:11,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 21:28:11,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:11,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:11,515 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:11,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:11,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86906325] [2025-01-09 21:28:11,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86906325] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:11,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:11,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:11,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440259415] [2025-01-09 21:28:11,517 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:11,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:11,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:11,518 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:11,518 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:11,539 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 371 out of 440 [2025-01-09 21:28:11,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 416 places, 490 transitions, 1423 flow. Second operand has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:11,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:11,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 371 of 440 [2025-01-09 21:28:11,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:11,923 INFO L124 PetriNetUnfolderBase]: 361/3010 cut-off events. [2025-01-09 21:28:11,923 INFO L125 PetriNetUnfolderBase]: For 158/180 co-relation queries the response was YES. [2025-01-09 21:28:11,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4072 conditions, 3010 events. 361/3010 cut-off events. For 158/180 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 26731 event pairs, 136 based on Foata normal form. 1/2764 useless extension candidates. Maximal degree in co-relation 3946. Up to 374 conditions per place. [2025-01-09 21:28:11,937 INFO L140 encePairwiseOnDemand]: 437/440 looper letters, 36 selfloop transitions, 3 changer transitions 0/498 dead transitions. [2025-01-09 21:28:11,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 418 places, 498 transitions, 1517 flow [2025-01-09 21:28:11,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:11,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:11,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1152 transitions. [2025-01-09 21:28:11,940 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8727272727272727 [2025-01-09 21:28:11,940 INFO L175 Difference]: Start difference. First operand has 416 places, 490 transitions, 1423 flow. Second operand 3 states and 1152 transitions. [2025-01-09 21:28:11,940 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 418 places, 498 transitions, 1517 flow [2025-01-09 21:28:11,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 498 transitions, 1517 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:11,948 INFO L231 Difference]: Finished difference. Result has 419 places, 490 transitions, 1434 flow [2025-01-09 21:28:11,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1423, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=487, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1434, PETRI_PLACES=419, PETRI_TRANSITIONS=490} [2025-01-09 21:28:11,949 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, 19 predicate places. [2025-01-09 21:28:11,949 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 490 transitions, 1434 flow [2025-01-09 21:28:11,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 372.6666666666667) internal successors, (1118), 3 states have internal predecessors, (1118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:11,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:11,950 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:11,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:28:11,950 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:11,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:11,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1508283742, now seen corresponding path program 1 times [2025-01-09 21:28:11,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:11,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24001735] [2025-01-09 21:28:11,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:11,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:11,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:28:11,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:28:11,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:11,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24001735] [2025-01-09 21:28:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24001735] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:12,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040637354] [2025-01-09 21:28:12,220 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:12,220 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:12,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:12,225 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:28:12,226 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 21:28:12,288 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 21:28:12,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 21:28:12,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:12,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:12,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:28:12,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:12,376 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:12,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:12,470 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:12,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040637354] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:12,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:12,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:28:12,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582941027] [2025-01-09 21:28:12,473 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:12,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:28:12,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:12,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:28:12,475 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:28:12,508 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 440 [2025-01-09 21:28:12,514 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 490 transitions, 1434 flow. Second operand has 18 states, 18 states have (on average 369.94444444444446) internal successors, (6659), 18 states have internal predecessors, (6659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:12,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:12,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 440 [2025-01-09 21:28:12,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:13,094 INFO L124 PetriNetUnfolderBase]: 346/2928 cut-off events. [2025-01-09 21:28:13,095 INFO L125 PetriNetUnfolderBase]: For 157/184 co-relation queries the response was YES. [2025-01-09 21:28:13,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4339 conditions, 2928 events. 346/2928 cut-off events. For 157/184 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 25679 event pairs, 120 based on Foata normal form. 4/2709 useless extension candidates. Maximal degree in co-relation 4137. Up to 556 conditions per place. [2025-01-09 21:28:13,114 INFO L140 encePairwiseOnDemand]: 434/440 looper letters, 37 selfloop transitions, 21 changer transitions 0/508 dead transitions. [2025-01-09 21:28:13,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 439 places, 508 transitions, 1638 flow [2025-01-09 21:28:13,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:28:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:28:13,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 7790 transitions. [2025-01-09 21:28:13,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8430735930735931 [2025-01-09 21:28:13,127 INFO L175 Difference]: Start difference. First operand has 419 places, 490 transitions, 1434 flow. Second operand 21 states and 7790 transitions. [2025-01-09 21:28:13,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 439 places, 508 transitions, 1638 flow [2025-01-09 21:28:13,131 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 437 places, 508 transitions, 1632 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-01-09 21:28:13,135 INFO L231 Difference]: Finished difference. Result has 442 places, 503 transitions, 1558 flow [2025-01-09 21:28:13,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1428, PETRI_DIFFERENCE_MINUEND_PLACES=417, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=490, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=479, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1558, PETRI_PLACES=442, PETRI_TRANSITIONS=503} [2025-01-09 21:28:13,137 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, 42 predicate places. [2025-01-09 21:28:13,137 INFO L471 AbstractCegarLoop]: Abstraction has has 442 places, 503 transitions, 1558 flow [2025-01-09 21:28:13,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 369.94444444444446) internal successors, (6659), 18 states have internal predecessors, (6659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:13,140 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:13,140 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:13,149 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 21:28:13,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:13,344 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:13,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:13,345 INFO L85 PathProgramCache]: Analyzing trace with hash 164585886, now seen corresponding path program 2 times [2025-01-09 21:28:13,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:13,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445629590] [2025-01-09 21:28:13,345 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:13,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:13,358 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-01-09 21:28:13,370 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:28:13,371 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:28:13,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:13,644 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:13,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445629590] [2025-01-09 21:28:13,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445629590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:13,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53423368] [2025-01-09 21:28:13,645 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:13,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:13,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:13,647 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:28:13,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 21:28:13,702 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 143 statements into 2 equivalence classes. [2025-01-09 21:28:13,744 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 21:28:13,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 21:28:13,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:13,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:28:13,748 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:13,925 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:13,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:14,113 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:14,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53423368] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:14,114 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:14,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:28:14,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057118081] [2025-01-09 21:28:14,114 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:14,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:28:14,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:14,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:28:14,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:28:14,143 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 368 out of 440 [2025-01-09 21:28:14,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 442 places, 503 transitions, 1558 flow. Second operand has 23 states, 23 states have (on average 370.04347826086956) internal successors, (8511), 23 states have internal predecessors, (8511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:14,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:14,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 368 of 440 [2025-01-09 21:28:14,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:14,738 INFO L124 PetriNetUnfolderBase]: 346/2943 cut-off events. [2025-01-09 21:28:14,738 INFO L125 PetriNetUnfolderBase]: For 258/285 co-relation queries the response was YES. [2025-01-09 21:28:14,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4439 conditions, 2943 events. 346/2943 cut-off events. For 258/285 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 25705 event pairs, 120 based on Foata normal form. 3/2723 useless extension candidates. Maximal degree in co-relation 4137. Up to 556 conditions per place. [2025-01-09 21:28:14,756 INFO L140 encePairwiseOnDemand]: 434/440 looper letters, 40 selfloop transitions, 30 changer transitions 0/520 dead transitions. [2025-01-09 21:28:14,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 471 places, 520 transitions, 1826 flow [2025-01-09 21:28:14,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:28:14,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:28:14,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 11113 transitions. [2025-01-09 21:28:14,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8418939393939394 [2025-01-09 21:28:14,771 INFO L175 Difference]: Start difference. First operand has 442 places, 503 transitions, 1558 flow. Second operand 30 states and 11113 transitions. [2025-01-09 21:28:14,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 471 places, 520 transitions, 1826 flow [2025-01-09 21:28:14,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 465 places, 520 transitions, 1796 flow, removed 9 selfloop flow, removed 6 redundant places. [2025-01-09 21:28:14,783 INFO L231 Difference]: Finished difference. Result has 469 places, 513 transitions, 1686 flow [2025-01-09 21:28:14,783 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=440, PETRI_DIFFERENCE_MINUEND_FLOW=1534, PETRI_DIFFERENCE_MINUEND_PLACES=436, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=503, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=480, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1686, PETRI_PLACES=469, PETRI_TRANSITIONS=513} [2025-01-09 21:28:14,784 INFO L279 CegarLoopForPetriNet]: 400 programPoint places, 69 predicate places. [2025-01-09 21:28:14,784 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 513 transitions, 1686 flow [2025-01-09 21:28:14,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 370.04347826086956) internal successors, (8511), 23 states have internal predecessors, (8511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:14,787 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:14,787 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:14,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 21:28:14,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:14,988 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 20 more)] === [2025-01-09 21:28:14,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:14,989 INFO L85 PathProgramCache]: Analyzing trace with hash -577037157, now seen corresponding path program 3 times [2025-01-09 21:28:14,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:14,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6254079] [2025-01-09 21:28:14,989 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:28:14,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:15,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 158 statements into 11 equivalence classes. [2025-01-09 21:28:15,059 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:28:15,059 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-01-09 21:28:15,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:15,059 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 21:28:15,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 21:28:15,078 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 21:28:15,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:15,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 21:28:15,116 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 21:28:15,116 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 21:28:15,117 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (22 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (21 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (20 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (19 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (18 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (17 of 23 remaining) [2025-01-09 21:28:15,118 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (16 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (15 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (14 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (13 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (12 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (10 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (9 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (8 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (7 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (6 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (5 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4ASSERT_VIOLATIONDATA_RACE (4 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (3 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (1 of 23 remaining) [2025-01-09 21:28:15,119 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3ASSERT_VIOLATIONDATA_RACE (0 of 23 remaining) [2025-01-09 21:28:15,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:28:15,120 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1] [2025-01-09 21:28:15,121 WARN L246 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-01-09 21:28:15,121 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-01-09 21:28:15,166 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-09 21:28:15,171 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 501 places, 554 transitions, 1124 flow [2025-01-09 21:28:15,267 INFO L124 PetriNetUnfolderBase]: 113/1043 cut-off events. [2025-01-09 21:28:15,267 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-01-09 21:28:15,275 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1055 conditions, 1043 events. 113/1043 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6096 event pairs, 0 based on Foata normal form. 0/879 useless extension candidates. Maximal degree in co-relation 673. Up to 12 conditions per place. [2025-01-09 21:28:15,275 INFO L82 GeneralOperation]: Start removeDead. Operand has 501 places, 554 transitions, 1124 flow [2025-01-09 21:28:15,284 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 501 places, 554 transitions, 1124 flow [2025-01-09 21:28:15,285 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:28:15,285 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;@1e65eb0d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:28:15,285 INFO L334 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2025-01-09 21:28:15,291 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:28:15,292 INFO L124 PetriNetUnfolderBase]: 4/134 cut-off events. [2025-01-09 21:28:15,292 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:28:15,292 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:15,292 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:15,292 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:15,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:15,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1291824556, now seen corresponding path program 1 times [2025-01-09 21:28:15,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:15,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938387329] [2025-01-09 21:28:15,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:15,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:15,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 21:28:15,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 21:28:15,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:15,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:15,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:15,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:15,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938387329] [2025-01-09 21:28:15,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938387329] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:15,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:15,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:28:15,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247025896] [2025-01-09 21:28:15,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:15,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:28:15,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:15,328 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:28:15,328 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:28:15,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 462 out of 554 [2025-01-09 21:28:15,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 501 places, 554 transitions, 1124 flow. Second operand has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:15,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:15,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 462 of 554 [2025-01-09 21:28:15,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:17,752 INFO L124 PetriNetUnfolderBase]: 2887/20443 cut-off events. [2025-01-09 21:28:17,753 INFO L125 PetriNetUnfolderBase]: For 151/155 co-relation queries the response was YES. [2025-01-09 21:28:17,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24699 conditions, 20443 events. 2887/20443 cut-off events. For 151/155 co-relation queries the response was YES. Maximal size of possible extension queue 496. Compared 273806 event pairs, 2376 based on Foata normal form. 4355/23099 useless extension candidates. Maximal degree in co-relation 22020. Up to 4183 conditions per place. [2025-01-09 21:28:17,855 INFO L140 encePairwiseOnDemand]: 503/554 looper letters, 39 selfloop transitions, 2 changer transitions 0/499 dead transitions. [2025-01-09 21:28:17,855 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 495 places, 499 transitions, 1096 flow [2025-01-09 21:28:17,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:28:17,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:28:17,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1476 transitions. [2025-01-09 21:28:17,857 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8880866425992779 [2025-01-09 21:28:17,857 INFO L175 Difference]: Start difference. First operand has 501 places, 554 transitions, 1124 flow. Second operand 3 states and 1476 transitions. [2025-01-09 21:28:17,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 495 places, 499 transitions, 1096 flow [2025-01-09 21:28:17,860 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 495 places, 499 transitions, 1096 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:28:17,863 INFO L231 Difference]: Finished difference. Result has 496 places, 499 transitions, 1024 flow [2025-01-09 21:28:17,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1012, PETRI_DIFFERENCE_MINUEND_PLACES=493, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=498, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=496, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1024, PETRI_PLACES=496, PETRI_TRANSITIONS=499} [2025-01-09 21:28:17,864 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, -5 predicate places. [2025-01-09 21:28:17,864 INFO L471 AbstractCegarLoop]: Abstraction has has 496 places, 499 transitions, 1024 flow [2025-01-09 21:28:17,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 463.3333333333333) internal successors, (1390), 3 states have internal predecessors, (1390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:17,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:17,865 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:17,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:28:17,865 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:17,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:17,866 INFO L85 PathProgramCache]: Analyzing trace with hash -251494241, now seen corresponding path program 1 times [2025-01-09 21:28:17,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:17,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438216198] [2025-01-09 21:28:17,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:17,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:17,873 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:28:17,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:28:17,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:17,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:17,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:17,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438216198] [2025-01-09 21:28:17,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438216198] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:28:17,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1245802907] [2025-01-09 21:28:17,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:28:17,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:28:17,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:28:17,923 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 21:28:17,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 21:28:17,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 21:28:18,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 21:28:18,000 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:28:18,000 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:18,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:28:18,002 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:28:18,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:18,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:28:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 21:28:18,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1245802907] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:28:18,051 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:28:18,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:28:18,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091044934] [2025-01-09 21:28:18,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:28:18,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:28:18,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:18,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:28:18,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:28:18,067 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 459 out of 554 [2025-01-09 21:28:18,070 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 496 places, 499 transitions, 1024 flow. Second operand has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:18,070 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:18,070 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 459 of 554 [2025-01-09 21:28:18,070 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:28:20,322 INFO L124 PetriNetUnfolderBase]: 2887/20450 cut-off events. [2025-01-09 21:28:20,322 INFO L125 PetriNetUnfolderBase]: For 152/156 co-relation queries the response was YES. [2025-01-09 21:28:20,389 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24725 conditions, 20450 events. 2887/20450 cut-off events. For 152/156 co-relation queries the response was YES. Maximal size of possible extension queue 490. Compared 274268 event pairs, 2376 based on Foata normal form. 2/18753 useless extension candidates. Maximal degree in co-relation 24629. Up to 4183 conditions per place. [2025-01-09 21:28:20,435 INFO L140 encePairwiseOnDemand]: 548/554 looper letters, 43 selfloop transitions, 9 changer transitions 0/507 dead transitions. [2025-01-09 21:28:20,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 507 transitions, 1146 flow [2025-01-09 21:28:20,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:28:20,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:28:20,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4185 transitions. [2025-01-09 21:28:20,441 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8393501805054152 [2025-01-09 21:28:20,442 INFO L175 Difference]: Start difference. First operand has 496 places, 499 transitions, 1024 flow. Second operand 9 states and 4185 transitions. [2025-01-09 21:28:20,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 507 transitions, 1146 flow [2025-01-09 21:28:20,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 503 places, 507 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:28:20,449 INFO L231 Difference]: Finished difference. Result has 506 places, 505 transitions, 1072 flow [2025-01-09 21:28:20,449 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=554, PETRI_DIFFERENCE_MINUEND_FLOW=1022, PETRI_DIFFERENCE_MINUEND_PLACES=495, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=499, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=1072, PETRI_PLACES=506, PETRI_TRANSITIONS=505} [2025-01-09 21:28:20,451 INFO L279 CegarLoopForPetriNet]: 501 programPoint places, 5 predicate places. [2025-01-09 21:28:20,451 INFO L471 AbstractCegarLoop]: Abstraction has has 506 places, 505 transitions, 1072 flow [2025-01-09 21:28:20,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 460.8) internal successors, (4608), 10 states have internal predecessors, (4608), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:20,452 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:28:20,453 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:28:20,467 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:28:20,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 21:28:20,653 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 25 more)] === [2025-01-09 21:28:20,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:28:20,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1876331711, now seen corresponding path program 2 times [2025-01-09 21:28:20,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:28:20,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147133426] [2025-01-09 21:28:20,654 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:28:20,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:28:20,670 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-01-09 21:28:20,676 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 93 of 108 statements. [2025-01-09 21:28:20,676 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:28:20,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:28:20,917 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 21:28:20,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:28:20,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147133426] [2025-01-09 21:28:20,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147133426] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:28:20,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:28:20,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:28:20,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273585587] [2025-01-09 21:28:20,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:28:20,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:28:20,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:28:20,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:28:20,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:28:21,438 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 370 out of 554 [2025-01-09 21:28:21,439 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 505 transitions, 1072 flow. Second operand has 6 states, 6 states have (on average 371.5) internal successors, (2229), 6 states have internal predecessors, (2229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 21:28:21,439 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:28:21,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 370 of 554 [2025-01-09 21:28:21,439 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand