./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.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/09-regions_11-arraylist_nr.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 c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:24:06,987 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:24:07,035 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:24:07,044 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:24:07,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:24:07,068 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:24:07,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:24:07,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:24:07,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:24:07,070 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:24:07,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:24:07,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:24:07,071 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:24:07,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:24:07,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:24:07,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:24:07,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:07,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:24:07,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:07,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:24:07,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:24:07,074 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 -> c4f9d381010c40c0aeec814019363f065d1b11569cf33ee927950bcd4ef29f20 [2025-01-09 21:24:07,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:24:07,321 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:24:07,324 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:24:07,326 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:24:07,327 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:24:07,328 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-01-09 21:24:08,490 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40620307e/432cbae01687479eb2532ceff4f70c87/FLAGaa946ae1b [2025-01-09 21:24:08,839 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:24:08,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_11-arraylist_nr.i [2025-01-09 21:24:08,861 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40620307e/432cbae01687479eb2532ceff4f70c87/FLAGaa946ae1b [2025-01-09 21:24:08,876 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/40620307e/432cbae01687479eb2532ceff4f70c87 [2025-01-09 21:24:08,878 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:24:08,880 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:24:08,881 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:08,881 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:24:08,885 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:24:08,885 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:08" (1/1) ... [2025-01-09 21:24:08,886 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7cfe3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:08, skipping insertion in model container [2025-01-09 21:24:08,886 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:24:08" (1/1) ... [2025-01-09 21:24:08,922 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:24:09,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:09,396 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:24:09,442 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:24:09,500 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:24:09,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09 WrapperNode [2025-01-09 21:24:09,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:24:09,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:09,502 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:24:09,502 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:24:09,506 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:24:09" (1/1) ... [2025-01-09 21:24:09,524 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:24:09" (1/1) ... [2025-01-09 21:24:09,555 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 294 [2025-01-09 21:24:09,555 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:24:09,556 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:24:09,556 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:24:09,556 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:24:09,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,567 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,567 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,587 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,591 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,592 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,593 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,596 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:24:09,597 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:24:09,597 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:24:09,597 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:24:09,598 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (1/1) ... [2025-01-09 21:24:09,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:24:09,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:09,623 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:24:09,626 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:24:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-01-09 21:24:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-01-09 21:24:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:24:09,643 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:24:09,644 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:24:09,644 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:24:09,645 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:24:09,646 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:24:09,772 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:24:09,773 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:24:10,264 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:24:10,264 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:24:10,286 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:24:10,287 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:24:10,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:10 BoogieIcfgContainer [2025-01-09 21:24:10,287 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:24:10,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:24:10,288 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:24:10,291 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:24:10,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:24:08" (1/3) ... [2025-01-09 21:24:10,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676495e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:10, skipping insertion in model container [2025-01-09 21:24:10,292 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:24:09" (2/3) ... [2025-01-09 21:24:10,292 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@676495e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:24:10, skipping insertion in model container [2025-01-09 21:24:10,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:24:10" (3/3) ... [2025-01-09 21:24:10,293 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_11-arraylist_nr.i [2025-01-09 21:24:10,303 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:24:10,304 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_11-arraylist_nr.i that has 2 procedures, 336 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-01-09 21:24:10,304 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:24:10,402 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:24:10,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 339 transitions, 682 flow [2025-01-09 21:24:10,521 INFO L124 PetriNetUnfolderBase]: 4/338 cut-off events. [2025-01-09 21:24:10,524 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:10,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 338 events. 4/338 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 397 event pairs, 0 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2025-01-09 21:24:10,532 INFO L82 GeneralOperation]: Start removeDead. Operand has 339 places, 339 transitions, 682 flow [2025-01-09 21:24:10,540 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 338 transitions, 679 flow [2025-01-09 21:24:10,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:24:10,559 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;@11fc309d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:24:10,560 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-01-09 21:24:10,586 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:24:10,586 INFO L124 PetriNetUnfolderBase]: 3/131 cut-off events. [2025-01-09 21:24:10,587 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:24:10,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:10,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:10,590 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:10,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:10,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1083417160, now seen corresponding path program 1 times [2025-01-09 21:24:10,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:10,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449851013] [2025-01-09 21:24:10,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:10,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:10,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:24:10,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:24:10,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:10,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:10,936 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:24:10,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:10,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449851013] [2025-01-09 21:24:10,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449851013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:10,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:10,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:10,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242512954] [2025-01-09 21:24:10,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:10,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:10,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:10,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:10,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:10,982 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-01-09 21:24:10,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 338 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:24:10,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:10,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-01-09 21:24:10,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:11,073 INFO L124 PetriNetUnfolderBase]: 8/416 cut-off events. [2025-01-09 21:24:11,073 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:11,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 416 events. 8/416 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 872 event pairs, 6 based on Foata normal form. 5/390 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-01-09 21:24:11,077 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 10 selfloop transitions, 2 changer transitions 1/337 dead transitions. [2025-01-09 21:24:11,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 337 transitions, 701 flow [2025-01-09 21:24:11,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:11,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:11,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-01-09 21:24:11,093 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976401179941003 [2025-01-09 21:24:11,095 INFO L175 Difference]: Start difference. First operand has 338 places, 338 transitions, 679 flow. Second operand 3 states and 993 transitions. [2025-01-09 21:24:11,096 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 337 transitions, 701 flow [2025-01-09 21:24:11,101 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 337 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:11,107 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 684 flow [2025-01-09 21:24:11,111 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-01-09 21:24:11,113 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 2 predicate places. [2025-01-09 21:24:11,115 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 684 flow [2025-01-09 21:24:11,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 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:24:11,115 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:11,115 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:24:11,116 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:11,117 INFO L85 PathProgramCache]: Analyzing trace with hash 709935305, now seen corresponding path program 1 times [2025-01-09 21:24:11,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:11,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250700026] [2025-01-09 21:24:11,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:11,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:24:11,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:24:11,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:11,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:11,333 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:24:11,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250700026] [2025-01-09 21:24:11,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250700026] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:11,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890021690] [2025-01-09 21:24:11,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:11,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:11,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:11,336 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:24:11,337 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:24:11,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-01-09 21:24:11,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-01-09 21:24:11,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:11,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:11,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:24:11,447 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:11,498 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:24:11,500 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:11,541 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:24:11,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890021690] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:11,545 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:11,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:24:11,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415603534] [2025-01-09 21:24:11,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:11,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:11,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:11,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:11,547 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:11,576 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:11,580 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 684 flow. Second operand has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 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:24:11,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:11,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:11,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:11,706 INFO L124 PetriNetUnfolderBase]: 8/422 cut-off events. [2025-01-09 21:24:11,706 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:24:11,707 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 422 events. 8/422 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 865 event pairs, 6 based on Foata normal form. 2/394 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-01-09 21:24:11,708 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/344 dead transitions. [2025-01-09 21:24:11,709 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 748 flow [2025-01-09 21:24:11,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:24:11,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:24:11,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-01-09 21:24:11,717 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-01-09 21:24:11,718 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 684 flow. Second operand 9 states and 2932 transitions. [2025-01-09 21:24:11,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 748 flow [2025-01-09 21:24:11,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:11,724 INFO L231 Difference]: Finished difference. Result has 349 places, 342 transitions, 732 flow [2025-01-09 21:24:11,725 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=349, PETRI_TRANSITIONS=342} [2025-01-09 21:24:11,726 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-01-09 21:24:11,726 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 342 transitions, 732 flow [2025-01-09 21:24:11,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 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:24:11,728 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:11,728 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:24:11,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 21:24:11,933 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:24:11,933 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:11,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:11,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1827217961, now seen corresponding path program 2 times [2025-01-09 21:24:11,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:11,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602459616] [2025-01-09 21:24:11,934 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:11,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:11,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-01-09 21:24:11,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 114 statements. [2025-01-09 21:24:11,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:11,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:12,431 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:24:12,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:12,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602459616] [2025-01-09 21:24:12,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602459616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:12,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:12,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:12,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005036279] [2025-01-09 21:24:12,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:12,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:12,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:12,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:12,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:12,842 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-01-09 21:24:12,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 342 transitions, 732 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 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:24:12,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:12,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-01-09 21:24:12,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:13,135 INFO L124 PetriNetUnfolderBase]: 366/1697 cut-off events. [2025-01-09 21:24:13,135 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:24:13,137 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1697 events. 366/1697 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10047 event pairs, 364 based on Foata normal form. 0/1571 useless extension candidates. Maximal degree in co-relation 2426. Up to 800 conditions per place. [2025-01-09 21:24:13,144 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/340 dead transitions. [2025-01-09 21:24:13,144 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 890 flow [2025-01-09 21:24:13,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:13,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:13,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-01-09 21:24:13,148 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-01-09 21:24:13,148 INFO L175 Difference]: Start difference. First operand has 349 places, 342 transitions, 732 flow. Second operand 6 states and 1607 transitions. [2025-01-09 21:24:13,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 890 flow [2025-01-09 21:24:13,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 340 transitions, 884 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:13,152 INFO L231 Difference]: Finished difference. Result has 351 places, 340 transitions, 742 flow [2025-01-09 21:24:13,153 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=351, PETRI_TRANSITIONS=340} [2025-01-09 21:24:13,153 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 13 predicate places. [2025-01-09 21:24:13,153 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 340 transitions, 742 flow [2025-01-09 21:24:13,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 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:24:13,154 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:13,154 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, 1] [2025-01-09 21:24:13,154 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:24:13,154 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:13,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:13,155 INFO L85 PathProgramCache]: Analyzing trace with hash -455748363, now seen corresponding path program 1 times [2025-01-09 21:24:13,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:13,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912474837] [2025-01-09 21:24:13,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:13,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:13,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 21:24:13,169 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 21:24:13,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:13,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,214 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:24:13,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:13,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912474837] [2025-01-09 21:24:13,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912474837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:13,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:13,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:24:13,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117149912] [2025-01-09 21:24:13,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:13,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:24:13,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:13,216 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:24:13,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:24:13,240 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-01-09 21:24:13,241 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 340 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:24:13,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:13,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-01-09 21:24:13,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:13,292 INFO L124 PetriNetUnfolderBase]: 8/531 cut-off events. [2025-01-09 21:24:13,292 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-01-09 21:24:13,293 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 531 events. 8/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 856 event pairs, 6 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-01-09 21:24:13,295 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 10 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-01-09 21:24:13,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 341 transitions, 768 flow [2025-01-09 21:24:13,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:24:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:24:13,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2025-01-09 21:24:13,297 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744346116027532 [2025-01-09 21:24:13,297 INFO L175 Difference]: Start difference. First operand has 351 places, 340 transitions, 742 flow. Second operand 3 states and 991 transitions. [2025-01-09 21:24:13,297 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 341 transitions, 768 flow [2025-01-09 21:24:13,299 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 341 transitions, 748 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:13,302 INFO L231 Difference]: Finished difference. Result has 349 places, 341 transitions, 734 flow [2025-01-09 21:24:13,302 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=349, PETRI_TRANSITIONS=341} [2025-01-09 21:24:13,304 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-01-09 21:24:13,304 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 341 transitions, 734 flow [2025-01-09 21:24:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 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:24:13,305 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:13,305 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 21:24:13,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 21:24:13,305 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:13,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:13,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1532074012, now seen corresponding path program 1 times [2025-01-09 21:24:13,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:13,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887020919] [2025-01-09 21:24:13,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:13,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:13,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:24:13,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:24:13,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:13,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,465 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:24:13,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887020919] [2025-01-09 21:24:13,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887020919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:13,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1617414000] [2025-01-09 21:24:13,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:13,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:13,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:13,473 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:24:13,474 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:24:13,539 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 21:24:13,570 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 21:24:13,570 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:13,570 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:13,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:24:13,577 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:13,617 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:24:13,617 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:13,697 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:24:13,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1617414000] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:13,697 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:13,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:24:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081165496] [2025-01-09 21:24:13,698 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:24:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:13,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:24:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:24:13,732 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:13,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 341 transitions, 734 flow. Second operand has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 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:24:13,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:13,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:13,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:13,948 INFO L124 PetriNetUnfolderBase]: 8/551 cut-off events. [2025-01-09 21:24:13,948 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-01-09 21:24:13,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 551 events. 8/551 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 857 event pairs, 6 based on Foata normal form. 4/521 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-01-09 21:24:13,950 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 18 selfloop transitions, 21 changer transitions 0/359 dead transitions. [2025-01-09 21:24:13,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 359 transitions, 900 flow [2025-01-09 21:24:13,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:24:13,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:24:13,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-01-09 21:24:13,960 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-01-09 21:24:13,960 INFO L175 Difference]: Start difference. First operand has 349 places, 341 transitions, 734 flow. Second operand 21 states and 6826 transitions. [2025-01-09 21:24:13,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 359 transitions, 900 flow [2025-01-09 21:24:13,962 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 359 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:13,965 INFO L231 Difference]: Finished difference. Result has 373 places, 354 transitions, 862 flow [2025-01-09 21:24:13,965 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=862, PETRI_PLACES=373, PETRI_TRANSITIONS=354} [2025-01-09 21:24:13,966 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 35 predicate places. [2025-01-09 21:24:13,966 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 354 transitions, 862 flow [2025-01-09 21:24:13,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 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:24:13,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:13,969 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:13,976 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:14,169 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:24:14,170 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:14,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:14,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1996819748, now seen corresponding path program 2 times [2025-01-09 21:24:14,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:14,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194318427] [2025-01-09 21:24:14,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:14,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:14,182 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-01-09 21:24:14,188 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 142 statements. [2025-01-09 21:24:14,188 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:14,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-01-09 21:24:14,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:14,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194318427] [2025-01-09 21:24:14,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194318427] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:14,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:14,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:14,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311803596] [2025-01-09 21:24:14,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:14,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:14,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:14,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:14,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:14,832 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-01-09 21:24:14,834 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 354 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 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:24:14,834 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:14,834 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-01-09 21:24:14,834 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:15,155 INFO L124 PetriNetUnfolderBase]: 366/1824 cut-off events. [2025-01-09 21:24:15,155 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-01-09 21:24:15,158 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2774 conditions, 1824 events. 366/1824 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10051 event pairs, 364 based on Foata normal form. 0/1696 useless extension candidates. Maximal degree in co-relation 2581. Up to 830 conditions per place. [2025-01-09 21:24:15,162 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/352 dead transitions. [2025-01-09 21:24:15,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 352 transitions, 1020 flow [2025-01-09 21:24:15,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:15,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:15,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-01-09 21:24:15,165 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-01-09 21:24:15,166 INFO L175 Difference]: Start difference. First operand has 373 places, 354 transitions, 862 flow. Second operand 6 states and 1607 transitions. [2025-01-09 21:24:15,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 352 transitions, 1020 flow [2025-01-09 21:24:15,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 352 transitions, 996 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:15,171 INFO L231 Difference]: Finished difference. Result has 370 places, 352 transitions, 854 flow [2025-01-09 21:24:15,171 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=352} [2025-01-09 21:24:15,172 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 32 predicate places. [2025-01-09 21:24:15,172 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 352 transitions, 854 flow [2025-01-09 21:24:15,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 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:24:15,173 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:15,173 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:15,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 21:24:15,173 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:15,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:15,174 INFO L85 PathProgramCache]: Analyzing trace with hash -1228523766, now seen corresponding path program 1 times [2025-01-09 21:24:15,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:15,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1201615652] [2025-01-09 21:24:15,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:15,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:15,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:24:15,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:24:15,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:15,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:15,457 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:24:15,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:15,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1201615652] [2025-01-09 21:24:15,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1201615652] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:15,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835684131] [2025-01-09 21:24:15,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:15,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:15,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:15,460 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:24:15,461 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:24:15,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 21:24:15,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 21:24:15,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:15,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:15,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:24:15,569 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:15,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:24:15,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:15,805 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:24:15,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835684131] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:15,806 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:15,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:24:15,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532917787] [2025-01-09 21:24:15,806 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:15,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:24:15,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:15,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:24:15,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:24:15,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:15,844 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 352 transitions, 854 flow. Second operand has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 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:24:15,844 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:15,844 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:15,844 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:16,131 INFO L124 PetriNetUnfolderBase]: 8/562 cut-off events. [2025-01-09 21:24:16,132 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-01-09 21:24:16,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 562 events. 8/562 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 847 event pairs, 6 based on Foata normal form. 3/535 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-01-09 21:24:16,134 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 21 selfloop transitions, 30 changer transitions 0/369 dead transitions. [2025-01-09 21:24:16,134 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 369 transitions, 1078 flow [2025-01-09 21:24:16,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:24:16,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:24:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-01-09 21:24:16,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-01-09 21:24:16,146 INFO L175 Difference]: Start difference. First operand has 370 places, 352 transitions, 854 flow. Second operand 30 states and 9744 transitions. [2025-01-09 21:24:16,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 369 transitions, 1078 flow [2025-01-09 21:24:16,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 369 transitions, 1058 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:16,154 INFO L231 Difference]: Finished difference. Result has 398 places, 362 transitions, 986 flow [2025-01-09 21:24:16,156 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=986, PETRI_PLACES=398, PETRI_TRANSITIONS=362} [2025-01-09 21:24:16,157 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 60 predicate places. [2025-01-09 21:24:16,158 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 362 transitions, 986 flow [2025-01-09 21:24:16,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 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:24:16,160 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:16,160 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:16,167 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:24:16,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:16,361 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:16,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:16,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1372092551, now seen corresponding path program 2 times [2025-01-09 21:24:16,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:16,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075248981] [2025-01-09 21:24:16,362 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:16,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:16,379 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-01-09 21:24:16,390 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 169 statements. [2025-01-09 21:24:16,390 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:16,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:16,687 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:24:16,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:16,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075248981] [2025-01-09 21:24:16,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075248981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:16,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:16,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:16,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441015842] [2025-01-09 21:24:16,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:16,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:16,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:16,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:16,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:17,185 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 339 [2025-01-09 21:24:17,186 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 362 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 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:24:17,186 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:17,186 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 339 [2025-01-09 21:24:17,186 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:17,414 INFO L124 PetriNetUnfolderBase]: 392/1927 cut-off events. [2025-01-09 21:24:17,414 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-01-09 21:24:17,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3004 conditions, 1927 events. 392/1927 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10777 event pairs, 390 based on Foata normal form. 0/1795 useless extension candidates. Maximal degree in co-relation 2732. Up to 899 conditions per place. [2025-01-09 21:24:17,423 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 83 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-01-09 21:24:17,423 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 361 transitions, 1160 flow [2025-01-09 21:24:17,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:17,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:17,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2025-01-09 21:24:17,426 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-01-09 21:24:17,426 INFO L175 Difference]: Start difference. First operand has 398 places, 362 transitions, 986 flow. Second operand 6 states and 1582 transitions. [2025-01-09 21:24:17,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 361 transitions, 1160 flow [2025-01-09 21:24:17,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 361 transitions, 1114 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:17,431 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 948 flow [2025-01-09 21:24:17,432 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=948, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-01-09 21:24:17,432 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 46 predicate places. [2025-01-09 21:24:17,433 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 948 flow [2025-01-09 21:24:17,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 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:24:17,433 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:17,433 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:17,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:24:17,434 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:17,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:17,434 INFO L85 PathProgramCache]: Analyzing trace with hash -321829504, now seen corresponding path program 1 times [2025-01-09 21:24:17,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:17,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816634096] [2025-01-09 21:24:17,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:17,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:17,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-01-09 21:24:17,473 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-01-09 21:24:17,474 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:17,474 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:24:17,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:17,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816634096] [2025-01-09 21:24:17,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816634096] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:17,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:17,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:17,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196642345] [2025-01-09 21:24:17,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:17,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:17,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:17,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:17,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:18,305 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 339 [2025-01-09 21:24:18,306 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 948 flow. Second operand has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 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:24:18,306 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:18,306 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 339 [2025-01-09 21:24:18,306 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:18,469 INFO L124 PetriNetUnfolderBase]: 56/801 cut-off events. [2025-01-09 21:24:18,469 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:24:18,471 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 801 events. 56/801 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2630 event pairs, 54 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-01-09 21:24:18,472 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 57 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2025-01-09 21:24:18,473 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 360 transitions, 1070 flow [2025-01-09 21:24:18,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:18,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:18,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1712 transitions. [2025-01-09 21:24:18,477 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416912487708947 [2025-01-09 21:24:18,477 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 948 flow. Second operand 6 states and 1712 transitions. [2025-01-09 21:24:18,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 360 transitions, 1070 flow [2025-01-09 21:24:18,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 360 transitions, 1060 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:18,483 INFO L231 Difference]: Finished difference. Result has 383 places, 360 transitions, 946 flow [2025-01-09 21:24:18,483 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=383, PETRI_TRANSITIONS=360} [2025-01-09 21:24:18,484 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 45 predicate places. [2025-01-09 21:24:18,484 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 360 transitions, 946 flow [2025-01-09 21:24:18,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 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:24:18,484 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:18,485 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:18,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:24:18,485 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:18,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:18,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1758263963, now seen corresponding path program 1 times [2025-01-09 21:24:18,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169786369] [2025-01-09 21:24:18,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:18,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:18,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-09 21:24:18,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-09 21:24:18,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:18,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:18,925 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:24:18,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:18,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169786369] [2025-01-09 21:24:18,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169786369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:18,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:18,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:18,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286471170] [2025-01-09 21:24:18,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:18,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:18,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:18,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:18,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:19,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-01-09 21:24:19,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 360 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 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:24:19,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:19,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-01-09 21:24:19,310 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:19,432 INFO L124 PetriNetUnfolderBase]: 38/716 cut-off events. [2025-01-09 21:24:19,433 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-09 21:24:19,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 716 events. 38/716 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2081 event pairs, 36 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-01-09 21:24:19,435 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 53 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-01-09 21:24:19,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 359 transitions, 1060 flow [2025-01-09 21:24:19,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:19,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:19,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1727 transitions. [2025-01-09 21:24:19,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490658800393314 [2025-01-09 21:24:19,438 INFO L175 Difference]: Start difference. First operand has 383 places, 360 transitions, 946 flow. Second operand 6 states and 1727 transitions. [2025-01-09 21:24:19,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 359 transitions, 1060 flow [2025-01-09 21:24:19,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1050 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:19,444 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-01-09 21:24:19,445 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-01-09 21:24:19,446 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 44 predicate places. [2025-01-09 21:24:19,446 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-01-09 21:24:19,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 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:24:19,447 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:19,447 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:19,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:24:19,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:19,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:19,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1504377346, now seen corresponding path program 1 times [2025-01-09 21:24:19,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:19,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779743693] [2025-01-09 21:24:19,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:19,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:19,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 21:24:19,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 21:24:19,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:19,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:19,849 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:24:19,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:19,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779743693] [2025-01-09 21:24:19,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779743693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:19,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:19,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:19,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542664655] [2025-01-09 21:24:19,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:19,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:19,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:19,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:19,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:20,108 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 339 [2025-01-09 21:24:20,109 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 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:24:20,109 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:20,109 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 339 [2025-01-09 21:24:20,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:20,374 INFO L124 PetriNetUnfolderBase]: 366/1831 cut-off events. [2025-01-09 21:24:20,374 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-09 21:24:20,377 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2843 conditions, 1831 events. 366/1831 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10024 event pairs, 364 based on Foata normal form. 0/1711 useless extension candidates. Maximal degree in co-relation 2594. Up to 846 conditions per place. [2025-01-09 21:24:20,382 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 79 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-01-09 21:24:20,382 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1110 flow [2025-01-09 21:24:20,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:20,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:20,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1597 transitions. [2025-01-09 21:24:20,385 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7851524090462143 [2025-01-09 21:24:20,386 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1597 transitions. [2025-01-09 21:24:20,387 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1110 flow [2025-01-09 21:24:20,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1100 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:20,392 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-01-09 21:24:20,393 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-01-09 21:24:20,393 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 43 predicate places. [2025-01-09 21:24:20,394 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-01-09 21:24:20,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 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:24:20,394 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:20,394 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:20,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:24:20,395 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:20,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:20,395 INFO L85 PathProgramCache]: Analyzing trace with hash -1817396548, now seen corresponding path program 1 times [2025-01-09 21:24:20,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:20,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893777579] [2025-01-09 21:24:20,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:20,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:20,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-09 21:24:20,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-09 21:24:20,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:20,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:20,865 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-01-09 21:24:20,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:20,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893777579] [2025-01-09 21:24:20,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893777579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:20,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:20,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:20,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688358400] [2025-01-09 21:24:20,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:20,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:20,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:20,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:20,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:21,134 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 339 [2025-01-09 21:24:21,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 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:24:21,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:21,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 339 [2025-01-09 21:24:21,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:21,431 INFO L124 PetriNetUnfolderBase]: 366/1829 cut-off events. [2025-01-09 21:24:21,431 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-01-09 21:24:21,434 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2839 conditions, 1829 events. 366/1829 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 9990 event pairs, 364 based on Foata normal form. 0/1711 useless extension candidates. Maximal degree in co-relation 2590. Up to 844 conditions per place. [2025-01-09 21:24:21,439 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 78 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-01-09 21:24:21,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1106 flow [2025-01-09 21:24:21,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:21,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:21,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1602 transitions. [2025-01-09 21:24:21,442 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7876106194690266 [2025-01-09 21:24:21,442 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1602 transitions. [2025-01-09 21:24:21,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1106 flow [2025-01-09 21:24:21,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:21,448 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-01-09 21:24:21,448 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-01-09 21:24:21,450 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 42 predicate places. [2025-01-09 21:24:21,450 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-01-09 21:24:21,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 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:24:21,451 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:21,451 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:21,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:24:21,451 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:21,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:21,452 INFO L85 PathProgramCache]: Analyzing trace with hash -805205199, now seen corresponding path program 1 times [2025-01-09 21:24:21,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:21,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541118059] [2025-01-09 21:24:21,452 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:21,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:21,475 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 21:24:21,484 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 21:24:21,484 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:21,484 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-01-09 21:24:21,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541118059] [2025-01-09 21:24:21,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541118059] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:21,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1441305859] [2025-01-09 21:24:21,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:21,607 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:21,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:21,610 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:24:21,611 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:24:21,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-01-09 21:24:21,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-01-09 21:24:21,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:21,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:21,779 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:24:21,787 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:21,898 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-01-09 21:24:21,898 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:22,012 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-01-09 21:24:22,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1441305859] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:22,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:22,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:24:22,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957328263] [2025-01-09 21:24:22,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:22,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:24:22,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:22,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:24:22,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:22,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:22,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 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:24:22,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:22,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:22,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:22,226 INFO L124 PetriNetUnfolderBase]: 8/659 cut-off events. [2025-01-09 21:24:22,226 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-01-09 21:24:22,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 659 events. 8/659 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 391 event pairs, 6 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-01-09 21:24:22,228 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/365 dead transitions. [2025-01-09 21:24:22,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 365 transitions, 1004 flow [2025-01-09 21:24:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:24:22,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:24:22,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-01-09 21:24:22,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-01-09 21:24:22,230 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 9 states and 2932 transitions. [2025-01-09 21:24:22,230 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 365 transitions, 1004 flow [2025-01-09 21:24:22,233 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 365 transitions, 994 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-01-09 21:24:22,236 INFO L231 Difference]: Finished difference. Result has 386 places, 363 transitions, 980 flow [2025-01-09 21:24:22,236 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=980, PETRI_PLACES=386, PETRI_TRANSITIONS=363} [2025-01-09 21:24:22,238 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 48 predicate places. [2025-01-09 21:24:22,238 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 363 transitions, 980 flow [2025-01-09 21:24:22,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 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:24:22,242 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:22,243 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:22,251 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:22,443 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,SelfDestructingSolverStorable12 [2025-01-09 21:24:22,444 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:22,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:22,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1208235729, now seen corresponding path program 2 times [2025-01-09 21:24:22,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:22,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583406587] [2025-01-09 21:24:22,445 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:22,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:22,496 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 465 statements into 2 equivalence classes. [2025-01-09 21:24:22,500 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 100 of 465 statements. [2025-01-09 21:24:22,500 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:22,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:22,676 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 607 trivial. 0 not checked. [2025-01-09 21:24:22,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:22,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583406587] [2025-01-09 21:24:22,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583406587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:22,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:22,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:22,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390596828] [2025-01-09 21:24:22,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:22,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:22,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:22,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:22,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:23,094 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-01-09 21:24:23,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 363 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 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:24:23,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:23,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-01-09 21:24:23,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:23,391 INFO L124 PetriNetUnfolderBase]: 258/1966 cut-off events. [2025-01-09 21:24:23,392 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-01-09 21:24:23,395 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 1966 events. 258/1966 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10046 event pairs, 34 based on Foata normal form. 0/1840 useless extension candidates. Maximal degree in co-relation 2516. Up to 491 conditions per place. [2025-01-09 21:24:23,399 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 67 selfloop transitions, 70 changer transitions 0/441 dead transitions. [2025-01-09 21:24:23,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 441 transitions, 1410 flow [2025-01-09 21:24:23,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:23,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:23,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-01-09 21:24:23,401 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-01-09 21:24:23,401 INFO L175 Difference]: Start difference. First operand has 386 places, 363 transitions, 980 flow. Second operand 6 states and 1806 transitions. [2025-01-09 21:24:23,401 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 441 transitions, 1410 flow [2025-01-09 21:24:23,404 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 441 transitions, 1404 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:24:23,407 INFO L231 Difference]: Finished difference. Result has 395 places, 432 transitions, 1436 flow [2025-01-09 21:24:23,408 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1436, PETRI_PLACES=395, PETRI_TRANSITIONS=432} [2025-01-09 21:24:23,408 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 57 predicate places. [2025-01-09 21:24:23,408 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 432 transitions, 1436 flow [2025-01-09 21:24:23,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 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:24:23,408 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:23,409 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:23,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:24:23,409 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:23,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:23,410 INFO L85 PathProgramCache]: Analyzing trace with hash -371345850, now seen corresponding path program 1 times [2025-01-09 21:24:23,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:23,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310405130] [2025-01-09 21:24:23,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:23,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-01-09 21:24:23,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-01-09 21:24:23,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:23,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:23,830 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-09 21:24:23,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310405130] [2025-01-09 21:24:23,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310405130] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:23,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [607674331] [2025-01-09 21:24:23,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:23,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:23,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:23,832 INFO L229 MonitoredProcess]: Starting monitored process 6 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:24:23,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 21:24:24,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-01-09 21:24:24,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-01-09 21:24:24,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:24,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:24,148 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:24:24,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:24,425 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-09 21:24:24,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 607 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2025-01-09 21:24:24,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [607674331] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:24,739 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:24,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:24:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203589447] [2025-01-09 21:24:24,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:24,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:24:24,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:24,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:24:24,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:24:24,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:24,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 432 transitions, 1436 flow. Second operand has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 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:24:24,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:24,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:24,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:25,323 INFO L124 PetriNetUnfolderBase]: 137/2068 cut-off events. [2025-01-09 21:24:25,323 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-01-09 21:24:25,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2886 conditions, 2068 events. 137/2068 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7283 event pairs, 21 based on Foata normal form. 4/1985 useless extension candidates. Maximal degree in co-relation 2629. Up to 206 conditions per place. [2025-01-09 21:24:25,330 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 19 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2025-01-09 21:24:25,331 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 450 transitions, 1604 flow [2025-01-09 21:24:25,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:24:25,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:24:25,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-01-09 21:24:25,335 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-01-09 21:24:25,335 INFO L175 Difference]: Start difference. First operand has 395 places, 432 transitions, 1436 flow. Second operand 21 states and 6826 transitions. [2025-01-09 21:24:25,335 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 450 transitions, 1604 flow [2025-01-09 21:24:25,339 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 450 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:25,342 INFO L231 Difference]: Finished difference. Result has 420 places, 445 transitions, 1566 flow [2025-01-09 21:24:25,342 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1566, PETRI_PLACES=420, PETRI_TRANSITIONS=445} [2025-01-09 21:24:25,342 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 82 predicate places. [2025-01-09 21:24:25,343 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 445 transitions, 1566 flow [2025-01-09 21:24:25,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 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:24:25,344 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:25,344 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:25,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:25,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-01-09 21:24:25,544 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:25,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:25,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1791796614, now seen corresponding path program 2 times [2025-01-09 21:24:25,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:25,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031012044] [2025-01-09 21:24:25,547 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:25,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:25,640 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 891 statements into 2 equivalence classes. [2025-01-09 21:24:25,643 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 106 of 891 statements. [2025-01-09 21:24:25,643 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:25,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:25,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2741 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2741 trivial. 0 not checked. [2025-01-09 21:24:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:25,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031012044] [2025-01-09 21:24:25,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031012044] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:25,810 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:25,810 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:25,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263230554] [2025-01-09 21:24:25,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:25,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:25,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:25,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:25,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:26,122 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-01-09 21:24:26,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 445 transitions, 1566 flow. Second operand has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 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:24:26,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:26,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-01-09 21:24:26,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:26,902 INFO L124 PetriNetUnfolderBase]: 531/3151 cut-off events. [2025-01-09 21:24:26,902 INFO L125 PetriNetUnfolderBase]: For 991/1074 co-relation queries the response was YES. [2025-01-09 21:24:26,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5582 conditions, 3151 events. 531/3151 cut-off events. For 991/1074 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16087 event pairs, 92 based on Foata normal form. 16/3010 useless extension candidates. Maximal degree in co-relation 5320. Up to 981 conditions per place. [2025-01-09 21:24:26,915 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 131 selfloop transitions, 130 changer transitions 0/582 dead transitions. [2025-01-09 21:24:26,915 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 582 transitions, 2738 flow [2025-01-09 21:24:26,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:26,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:26,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1805 transitions. [2025-01-09 21:24:26,917 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874139626352016 [2025-01-09 21:24:26,917 INFO L175 Difference]: Start difference. First operand has 420 places, 445 transitions, 1566 flow. Second operand 6 states and 1805 transitions. [2025-01-09 21:24:26,917 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 582 transitions, 2738 flow [2025-01-09 21:24:26,922 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 582 transitions, 2714 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:24:26,927 INFO L231 Difference]: Finished difference. Result has 424 places, 574 transitions, 2770 flow [2025-01-09 21:24:26,927 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2770, PETRI_PLACES=424, PETRI_TRANSITIONS=574} [2025-01-09 21:24:26,927 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 86 predicate places. [2025-01-09 21:24:26,928 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 574 transitions, 2770 flow [2025-01-09 21:24:26,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 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:24:26,928 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:26,928 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:26,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:24:26,929 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:26,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 501107566, now seen corresponding path program 1 times [2025-01-09 21:24:26,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716791674] [2025-01-09 21:24:26,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:26,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:27,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-01-09 21:24:27,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-01-09 21:24:27,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:27,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:28,201 INFO L134 CoverageAnalysis]: Checked inductivity of 2741 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-09 21:24:28,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716791674] [2025-01-09 21:24:28,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716791674] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:24:28,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179897991] [2025-01-09 21:24:28,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:28,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:24:28,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:24:28,204 INFO L229 MonitoredProcess]: Starting monitored process 7 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:24:28,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 21:24:28,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-01-09 21:24:28,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-01-09 21:24:28,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:28,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:28,758 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:24:28,768 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:24:29,284 INFO L134 CoverageAnalysis]: Checked inductivity of 2741 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-09 21:24:29,284 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:24:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 2741 backedges. 0 proven. 2464 refuted. 0 times theorem prover too weak. 277 trivial. 0 not checked. [2025-01-09 21:24:29,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179897991] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:24:29,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:24:29,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:24:29,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420541755] [2025-01-09 21:24:29,867 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:24:29,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:24:29,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:29,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:24:29,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:24:30,017 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-01-09 21:24:30,020 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 574 transitions, 2770 flow. Second operand has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 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:24:30,020 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:30,020 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-01-09 21:24:30,020 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:30,842 INFO L124 PetriNetUnfolderBase]: 412/3162 cut-off events. [2025-01-09 21:24:30,842 INFO L125 PetriNetUnfolderBase]: For 1289/1327 co-relation queries the response was YES. [2025-01-09 21:24:30,847 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5487 conditions, 3162 events. 412/3162 cut-off events. For 1289/1327 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13219 event pairs, 37 based on Foata normal form. 7/3061 useless extension candidates. Maximal degree in co-relation 5220. Up to 467 conditions per place. [2025-01-09 21:24:30,851 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 30 changer transitions 0/591 dead transitions. [2025-01-09 21:24:30,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 591 transitions, 2996 flow [2025-01-09 21:24:30,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:24:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:24:30,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-01-09 21:24:30,855 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-01-09 21:24:30,855 INFO L175 Difference]: Start difference. First operand has 424 places, 574 transitions, 2770 flow. Second operand 30 states and 9744 transitions. [2025-01-09 21:24:30,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 591 transitions, 2996 flow [2025-01-09 21:24:30,862 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 591 transitions, 2996 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:30,867 INFO L231 Difference]: Finished difference. Result has 457 places, 584 transitions, 2922 flow [2025-01-09 21:24:30,867 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2922, PETRI_PLACES=457, PETRI_TRANSITIONS=584} [2025-01-09 21:24:30,868 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 119 predicate places. [2025-01-09 21:24:30,868 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 584 transitions, 2922 flow [2025-01-09 21:24:30,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 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:24:30,869 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:30,869 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:30,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 21:24:31,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 21:24:31,070 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:31,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:31,073 INFO L85 PathProgramCache]: Analyzing trace with hash 254029667, now seen corresponding path program 2 times [2025-01-09 21:24:31,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:31,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866249463] [2025-01-09 21:24:31,073 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:24:31,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:31,199 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1216 statements into 2 equivalence classes. [2025-01-09 21:24:31,203 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1216 statements. [2025-01-09 21:24:31,204 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:24:31,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:31,357 INFO L134 CoverageAnalysis]: Checked inductivity of 5570 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5570 trivial. 0 not checked. [2025-01-09 21:24:31,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:31,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866249463] [2025-01-09 21:24:31,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866249463] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:31,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:31,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:31,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1407892415] [2025-01-09 21:24:31,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:31,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:31,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:31,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:31,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:31,671 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-01-09 21:24:31,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 584 transitions, 2922 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 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:24:31,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:31,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-01-09 21:24:31,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:32,797 INFO L124 PetriNetUnfolderBase]: 807/4237 cut-off events. [2025-01-09 21:24:32,797 INFO L125 PetriNetUnfolderBase]: For 3426/3601 co-relation queries the response was YES. [2025-01-09 21:24:32,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8934 conditions, 4237 events. 807/4237 cut-off events. For 3426/3601 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22262 event pairs, 65 based on Foata normal form. 52/4124 useless extension candidates. Maximal degree in co-relation 8663. Up to 1323 conditions per place. [2025-01-09 21:24:32,813 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 251 selfloop transitions, 131 changer transitions 5/722 dead transitions. [2025-01-09 21:24:32,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 722 transitions, 4596 flow [2025-01-09 21:24:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:32,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-01-09 21:24:32,815 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-01-09 21:24:32,815 INFO L175 Difference]: Start difference. First operand has 457 places, 584 transitions, 2922 flow. Second operand 6 states and 1806 transitions. [2025-01-09 21:24:32,815 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 722 transitions, 4596 flow [2025-01-09 21:24:32,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 722 transitions, 4550 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:24:32,830 INFO L231 Difference]: Finished difference. Result has 449 places, 712 transitions, 4356 flow [2025-01-09 21:24:32,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4356, PETRI_PLACES=449, PETRI_TRANSITIONS=712} [2025-01-09 21:24:32,831 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 111 predicate places. [2025-01-09 21:24:32,831 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 712 transitions, 4356 flow [2025-01-09 21:24:32,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 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:24:32,832 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:32,832 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:32,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 21:24:32,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:32,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:32,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1303311258, now seen corresponding path program 1 times [2025-01-09 21:24:32,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:32,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281101756] [2025-01-09 21:24:32,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:32,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:32,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1217 statements into 1 equivalence classes. [2025-01-09 21:24:33,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1217 of 1217 statements. [2025-01-09 21:24:33,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:33,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:24:35,761 INFO L134 CoverageAnalysis]: Checked inductivity of 5570 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5570 trivial. 0 not checked. [2025-01-09 21:24:35,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:24:35,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281101756] [2025-01-09 21:24:35,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281101756] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:24:35,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:24:35,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:24:35,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977558966] [2025-01-09 21:24:35,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:24:35,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:24:35,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:24:35,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:24:35,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:24:35,978 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 339 [2025-01-09 21:24:35,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 712 transitions, 4356 flow. Second operand has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 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:24:35,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:35,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 339 [2025-01-09 21:24:35,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:37,701 INFO L124 PetriNetUnfolderBase]: 1309/5605 cut-off events. [2025-01-09 21:24:37,701 INFO L125 PetriNetUnfolderBase]: For 4997/5054 co-relation queries the response was YES. [2025-01-09 21:24:37,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13621 conditions, 5605 events. 1309/5605 cut-off events. For 4997/5054 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33864 event pairs, 369 based on Foata normal form. 11/5371 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-01-09 21:24:37,724 INFO L140 encePairwiseOnDemand]: 320/339 looper letters, 316 selfloop transitions, 84 changer transitions 0/791 dead transitions. [2025-01-09 21:24:37,724 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 791 transitions, 5554 flow [2025-01-09 21:24:37,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:24:37,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:24:37,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-01-09 21:24:37,725 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8279252704031466 [2025-01-09 21:24:37,725 INFO L175 Difference]: Start difference. First operand has 449 places, 712 transitions, 4356 flow. Second operand 6 states and 1684 transitions. [2025-01-09 21:24:37,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 791 transitions, 5554 flow [2025-01-09 21:24:37,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 791 transitions, 5300 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-01-09 21:24:37,747 INFO L231 Difference]: Finished difference. Result has 458 places, 783 transitions, 4892 flow [2025-01-09 21:24:37,748 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=4108, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4892, PETRI_PLACES=458, PETRI_TRANSITIONS=783} [2025-01-09 21:24:37,748 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 120 predicate places. [2025-01-09 21:24:37,748 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 783 transitions, 4892 flow [2025-01-09 21:24:37,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 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:24:37,749 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:37,749 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:37,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:24:37,749 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-01-09 21:24:37,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:37,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1939858401, now seen corresponding path program 1 times [2025-01-09 21:24:37,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:37,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694381215] [2025-01-09 21:24:37,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:24:37,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:37,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-01-09 21:24:40,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-01-09 21:24:40,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:40,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:12,500 INFO L134 CoverageAnalysis]: Checked inductivity of 5570 backedges. 1980 proven. 3200 refuted. 0 times theorem prover too weak. 390 trivial. 0 not checked. [2025-01-09 21:25:12,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:25:12,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694381215] [2025-01-09 21:25:12,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694381215] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:25:12,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1015400283] [2025-01-09 21:25:12,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:25:12,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:25:12,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:25:12,503 INFO L229 MonitoredProcess]: Starting monitored process 8 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:25:12,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 21:25:13,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-01-09 21:25:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-01-09 21:25:13,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:25:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:25:13,757 INFO L256 TraceCheckSpWp]: Trace formula consists of 4610 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-09 21:25:13,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:25:14,118 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-01-09 21:25:14,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-01-09 21:25:14,288 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-01-09 21:25:14,288 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-01-09 21:25:14,899 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 21:25:14,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 21:25:15,209 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2025-01-09 21:25:15,209 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 28 [2025-01-09 21:25:15,743 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-01-09 21:25:15,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-01-09 21:25:16,213 INFO L349 Elim1Store]: treesize reduction 54, result has 34.1 percent of original size [2025-01-09 21:25:16,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 27 treesize of output 45 [2025-01-09 21:25:17,548 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:17,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:18,307 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:18,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:19,549 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:19,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:20,273 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-01-09 21:25:20,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-01-09 21:25:21,585 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:21,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:22,377 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:22,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:23,653 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:23,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:24,314 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-01-09 21:25:24,314 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-01-09 21:25:25,549 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:25,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:26,197 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:26,197 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:27,439 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:27,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:28,183 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:28,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:29,414 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:29,414 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:30,085 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-01-09 21:25:30,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-01-09 21:25:31,643 INFO L349 Elim1Store]: treesize reduction 16, result has 51.5 percent of original size [2025-01-09 21:25:31,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 32 [2025-01-09 21:25:31,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-01-09 21:25:31,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 21:25:31,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:25:31,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-01-09 21:25:31,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:25:31,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-01-09 21:25:31,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-01-09 21:25:31,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5570 backedges. 2237 proven. 5 refuted. 0 times theorem prover too weak. 3328 trivial. 0 not checked. [2025-01-09 21:25:31,897 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:25:31,916 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0)) 0)) (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse0)) 0)) (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 3 .cse0)) 0)))) is different from false [2025-01-09 21:25:31,932 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)) (forall ((v_ArrVal_9847 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) .cse2))) (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_9847 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_9847) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)))))) is different from false