./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.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/06-symbeq_08-tricky_address3.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 a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 21:22:39,522 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 21:22:39,566 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:22:39,576 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 21:22:39,580 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 21:22:39,610 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 21:22:39,610 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 21:22:39,610 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 21:22:39,611 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 21:22:39,611 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 21:22:39,611 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 21:22:39,611 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 21:22:39,611 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 21:22:39,611 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 21:22:39,611 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 21:22:39,612 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:39,612 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 21:22:39,612 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:39,612 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 21:22:39,613 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 21:22:39,613 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 -> a812aad62102b8bb20af57f89ce6dbf7fb9ee1fa63f6f8ecf164ccf61d0713cb [2025-01-09 21:22:39,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 21:22:39,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 21:22:39,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 21:22:39,849 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 21:22:39,850 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 21:22:39,851 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-01-09 21:22:41,234 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5619933a9/928c38742b2442158deccb274a89f868/FLAG14982e201 [2025-01-09 21:22:41,528 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 21:22:41,528 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/06-symbeq_08-tricky_address3.i [2025-01-09 21:22:41,547 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5619933a9/928c38742b2442158deccb274a89f868/FLAG14982e201 [2025-01-09 21:22:41,818 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5619933a9/928c38742b2442158deccb274a89f868 [2025-01-09 21:22:41,820 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 21:22:41,822 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 21:22:41,827 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:41,827 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 21:22:41,830 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 21:22:41,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:41" (1/1) ... [2025-01-09 21:22:41,834 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a855096 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:41, skipping insertion in model container [2025-01-09 21:22:41,834 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:22:41" (1/1) ... [2025-01-09 21:22:41,865 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 21:22:42,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:42,189 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 21:22:42,226 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 21:22:42,265 INFO L204 MainTranslator]: Completed translation [2025-01-09 21:22:42,267 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42 WrapperNode [2025-01-09 21:22:42,267 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 21:22:42,268 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:42,268 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 21:22:42,268 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 21:22:42,273 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:22:42" (1/1) ... [2025-01-09 21:22:42,293 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:22:42" (1/1) ... [2025-01-09 21:22:42,312 INFO L138 Inliner]: procedures = 265, calls = 74, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 151 [2025-01-09 21:22:42,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 21:22:42,313 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 21:22:42,313 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 21:22:42,313 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 21:22:42,319 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,319 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,322 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,338 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,339 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,346 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,350 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,352 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 21:22:42,353 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 21:22:42,353 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 21:22:42,353 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 21:22:42,354 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (1/1) ... [2025-01-09 21:22:42,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 21:22:42,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:42,392 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:22:42,394 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:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-01-09 21:22:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-09 21:22:42,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 21:22:42,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 21:22:42,411 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:22:42,491 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 21:22:42,492 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 21:22:42,682 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-09 21:22:42,682 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 21:22:42,706 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 21:22:42,706 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 21:22:42,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:42 BoogieIcfgContainer [2025-01-09 21:22:42,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 21:22:42,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 21:22:42,714 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 21:22:42,721 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 21:22:42,721 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:22:41" (1/3) ... [2025-01-09 21:22:42,722 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d899ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:42, skipping insertion in model container [2025-01-09 21:22:42,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:22:42" (2/3) ... [2025-01-09 21:22:42,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d899ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:22:42, skipping insertion in model container [2025-01-09 21:22:42,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:22:42" (3/3) ... [2025-01-09 21:22:42,728 INFO L128 eAbstractionObserver]: Analyzing ICFG 06-symbeq_08-tricky_address3.i [2025-01-09 21:22:42,751 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 21:22:42,756 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 06-symbeq_08-tricky_address3.i that has 2 procedures, 161 locations, 1 initial locations, 1 loop locations, and 4 error locations. [2025-01-09 21:22:42,757 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-09 21:22:42,835 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-01-09 21:22:42,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 164 places, 163 transitions, 330 flow [2025-01-09 21:22:42,945 INFO L124 PetriNetUnfolderBase]: 3/162 cut-off events. [2025-01-09 21:22:42,947 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:42,953 INFO L83 FinitePrefix]: Finished finitePrefix Result has 166 conditions, 162 events. 3/162 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 79 event pairs, 0 based on Foata normal form. 0/155 useless extension candidates. Maximal degree in co-relation 90. Up to 2 conditions per place. [2025-01-09 21:22:42,953 INFO L82 GeneralOperation]: Start removeDead. Operand has 164 places, 163 transitions, 330 flow [2025-01-09 21:22:42,959 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 163 places, 162 transitions, 327 flow [2025-01-09 21:22:42,967 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 21:22:42,975 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;@7ebe1341, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 21:22:42,976 INFO L334 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2025-01-09 21:22:42,999 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-01-09 21:22:43,002 INFO L124 PetriNetUnfolderBase]: 3/112 cut-off events. [2025-01-09 21:22:43,002 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-01-09 21:22:43,002 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:43,003 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] [2025-01-09 21:22:43,004 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:43,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:43,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1944549468, now seen corresponding path program 1 times [2025-01-09 21:22:43,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:43,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392369] [2025-01-09 21:22:43,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:43,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:43,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 21:22:43,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 21:22:43,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:43,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,308 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:22:43,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:43,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392369] [2025-01-09 21:22:43,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:43,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:43,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 21:22:43,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873445894] [2025-01-09 21:22:43,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:43,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 21:22:43,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:43,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 21:22:43,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 21:22:43,352 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 150 out of 163 [2025-01-09 21:22:43,355 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 162 transitions, 327 flow. Second operand has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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:22:43,355 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:43,355 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 150 of 163 [2025-01-09 21:22:43,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:43,417 INFO L124 PetriNetUnfolderBase]: 7/224 cut-off events. [2025-01-09 21:22:43,418 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:43,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 224 events. 7/224 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 329 event pairs, 6 based on Foata normal form. 5/217 useless extension candidates. Maximal degree in co-relation 147. Up to 24 conditions per place. [2025-01-09 21:22:43,420 INFO L140 encePairwiseOnDemand]: 158/163 looper letters, 10 selfloop transitions, 2 changer transitions 1/161 dead transitions. [2025-01-09 21:22:43,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 165 places, 161 transitions, 349 flow [2025-01-09 21:22:43,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 21:22:43,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-01-09 21:22:43,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 465 transitions. [2025-01-09 21:22:43,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950920245398773 [2025-01-09 21:22:43,432 INFO L175 Difference]: Start difference. First operand has 163 places, 162 transitions, 327 flow. Second operand 3 states and 465 transitions. [2025-01-09 21:22:43,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 165 places, 161 transitions, 349 flow [2025-01-09 21:22:43,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 164 places, 161 transitions, 348 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:43,440 INFO L231 Difference]: Finished difference. Result has 165 places, 160 transitions, 332 flow [2025-01-09 21:22:43,442 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=162, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=158, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=165, PETRI_TRANSITIONS=160} [2025-01-09 21:22:43,444 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 2 predicate places. [2025-01-09 21:22:43,445 INFO L471 AbstractCegarLoop]: Abstraction has has 165 places, 160 transitions, 332 flow [2025-01-09 21:22:43,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 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:22:43,446 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:43,446 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:22:43,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 21:22:43,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:43,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:43,448 INFO L85 PathProgramCache]: Analyzing trace with hash 1977463037, now seen corresponding path program 1 times [2025-01-09 21:22:43,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:43,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987885761] [2025-01-09 21:22:43,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:43,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:43,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:22:43,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:22:43,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:43,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,652 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:22:43,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:43,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987885761] [2025-01-09 21:22:43,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987885761] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:43,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [62544737] [2025-01-09 21:22:43,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:43,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:43,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:43,659 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:22:43,662 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:22:43,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 21:22:43,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 21:22:43,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:43,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:43,754 INFO L256 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 21:22:43,757 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:43,810 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:22:43,813 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:43,857 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:22:43,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [62544737] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:43,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:43,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-01-09 21:22:43,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303238546] [2025-01-09 21:22:43,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:43,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:22:43,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:43,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:22:43,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:22:43,889 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-01-09 21:22:43,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 160 transitions, 332 flow. Second operand has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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:22:43,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:43,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-01-09 21:22:43,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:43,976 INFO L124 PetriNetUnfolderBase]: 7/230 cut-off events. [2025-01-09 21:22:43,976 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-01-09 21:22:43,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 277 conditions, 230 events. 7/230 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 322 event pairs, 6 based on Foata normal form. 2/221 useless extension candidates. Maximal degree in co-relation 194. Up to 24 conditions per place. [2025-01-09 21:22:43,977 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 14 selfloop transitions, 9 changer transitions 0/168 dead transitions. [2025-01-09 21:22:43,978 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 168 transitions, 396 flow [2025-01-09 21:22:43,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:22:43,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:22:43,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1348 transitions. [2025-01-09 21:22:43,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9188820722563054 [2025-01-09 21:22:43,981 INFO L175 Difference]: Start difference. First operand has 165 places, 160 transitions, 332 flow. Second operand 9 states and 1348 transitions. [2025-01-09 21:22:43,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 168 transitions, 396 flow [2025-01-09 21:22:43,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 168 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:43,983 INFO L231 Difference]: Finished difference. Result has 174 places, 166 transitions, 380 flow [2025-01-09 21:22:43,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=330, PETRI_DIFFERENCE_MINUEND_PLACES=163, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=160, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=380, PETRI_PLACES=174, PETRI_TRANSITIONS=166} [2025-01-09 21:22:43,984 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 11 predicate places. [2025-01-09 21:22:43,984 INFO L471 AbstractCegarLoop]: Abstraction has has 174 places, 166 transitions, 380 flow [2025-01-09 21:22:43,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 149.0) internal successors, (1490), 10 states have internal predecessors, (1490), 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:22:43,985 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:43,985 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] [2025-01-09 21:22:43,993 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:22:44,190 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:22:44,191 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:44,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:44,194 INFO L85 PathProgramCache]: Analyzing trace with hash 288053341, now seen corresponding path program 2 times [2025-01-09 21:22:44,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:44,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864631260] [2025-01-09 21:22:44,194 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:44,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:44,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 109 statements into 2 equivalence classes. [2025-01-09 21:22:44,231 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 94 of 109 statements. [2025-01-09 21:22:44,231 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:44,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:44,700 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:22:44,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:44,701 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864631260] [2025-01-09 21:22:44,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864631260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:44,701 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:44,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:44,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310974063] [2025-01-09 21:22:44,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:44,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:44,702 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:44,702 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:44,702 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:45,174 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 137 out of 163 [2025-01-09 21:22:45,175 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 166 transitions, 380 flow. Second operand has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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:22:45,175 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:45,175 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 137 of 163 [2025-01-09 21:22:45,175 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:45,323 INFO L124 PetriNetUnfolderBase]: 103/535 cut-off events. [2025-01-09 21:22:45,323 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-01-09 21:22:45,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 801 conditions, 535 events. 103/535 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2282 event pairs, 40 based on Foata normal form. 0/499 useless extension candidates. Maximal degree in co-relation 688. Up to 184 conditions per place. [2025-01-09 21:22:45,326 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 31 selfloop transitions, 22 changer transitions 0/195 dead transitions. [2025-01-09 21:22:45,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 195 transitions, 544 flow [2025-01-09 21:22:45,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:45,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:45,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 876 transitions. [2025-01-09 21:22:45,341 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8957055214723927 [2025-01-09 21:22:45,341 INFO L175 Difference]: Start difference. First operand has 174 places, 166 transitions, 380 flow. Second operand 6 states and 876 transitions. [2025-01-09 21:22:45,341 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 195 transitions, 544 flow [2025-01-09 21:22:45,343 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 195 transitions, 538 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-01-09 21:22:45,345 INFO L231 Difference]: Finished difference. Result has 183 places, 187 transitions, 524 flow [2025-01-09 21:22:45,345 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=374, PETRI_DIFFERENCE_MINUEND_PLACES=173, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=166, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=156, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=524, PETRI_PLACES=183, PETRI_TRANSITIONS=187} [2025-01-09 21:22:45,346 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 20 predicate places. [2025-01-09 21:22:45,346 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 187 transitions, 524 flow [2025-01-09 21:22:45,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 138.66666666666666) internal successors, (832), 6 states have internal predecessors, (832), 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:22:45,346 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:45,346 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] [2025-01-09 21:22:45,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 21:22:45,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:45,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:45,347 INFO L85 PathProgramCache]: Analyzing trace with hash 614372559, now seen corresponding path program 1 times [2025-01-09 21:22:45,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:45,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126872265] [2025-01-09 21:22:45,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:45,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:22:45,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:22:45,364 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,364 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,476 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:22:45,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:45,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126872265] [2025-01-09 21:22:45,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126872265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:45,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184305181] [2025-01-09 21:22:45,477 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:45,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:45,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:45,479 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:22:45,480 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:22:45,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 21:22:45,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 21:22:45,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:45,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:45,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 21:22:45,555 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:45,587 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:22:45,588 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:45,661 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:22:45,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184305181] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:45,661 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:45,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-01-09 21:22:45,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769001057] [2025-01-09 21:22:45,661 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:45,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 21:22:45,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:45,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 21:22:45,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-09 21:22:45,684 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-01-09 21:22:45,687 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 187 transitions, 524 flow. Second operand has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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:22:45,687 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:45,687 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-01-09 21:22:45,687 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:45,856 INFO L124 PetriNetUnfolderBase]: 35/396 cut-off events. [2025-01-09 21:22:45,856 INFO L125 PetriNetUnfolderBase]: For 57/62 co-relation queries the response was YES. [2025-01-09 21:22:45,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 667 conditions, 396 events. 35/396 cut-off events. For 57/62 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 1160 event pairs, 11 based on Foata normal form. 4/384 useless extension candidates. Maximal degree in co-relation 479. Up to 51 conditions per place. [2025-01-09 21:22:45,858 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 18 selfloop transitions, 21 changer transitions 0/205 dead transitions. [2025-01-09 21:22:45,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 205 transitions, 690 flow [2025-01-09 21:22:45,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:22:45,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:22:45,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3130 transitions. [2025-01-09 21:22:45,863 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9144025708442887 [2025-01-09 21:22:45,863 INFO L175 Difference]: Start difference. First operand has 183 places, 187 transitions, 524 flow. Second operand 21 states and 3130 transitions. [2025-01-09 21:22:45,863 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 205 transitions, 690 flow [2025-01-09 21:22:45,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 205 transitions, 690 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:45,868 INFO L231 Difference]: Finished difference. Result has 208 places, 200 transitions, 654 flow [2025-01-09 21:22:45,868 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=524, PETRI_DIFFERENCE_MINUEND_PLACES=183, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=187, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=176, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=654, PETRI_PLACES=208, PETRI_TRANSITIONS=200} [2025-01-09 21:22:45,868 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 45 predicate places. [2025-01-09 21:22:45,869 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 200 transitions, 654 flow [2025-01-09 21:22:45,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 149.0) internal successors, (2682), 18 states have internal predecessors, (2682), 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:22:45,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:45,870 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] [2025-01-09 21:22:45,877 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:22:46,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:46,074 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:46,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:46,075 INFO L85 PathProgramCache]: Analyzing trace with hash 505936783, now seen corresponding path program 2 times [2025-01-09 21:22:46,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:46,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172439439] [2025-01-09 21:22:46,076 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:46,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:46,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 137 statements into 2 equivalence classes. [2025-01-09 21:22:46,103 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 102 of 137 statements. [2025-01-09 21:22:46,103 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:46,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:46,499 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:22:46,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:46,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172439439] [2025-01-09 21:22:46,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172439439] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:46,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:46,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:46,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002998479] [2025-01-09 21:22:46,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:46,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:46,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:46,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:46,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:46,930 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 163 [2025-01-09 21:22:46,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 200 transitions, 654 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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:22:46,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:46,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 163 [2025-01-09 21:22:46,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:47,118 INFO L124 PetriNetUnfolderBase]: 223/897 cut-off events. [2025-01-09 21:22:47,118 INFO L125 PetriNetUnfolderBase]: For 188/194 co-relation queries the response was YES. [2025-01-09 21:22:47,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1768 conditions, 897 events. 223/897 cut-off events. For 188/194 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 4715 event pairs, 82 based on Foata normal form. 5/843 useless extension candidates. Maximal degree in co-relation 1571. Up to 407 conditions per place. [2025-01-09 21:22:47,125 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 53 selfloop transitions, 39 changer transitions 5/245 dead transitions. [2025-01-09 21:22:47,125 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 213 places, 245 transitions, 968 flow [2025-01-09 21:22:47,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:47,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:47,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 862 transitions. [2025-01-09 21:22:47,127 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8813905930470347 [2025-01-09 21:22:47,127 INFO L175 Difference]: Start difference. First operand has 208 places, 200 transitions, 654 flow. Second operand 6 states and 862 transitions. [2025-01-09 21:22:47,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 213 places, 245 transitions, 968 flow [2025-01-09 21:22:47,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 207 places, 245 transitions, 944 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-01-09 21:22:47,135 INFO L231 Difference]: Finished difference. Result has 212 places, 236 transitions, 918 flow [2025-01-09 21:22:47,136 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=630, PETRI_DIFFERENCE_MINUEND_PLACES=202, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=200, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=185, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=918, PETRI_PLACES=212, PETRI_TRANSITIONS=236} [2025-01-09 21:22:47,137 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 49 predicate places. [2025-01-09 21:22:47,139 INFO L471 AbstractCegarLoop]: Abstraction has has 212 places, 236 transitions, 918 flow [2025-01-09 21:22:47,139 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 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:22:47,139 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:47,139 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:22:47,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 21:22:47,139 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:47,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:47,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1719928748, now seen corresponding path program 1 times [2025-01-09 21:22:47,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:47,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374129530] [2025-01-09 21:22:47,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:47,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:47,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:22:47,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:22:47,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:47,166 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:47,418 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:22:47,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374129530] [2025-01-09 21:22:47,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374129530] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:22:47,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741219500] [2025-01-09 21:22:47,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:47,418 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:47,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:22:47,424 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:22:47,431 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:22:47,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 21:22:47,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 21:22:47,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:47,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:47,510 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 21:22:47,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:22:47,588 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:22:47,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:22:47,765 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:22:47,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741219500] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 21:22:47,766 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 21:22:47,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-09 21:22:47,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633145891] [2025-01-09 21:22:47,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 21:22:47,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 21:22:47,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:47,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 21:22:47,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-01-09 21:22:47,794 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 163 [2025-01-09 21:22:47,797 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 212 places, 236 transitions, 918 flow. Second operand has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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:22:47,797 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:47,797 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 163 [2025-01-09 21:22:47,797 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:48,110 INFO L124 PetriNetUnfolderBase]: 123/670 cut-off events. [2025-01-09 21:22:48,110 INFO L125 PetriNetUnfolderBase]: For 316/321 co-relation queries the response was YES. [2025-01-09 21:22:48,112 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1414 conditions, 670 events. 123/670 cut-off events. For 316/321 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2925 event pairs, 15 based on Foata normal form. 3/645 useless extension candidates. Maximal degree in co-relation 1138. Up to 118 conditions per place. [2025-01-09 21:22:48,114 INFO L140 encePairwiseOnDemand]: 157/163 looper letters, 21 selfloop transitions, 30 changer transitions 0/253 dead transitions. [2025-01-09 21:22:48,114 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 253 transitions, 1142 flow [2025-01-09 21:22:48,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-01-09 21:22:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-01-09 21:22:48,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 4464 transitions. [2025-01-09 21:22:48,121 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.912883435582822 [2025-01-09 21:22:48,121 INFO L175 Difference]: Start difference. First operand has 212 places, 236 transitions, 918 flow. Second operand 30 states and 4464 transitions. [2025-01-09 21:22:48,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 253 transitions, 1142 flow [2025-01-09 21:22:48,125 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 253 transitions, 1110 flow, removed 16 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:48,129 INFO L231 Difference]: Finished difference. Result has 244 places, 246 transitions, 1038 flow [2025-01-09 21:22:48,129 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=886, PETRI_DIFFERENCE_MINUEND_PLACES=211, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=213, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1038, PETRI_PLACES=244, PETRI_TRANSITIONS=246} [2025-01-09 21:22:48,131 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 81 predicate places. [2025-01-09 21:22:48,131 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 246 transitions, 1038 flow [2025-01-09 21:22:48,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 149.08695652173913) internal successors, (3429), 23 states have internal predecessors, (3429), 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:22:48,133 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:48,133 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] [2025-01-09 21:22:48,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 21:22:48,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:22:48,338 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:48,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:48,339 INFO L85 PathProgramCache]: Analyzing trace with hash -351702443, now seen corresponding path program 2 times [2025-01-09 21:22:48,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:48,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1132703623] [2025-01-09 21:22:48,340 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:48,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:48,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 157 statements into 2 equivalence classes. [2025-01-09 21:22:48,361 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 157 statements. [2025-01-09 21:22:48,361 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:48,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:48,626 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:22:48,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:48,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1132703623] [2025-01-09 21:22:48,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1132703623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:48,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:48,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:48,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451363764] [2025-01-09 21:22:48,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:48,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:48,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:48,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:48,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:48,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 163 [2025-01-09 21:22:48,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 246 transitions, 1038 flow. Second operand has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:48,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:48,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 163 [2025-01-09 21:22:48,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:48,885 INFO L124 PetriNetUnfolderBase]: 212/934 cut-off events. [2025-01-09 21:22:48,886 INFO L125 PetriNetUnfolderBase]: For 573/624 co-relation queries the response was YES. [2025-01-09 21:22:48,888 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2194 conditions, 934 events. 212/934 cut-off events. For 573/624 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 4939 event pairs, 40 based on Foata normal form. 3/919 useless extension candidates. Maximal degree in co-relation 1917. Up to 338 conditions per place. [2025-01-09 21:22:48,890 INFO L140 encePairwiseOnDemand]: 152/163 looper letters, 72 selfloop transitions, 40 changer transitions 0/285 dead transitions. [2025-01-09 21:22:48,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 285 transitions, 1446 flow [2025-01-09 21:22:48,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:48,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 891 transitions. [2025-01-09 21:22:48,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.911042944785276 [2025-01-09 21:22:48,893 INFO L175 Difference]: Start difference. First operand has 244 places, 246 transitions, 1038 flow. Second operand 6 states and 891 transitions. [2025-01-09 21:22:48,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 285 transitions, 1446 flow [2025-01-09 21:22:48,897 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 285 transitions, 1400 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-01-09 21:22:48,900 INFO L231 Difference]: Finished difference. Result has 236 places, 277 transitions, 1360 flow [2025-01-09 21:22:48,900 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=992, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=246, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1360, PETRI_PLACES=236, PETRI_TRANSITIONS=277} [2025-01-09 21:22:48,901 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 73 predicate places. [2025-01-09 21:22:48,901 INFO L471 AbstractCegarLoop]: Abstraction has has 236 places, 277 transitions, 1360 flow [2025-01-09 21:22:48,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 141.33333333333334) internal successors, (848), 6 states have internal predecessors, (848), 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:22:48,901 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:48,902 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] [2025-01-09 21:22:48,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 21:22:48,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:48,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:48,903 INFO L85 PathProgramCache]: Analyzing trace with hash -1459727782, now seen corresponding path program 1 times [2025-01-09 21:22:48,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:48,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608335356] [2025-01-09 21:22:48,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:48,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:48,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 21:22:48,922 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 21:22:48,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:48,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:49,267 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:22:49,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:49,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608335356] [2025-01-09 21:22:49,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608335356] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:49,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:49,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 21:22:49,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599164701] [2025-01-09 21:22:49,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:49,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 21:22:49,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:49,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 21:22:49,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 21:22:49,362 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 134 out of 163 [2025-01-09 21:22:49,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 236 places, 277 transitions, 1360 flow. Second operand has 6 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 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:22:49,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:49,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 134 of 163 [2025-01-09 21:22:49,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:49,612 INFO L124 PetriNetUnfolderBase]: 361/1334 cut-off events. [2025-01-09 21:22:49,613 INFO L125 PetriNetUnfolderBase]: For 1455/1499 co-relation queries the response was YES. [2025-01-09 21:22:49,615 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3673 conditions, 1334 events. 361/1334 cut-off events. For 1455/1499 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 7924 event pairs, 87 based on Foata normal form. 2/1300 useless extension candidates. Maximal degree in co-relation 3413. Up to 610 conditions per place. [2025-01-09 21:22:49,618 INFO L140 encePairwiseOnDemand]: 148/163 looper letters, 100 selfloop transitions, 64 changer transitions 10/338 dead transitions. [2025-01-09 21:22:49,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 338 transitions, 2048 flow [2025-01-09 21:22:49,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 21:22:49,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-01-09 21:22:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 877 transitions. [2025-01-09 21:22:49,620 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8967280163599182 [2025-01-09 21:22:49,620 INFO L175 Difference]: Start difference. First operand has 236 places, 277 transitions, 1360 flow. Second operand 6 states and 877 transitions. [2025-01-09 21:22:49,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 338 transitions, 2048 flow [2025-01-09 21:22:49,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 338 transitions, 2030 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:49,631 INFO L231 Difference]: Finished difference. Result has 246 places, 324 transitions, 1928 flow [2025-01-09 21:22:49,632 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1342, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=240, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1928, PETRI_PLACES=246, PETRI_TRANSITIONS=324} [2025-01-09 21:22:49,632 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 83 predicate places. [2025-01-09 21:22:49,632 INFO L471 AbstractCegarLoop]: Abstraction has has 246 places, 324 transitions, 1928 flow [2025-01-09 21:22:49,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.33333333333334) internal successors, (818), 6 states have internal predecessors, (818), 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:22:49,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:49,633 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] [2025-01-09 21:22:49,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 21:22:49,633 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:49,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:49,634 INFO L85 PathProgramCache]: Analyzing trace with hash -882247298, now seen corresponding path program 1 times [2025-01-09 21:22:49,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:49,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658568977] [2025-01-09 21:22:49,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:22:49,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:49,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:22:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:22:49,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:22:49,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:22:55,991 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:22:55,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:22:55,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658568977] [2025-01-09 21:22:55,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658568977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:22:55,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:22:55,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 21:22:55,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762377500] [2025-01-09 21:22:55,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:22:55,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 21:22:55,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:22:55,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 21:22:55,995 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-01-09 21:22:58,387 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 163 [2025-01-09 21:22:58,389 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 324 transitions, 1928 flow. Second operand has 15 states, 15 states have (on average 124.73333333333333) internal successors, (1871), 15 states have internal predecessors, (1871), 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:22:58,389 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:22:58,389 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 163 [2025-01-09 21:22:58,389 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:22:59,564 INFO L124 PetriNetUnfolderBase]: 461/1620 cut-off events. [2025-01-09 21:22:59,564 INFO L125 PetriNetUnfolderBase]: For 3071/3195 co-relation queries the response was YES. [2025-01-09 21:22:59,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5227 conditions, 1620 events. 461/1620 cut-off events. For 3071/3195 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 10150 event pairs, 19 based on Foata normal form. 50/1654 useless extension candidates. Maximal degree in co-relation 4950. Up to 562 conditions per place. [2025-01-09 21:22:59,574 INFO L140 encePairwiseOnDemand]: 136/163 looper letters, 190 selfloop transitions, 84 changer transitions 47/474 dead transitions. [2025-01-09 21:22:59,575 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 474 transitions, 3660 flow [2025-01-09 21:22:59,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:22:59,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:22:59,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2352 transitions. [2025-01-09 21:22:59,579 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8016359918200409 [2025-01-09 21:22:59,579 INFO L175 Difference]: Start difference. First operand has 246 places, 324 transitions, 1928 flow. Second operand 18 states and 2352 transitions. [2025-01-09 21:22:59,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 474 transitions, 3660 flow [2025-01-09 21:22:59,592 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 474 transitions, 3574 flow, removed 43 selfloop flow, removed 0 redundant places. [2025-01-09 21:22:59,599 INFO L231 Difference]: Finished difference. Result has 271 places, 361 transitions, 2488 flow [2025-01-09 21:22:59,599 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=1854, PETRI_DIFFERENCE_MINUEND_PLACES=246, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=53, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=259, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=2488, PETRI_PLACES=271, PETRI_TRANSITIONS=361} [2025-01-09 21:22:59,600 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 108 predicate places. [2025-01-09 21:22:59,600 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 361 transitions, 2488 flow [2025-01-09 21:22:59,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 124.73333333333333) internal successors, (1871), 15 states have internal predecessors, (1871), 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:22:59,601 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:22:59,601 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] [2025-01-09 21:22:59,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 21:22:59,601 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:22:59,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:22:59,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1306055632, now seen corresponding path program 2 times [2025-01-09 21:22:59,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:22:59,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116083685] [2025-01-09 21:22:59,602 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:22:59,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:22:59,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-01-09 21:22:59,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 121 of 171 statements. [2025-01-09 21:22:59,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:22:59,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:00,152 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:23:00,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:00,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116083685] [2025-01-09 21:23:00,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116083685] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:00,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:00,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:00,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800253321] [2025-01-09 21:23:00,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:00,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:00,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:00,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:00,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:01,013 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-01-09 21:23:01,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 361 transitions, 2488 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:01,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:01,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-01-09 21:23:01,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:01,596 INFO L124 PetriNetUnfolderBase]: 456/1589 cut-off events. [2025-01-09 21:23:01,596 INFO L125 PetriNetUnfolderBase]: For 4570/4758 co-relation queries the response was YES. [2025-01-09 21:23:01,601 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5992 conditions, 1589 events. 456/1589 cut-off events. For 4570/4758 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 9874 event pairs, 88 based on Foata normal form. 105/1677 useless extension candidates. Maximal degree in co-relation 5705. Up to 662 conditions per place. [2025-01-09 21:23:01,607 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 169 selfloop transitions, 83 changer transitions 20/427 dead transitions. [2025-01-09 21:23:01,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 427 transitions, 3521 flow [2025-01-09 21:23:01,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 21:23:01,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-01-09 21:23:01,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1261 transitions. [2025-01-09 21:23:01,609 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8595773687798227 [2025-01-09 21:23:01,609 INFO L175 Difference]: Start difference. First operand has 271 places, 361 transitions, 2488 flow. Second operand 9 states and 1261 transitions. [2025-01-09 21:23:01,609 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 427 transitions, 3521 flow [2025-01-09 21:23:01,629 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 427 transitions, 3481 flow, removed 12 selfloop flow, removed 6 redundant places. [2025-01-09 21:23:01,635 INFO L231 Difference]: Finished difference. Result has 274 places, 365 transitions, 2692 flow [2025-01-09 21:23:01,635 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2453, PETRI_DIFFERENCE_MINUEND_PLACES=263, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2692, PETRI_PLACES=274, PETRI_TRANSITIONS=365} [2025-01-09 21:23:01,636 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 111 predicate places. [2025-01-09 21:23:01,636 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 365 transitions, 2692 flow [2025-01-09 21:23:01,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:01,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:01,636 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] [2025-01-09 21:23:01,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 21:23:01,636 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:01,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:01,637 INFO L85 PathProgramCache]: Analyzing trace with hash -1851445652, now seen corresponding path program 3 times [2025-01-09 21:23:01,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:01,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799896394] [2025-01-09 21:23:01,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:01,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:01,650 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:01,661 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 121 of 171 statements. [2025-01-09 21:23:01,661 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:01,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:02,291 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:23:02,292 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:02,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799896394] [2025-01-09 21:23:02,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799896394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:02,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:02,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:02,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066130033] [2025-01-09 21:23:02,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:02,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:02,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:02,293 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:02,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:03,227 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-01-09 21:23:03,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 365 transitions, 2692 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:03,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:03,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-01-09 21:23:03,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:03,885 INFO L124 PetriNetUnfolderBase]: 780/2497 cut-off events. [2025-01-09 21:23:03,885 INFO L125 PetriNetUnfolderBase]: For 9785/10001 co-relation queries the response was YES. [2025-01-09 21:23:03,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10447 conditions, 2497 events. 780/2497 cut-off events. For 9785/10001 co-relation queries the response was YES. Maximal size of possible extension queue 126. Compared 18254 event pairs, 58 based on Foata normal form. 79/2543 useless extension candidates. Maximal degree in co-relation 10157. Up to 632 conditions per place. [2025-01-09 21:23:03,904 INFO L140 encePairwiseOnDemand]: 145/163 looper letters, 348 selfloop transitions, 95 changer transitions 12/614 dead transitions. [2025-01-09 21:23:03,905 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 614 transitions, 6195 flow [2025-01-09 21:23:03,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:03,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:03,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1542 transitions. [2025-01-09 21:23:03,906 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8600111544896821 [2025-01-09 21:23:03,907 INFO L175 Difference]: Start difference. First operand has 274 places, 365 transitions, 2692 flow. Second operand 11 states and 1542 transitions. [2025-01-09 21:23:03,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 614 transitions, 6195 flow [2025-01-09 21:23:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 280 places, 614 transitions, 6045 flow, removed 2 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:03,951 INFO L231 Difference]: Finished difference. Result has 287 places, 445 transitions, 4100 flow [2025-01-09 21:23:03,952 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=2622, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=4100, PETRI_PLACES=287, PETRI_TRANSITIONS=445} [2025-01-09 21:23:03,952 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 124 predicate places. [2025-01-09 21:23:03,952 INFO L471 AbstractCegarLoop]: Abstraction has has 287 places, 445 transitions, 4100 flow [2025-01-09 21:23:03,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:03,953 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:03,953 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] [2025-01-09 21:23:03,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 21:23:03,953 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:03,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash 2142090562, now seen corresponding path program 4 times [2025-01-09 21:23:03,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:03,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052585004] [2025-01-09 21:23:03,954 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:03,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:03,964 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-01-09 21:23:03,988 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:03,988 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:03,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:05,014 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:05,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:05,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052585004] [2025-01-09 21:23:05,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052585004] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:05,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:05,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 21:23:05,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508150579] [2025-01-09 21:23:05,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:05,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 21:23:05,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:05,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 21:23:05,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2025-01-09 21:23:06,384 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 163 [2025-01-09 21:23:06,388 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 287 places, 445 transitions, 4100 flow. Second operand has 13 states, 13 states have (on average 123.15384615384616) internal successors, (1601), 13 states have internal predecessors, (1601), 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:23:06,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:06,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 163 [2025-01-09 21:23:06,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:07,607 INFO L124 PetriNetUnfolderBase]: 1242/3817 cut-off events. [2025-01-09 21:23:07,607 INFO L125 PetriNetUnfolderBase]: For 19212/19520 co-relation queries the response was YES. [2025-01-09 21:23:07,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16838 conditions, 3817 events. 1242/3817 cut-off events. For 19212/19520 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 30928 event pairs, 173 based on Foata normal form. 91/3865 useless extension candidates. Maximal degree in co-relation 16541. Up to 1434 conditions per place. [2025-01-09 21:23:07,634 INFO L140 encePairwiseOnDemand]: 139/163 looper letters, 454 selfloop transitions, 128 changer transitions 17/750 dead transitions. [2025-01-09 21:23:07,634 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 750 transitions, 8561 flow [2025-01-09 21:23:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 21:23:07,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-01-09 21:23:07,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2757 transitions. [2025-01-09 21:23:07,636 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8054338299737073 [2025-01-09 21:23:07,636 INFO L175 Difference]: Start difference. First operand has 287 places, 445 transitions, 4100 flow. Second operand 21 states and 2757 transitions. [2025-01-09 21:23:07,636 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 750 transitions, 8561 flow [2025-01-09 21:23:07,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 307 places, 750 transitions, 8499 flow, removed 31 selfloop flow, removed 0 redundant places. [2025-01-09 21:23:07,712 INFO L231 Difference]: Finished difference. Result has 319 places, 532 transitions, 5869 flow [2025-01-09 21:23:07,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=4052, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=344, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=5869, PETRI_PLACES=319, PETRI_TRANSITIONS=532} [2025-01-09 21:23:07,714 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 156 predicate places. [2025-01-09 21:23:07,714 INFO L471 AbstractCegarLoop]: Abstraction has has 319 places, 532 transitions, 5869 flow [2025-01-09 21:23:07,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 123.15384615384616) internal successors, (1601), 13 states have internal predecessors, (1601), 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:23:07,714 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:07,715 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] [2025-01-09 21:23:07,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 21:23:07,715 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:07,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:07,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1170776066, now seen corresponding path program 5 times [2025-01-09 21:23:07,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:07,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239012045] [2025-01-09 21:23:07,716 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:07,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:07,725 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:07,744 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:07,744 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-09 21:23:07,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:08,512 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:08,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:08,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239012045] [2025-01-09 21:23:08,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239012045] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:08,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:08,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:08,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207708184] [2025-01-09 21:23:08,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:08,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:08,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:08,515 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:08,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:09,216 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-01-09 21:23:09,217 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 319 places, 532 transitions, 5869 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:09,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:09,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-01-09 21:23:09,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:09,963 INFO L124 PetriNetUnfolderBase]: 1127/3696 cut-off events. [2025-01-09 21:23:09,963 INFO L125 PetriNetUnfolderBase]: For 23691/23968 co-relation queries the response was YES. [2025-01-09 21:23:09,983 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17398 conditions, 3696 events. 1127/3696 cut-off events. For 23691/23968 co-relation queries the response was YES. Maximal size of possible extension queue 185. Compared 30848 event pairs, 93 based on Foata normal form. 84/3741 useless extension candidates. Maximal degree in co-relation 17089. Up to 1093 conditions per place. [2025-01-09 21:23:10,004 INFO L140 encePairwiseOnDemand]: 144/163 looper letters, 352 selfloop transitions, 189 changer transitions 18/723 dead transitions. [2025-01-09 21:23:10,005 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 327 places, 723 transitions, 8893 flow [2025-01-09 21:23:10,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 21:23:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2025-01-09 21:23:10,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1432 transitions. [2025-01-09 21:23:10,010 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8785276073619632 [2025-01-09 21:23:10,010 INFO L175 Difference]: Start difference. First operand has 319 places, 532 transitions, 5869 flow. Second operand 10 states and 1432 transitions. [2025-01-09 21:23:10,010 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 327 places, 723 transitions, 8893 flow [2025-01-09 21:23:10,133 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 723 transitions, 8696 flow, removed 89 selfloop flow, removed 6 redundant places. [2025-01-09 21:23:10,142 INFO L231 Difference]: Finished difference. Result has 327 places, 562 transitions, 6856 flow [2025-01-09 21:23:10,143 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=5676, PETRI_DIFFERENCE_MINUEND_PLACES=312, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=532, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=159, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=6856, PETRI_PLACES=327, PETRI_TRANSITIONS=562} [2025-01-09 21:23:10,145 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 164 predicate places. [2025-01-09 21:23:10,145 INFO L471 AbstractCegarLoop]: Abstraction has has 327 places, 562 transitions, 6856 flow [2025-01-09 21:23:10,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:10,145 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:10,146 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] [2025-01-09 21:23:10,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 21:23:10,146 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:10,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:10,147 INFO L85 PathProgramCache]: Analyzing trace with hash 916401346, now seen corresponding path program 6 times [2025-01-09 21:23:10,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:10,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379244660] [2025-01-09 21:23:10,147 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:10,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:10,163 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:10,183 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 119 of 171 statements. [2025-01-09 21:23:10,185 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:10,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:10,696 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-01-09 21:23:10,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:10,696 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379244660] [2025-01-09 21:23:10,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379244660] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:10,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:10,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:10,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869592387] [2025-01-09 21:23:10,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:10,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:10,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:10,698 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:10,698 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:11,537 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-01-09 21:23:11,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 327 places, 562 transitions, 6856 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:11,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:11,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-01-09 21:23:11,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:12,338 INFO L124 PetriNetUnfolderBase]: 1242/3849 cut-off events. [2025-01-09 21:23:12,338 INFO L125 PetriNetUnfolderBase]: For 29946/30258 co-relation queries the response was YES. [2025-01-09 21:23:12,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19365 conditions, 3849 events. 1242/3849 cut-off events. For 29946/30258 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 31918 event pairs, 169 based on Foata normal form. 185/3986 useless extension candidates. Maximal degree in co-relation 19050. Up to 1768 conditions per place. [2025-01-09 21:23:12,364 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 234 selfloop transitions, 216 changer transitions 25/635 dead transitions. [2025-01-09 21:23:12,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 635 transitions, 8622 flow [2025-01-09 21:23:12,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 21:23:12,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-01-09 21:23:12,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1651 transitions. [2025-01-09 21:23:12,368 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8440695296523517 [2025-01-09 21:23:12,369 INFO L175 Difference]: Start difference. First operand has 327 places, 562 transitions, 6856 flow. Second operand 12 states and 1651 transitions. [2025-01-09 21:23:12,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 635 transitions, 8622 flow [2025-01-09 21:23:12,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 337 places, 635 transitions, 8415 flow, removed 99 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:12,487 INFO L231 Difference]: Finished difference. Result has 342 places, 570 transitions, 7303 flow [2025-01-09 21:23:12,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=6666, PETRI_DIFFERENCE_MINUEND_PLACES=326, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=562, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=204, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7303, PETRI_PLACES=342, PETRI_TRANSITIONS=570} [2025-01-09 21:23:12,489 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 179 predicate places. [2025-01-09 21:23:12,489 INFO L471 AbstractCegarLoop]: Abstraction has has 342 places, 570 transitions, 7303 flow [2025-01-09 21:23:12,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:12,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:12,490 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] [2025-01-09 21:23:12,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 21:23:12,490 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:12,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:12,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1618963606, now seen corresponding path program 7 times [2025-01-09 21:23:12,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:12,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299389941] [2025-01-09 21:23:12,491 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:12,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:12,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:23:12,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:12,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:12,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:21,390 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-09 21:23:21,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299389941] [2025-01-09 21:23:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299389941] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:21,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1571352498] [2025-01-09 21:23:21,391 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:23:21,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:21,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:21,393 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:23:21,394 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:23:21,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:23:21,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:21,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:21,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:21,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-01-09 21:23:21,538 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:21,779 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 16 treesize of output 12 [2025-01-09 21:23:21,946 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:21,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 15 [2025-01-09 21:23:21,987 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 15 treesize of output 11 [2025-01-09 21:23:22,033 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 28 treesize of output 27 [2025-01-09 21:23:22,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-01-09 21:23:22,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-01-09 21:23:22,294 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:22,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:22,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:22,298 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:22,301 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:22,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 65 treesize of output 73 [2025-01-09 21:23:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 214 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 21:23:22,426 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:23,518 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:23,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1571352498] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:23,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:23,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 23] total 45 [2025-01-09 21:23:23,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [174726594] [2025-01-09 21:23:23,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:23,519 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:23,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:23,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:23,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1865, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 21:23:25,706 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 163 [2025-01-09 21:23:25,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 342 places, 570 transitions, 7303 flow. Second operand has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 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:23:25,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:25,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 163 [2025-01-09 21:23:25,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:27,217 INFO L124 PetriNetUnfolderBase]: 1215/3913 cut-off events. [2025-01-09 21:23:27,217 INFO L125 PetriNetUnfolderBase]: For 31794/32008 co-relation queries the response was YES. [2025-01-09 21:23:27,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19680 conditions, 3913 events. 1215/3913 cut-off events. For 31794/32008 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 32775 event pairs, 85 based on Foata normal form. 93/3971 useless extension candidates. Maximal degree in co-relation 19422. Up to 1261 conditions per place. [2025-01-09 21:23:27,288 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 470 selfloop transitions, 123 changer transitions 34/782 dead transitions. [2025-01-09 21:23:27,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 354 places, 782 transitions, 10622 flow [2025-01-09 21:23:27,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1809 transitions. [2025-01-09 21:23:27,294 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.853704577630958 [2025-01-09 21:23:27,294 INFO L175 Difference]: Start difference. First operand has 342 places, 570 transitions, 7303 flow. Second operand 13 states and 1809 transitions. [2025-01-09 21:23:27,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 354 places, 782 transitions, 10622 flow [2025-01-09 21:23:27,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 349 places, 782 transitions, 10170 flow, removed 31 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:27,425 INFO L231 Difference]: Finished difference. Result has 354 places, 592 transitions, 7613 flow [2025-01-09 21:23:27,426 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=6909, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=570, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=7613, PETRI_PLACES=354, PETRI_TRANSITIONS=592} [2025-01-09 21:23:27,426 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 191 predicate places. [2025-01-09 21:23:27,426 INFO L471 AbstractCegarLoop]: Abstraction has has 354 places, 592 transitions, 7613 flow [2025-01-09 21:23:27,427 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 128.0) internal successors, (1408), 11 states have internal predecessors, (1408), 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:23:27,427 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:27,427 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] [2025-01-09 21:23:27,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 21:23:27,632 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,SelfDestructingSolverStorable14 [2025-01-09 21:23:27,632 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:27,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1571883052, now seen corresponding path program 8 times [2025-01-09 21:23:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680378073] [2025-01-09 21:23:27,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 21:23:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:27,647 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 171 statements into 2 equivalence classes. [2025-01-09 21:23:27,664 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 171 statements. [2025-01-09 21:23:27,664 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 21:23:27,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:30,206 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:30,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:30,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680378073] [2025-01-09 21:23:30,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680378073] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:30,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:30,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630803893] [2025-01-09 21:23:30,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:30,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:30,208 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:30,208 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:31,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-01-09 21:23:31,133 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 354 places, 592 transitions, 7613 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:31,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:31,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-01-09 21:23:31,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:32,227 INFO L124 PetriNetUnfolderBase]: 1142/3738 cut-off events. [2025-01-09 21:23:32,227 INFO L125 PetriNetUnfolderBase]: For 34039/34342 co-relation queries the response was YES. [2025-01-09 21:23:32,242 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19424 conditions, 3738 events. 1142/3738 cut-off events. For 34039/34342 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 31476 event pairs, 137 based on Foata normal form. 132/3818 useless extension candidates. Maximal degree in co-relation 19265. Up to 1558 conditions per place. [2025-01-09 21:23:32,254 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 257 selfloop transitions, 219 changer transitions 11/651 dead transitions. [2025-01-09 21:23:32,258 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 651 transitions, 9383 flow [2025-01-09 21:23:32,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 21:23:32,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2025-01-09 21:23:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1916 transitions. [2025-01-09 21:23:32,264 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8396143733567046 [2025-01-09 21:23:32,264 INFO L175 Difference]: Start difference. First operand has 354 places, 592 transitions, 7613 flow. Second operand 14 states and 1916 transitions. [2025-01-09 21:23:32,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 651 transitions, 9383 flow [2025-01-09 21:23:32,406 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 363 places, 651 transitions, 9225 flow, removed 36 selfloop flow, removed 3 redundant places. [2025-01-09 21:23:32,413 INFO L231 Difference]: Finished difference. Result has 370 places, 612 transitions, 8388 flow [2025-01-09 21:23:32,413 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=7475, PETRI_DIFFERENCE_MINUEND_PLACES=350, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=592, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=202, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=383, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=8388, PETRI_PLACES=370, PETRI_TRANSITIONS=612} [2025-01-09 21:23:32,414 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 207 predicate places. [2025-01-09 21:23:32,414 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 612 transitions, 8388 flow [2025-01-09 21:23:32,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:32,414 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:32,415 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] [2025-01-09 21:23:32,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 21:23:32,415 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:32,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:32,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1174584208, now seen corresponding path program 9 times [2025-01-09 21:23:32,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:32,416 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977294040] [2025-01-09 21:23:32,416 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 21:23:32,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:32,425 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:32,430 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 116 of 171 statements. [2025-01-09 21:23:32,430 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-01-09 21:23:32,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:33,020 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:33,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:33,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977294040] [2025-01-09 21:23:33,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977294040] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:33,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:33,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:33,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323314985] [2025-01-09 21:23:33,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:33,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:33,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:33,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:33,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:33,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-01-09 21:23:33,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 612 transitions, 8388 flow. Second operand has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:33,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:33,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-01-09 21:23:33,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:34,988 INFO L124 PetriNetUnfolderBase]: 1236/3899 cut-off events. [2025-01-09 21:23:34,989 INFO L125 PetriNetUnfolderBase]: For 38313/38590 co-relation queries the response was YES. [2025-01-09 21:23:35,011 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20891 conditions, 3899 events. 1236/3899 cut-off events. For 38313/38590 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 32501 event pairs, 138 based on Foata normal form. 110/3968 useless extension candidates. Maximal degree in co-relation 20716. Up to 1320 conditions per place. [2025-01-09 21:23:35,021 INFO L140 encePairwiseOnDemand]: 142/163 looper letters, 452 selfloop transitions, 153 changer transitions 24/789 dead transitions. [2025-01-09 21:23:35,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 380 places, 789 transitions, 11458 flow [2025-01-09 21:23:35,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:35,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:35,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1553 transitions. [2025-01-09 21:23:35,022 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8661461238148355 [2025-01-09 21:23:35,022 INFO L175 Difference]: Start difference. First operand has 370 places, 612 transitions, 8388 flow. Second operand 11 states and 1553 transitions. [2025-01-09 21:23:35,023 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 380 places, 789 transitions, 11458 flow [2025-01-09 21:23:35,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 376 places, 789 transitions, 11165 flow, removed 77 selfloop flow, removed 4 redundant places. [2025-01-09 21:23:35,193 INFO L231 Difference]: Finished difference. Result has 382 places, 626 transitions, 8824 flow [2025-01-09 21:23:35,194 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=8116, PETRI_DIFFERENCE_MINUEND_PLACES=366, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=612, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=139, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=464, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=8824, PETRI_PLACES=382, PETRI_TRANSITIONS=626} [2025-01-09 21:23:35,194 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 219 predicate places. [2025-01-09 21:23:35,194 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 626 transitions, 8824 flow [2025-01-09 21:23:35,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 129.0) internal successors, (1290), 10 states have internal predecessors, (1290), 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:23:35,195 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:35,195 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] [2025-01-09 21:23:35,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 21:23:35,195 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:35,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:35,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1829357954, now seen corresponding path program 10 times [2025-01-09 21:23:35,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:35,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966039209] [2025-01-09 21:23:35,197 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:35,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:35,211 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-01-09 21:23:35,229 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:35,233 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:35,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:36,209 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-09 21:23:36,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966039209] [2025-01-09 21:23:36,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966039209] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:36,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992555107] [2025-01-09 21:23:36,209 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-09 21:23:36,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:36,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:36,212 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:23:36,213 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:23:36,276 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 171 statements into 2 equivalence classes. [2025-01-09 21:23:36,316 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:36,316 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-09 21:23:36,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:36,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-09 21:23:36,322 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:36,562 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 16 treesize of output 12 [2025-01-09 21:23:36,599 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 15 treesize of output 11 [2025-01-09 21:23:36,707 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:36,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 15 [2025-01-09 21:23:36,752 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 28 treesize of output 27 [2025-01-09 21:23:36,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 42 [2025-01-09 21:23:36,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 57 [2025-01-09 21:23:37,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:37,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:37,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:37,010 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:37,012 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:37,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-01-09 21:23:37,022 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 226 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-09 21:23:37,023 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:38,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 49 treesize of output 47 [2025-01-09 21:23:38,172 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:38,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992555107] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:38,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:38,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14, 25] total 45 [2025-01-09 21:23:38,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777632472] [2025-01-09 21:23:38,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:38,173 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:38,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:38,173 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:38,173 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1880, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 21:23:42,996 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 163 [2025-01-09 21:23:42,997 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 626 transitions, 8824 flow. Second operand has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 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:23:42,997 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:42,997 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 163 [2025-01-09 21:23:42,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:45,374 INFO L124 PetriNetUnfolderBase]: 1268/4092 cut-off events. [2025-01-09 21:23:45,374 INFO L125 PetriNetUnfolderBase]: For 45200/45407 co-relation queries the response was YES. [2025-01-09 21:23:45,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22594 conditions, 4092 events. 1268/4092 cut-off events. For 45200/45407 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 34692 event pairs, 141 based on Foata normal form. 90/4135 useless extension candidates. Maximal degree in co-relation 22258. Up to 1587 conditions per place. [2025-01-09 21:23:45,405 INFO L140 encePairwiseOnDemand]: 141/163 looper letters, 322 selfloop transitions, 293 changer transitions 12/785 dead transitions. [2025-01-09 21:23:45,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 394 places, 785 transitions, 12569 flow [2025-01-09 21:23:45,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:23:45,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:23:45,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1783 transitions. [2025-01-09 21:23:45,409 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8414346389806513 [2025-01-09 21:23:45,409 INFO L175 Difference]: Start difference. First operand has 382 places, 626 transitions, 8824 flow. Second operand 13 states and 1783 transitions. [2025-01-09 21:23:45,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 394 places, 785 transitions, 12569 flow [2025-01-09 21:23:45,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 785 transitions, 12088 flow, removed 41 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:45,607 INFO L231 Difference]: Finished difference. Result has 396 places, 695 transitions, 10714 flow [2025-01-09 21:23:45,608 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=8438, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=626, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=370, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=10714, PETRI_PLACES=396, PETRI_TRANSITIONS=695} [2025-01-09 21:23:45,608 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 233 predicate places. [2025-01-09 21:23:45,608 INFO L471 AbstractCegarLoop]: Abstraction has has 396 places, 695 transitions, 10714 flow [2025-01-09 21:23:45,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 129.0) internal successors, (1419), 11 states have internal predecessors, (1419), 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:23:45,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:45,609 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] [2025-01-09 21:23:45,615 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 21:23:45,813 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,SelfDestructingSolverStorable17 [2025-01-09 21:23:45,813 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:45,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:45,814 INFO L85 PathProgramCache]: Analyzing trace with hash -1836170242, now seen corresponding path program 11 times [2025-01-09 21:23:45,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:45,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682165453] [2025-01-09 21:23:45,814 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-09 21:23:45,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:45,822 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:45,830 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:45,830 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-01-09 21:23:45,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:46,433 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:46,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:46,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682165453] [2025-01-09 21:23:46,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682165453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:46,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:46,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:46,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081315886] [2025-01-09 21:23:46,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:46,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:46,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:46,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:46,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:23:47,269 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-01-09 21:23:47,270 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 396 places, 695 transitions, 10714 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:47,270 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:47,270 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-01-09 21:23:47,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:48,256 INFO L124 PetriNetUnfolderBase]: 1212/3948 cut-off events. [2025-01-09 21:23:48,257 INFO L125 PetriNetUnfolderBase]: For 47248/47615 co-relation queries the response was YES. [2025-01-09 21:23:48,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22626 conditions, 3948 events. 1212/3948 cut-off events. For 47248/47615 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 33504 event pairs, 149 based on Foata normal form. 214/4103 useless extension candidates. Maximal degree in co-relation 22432. Up to 1673 conditions per place. [2025-01-09 21:23:48,287 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 293 selfloop transitions, 266 changer transitions 9/733 dead transitions. [2025-01-09 21:23:48,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 406 places, 733 transitions, 12311 flow [2025-01-09 21:23:48,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 21:23:48,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2025-01-09 21:23:48,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1528 transitions. [2025-01-09 21:23:48,291 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8522030117122141 [2025-01-09 21:23:48,292 INFO L175 Difference]: Start difference. First operand has 396 places, 695 transitions, 10714 flow. Second operand 11 states and 1528 transitions. [2025-01-09 21:23:48,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 406 places, 733 transitions, 12311 flow [2025-01-09 21:23:48,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 405 places, 733 transitions, 12158 flow, removed 72 selfloop flow, removed 1 redundant places. [2025-01-09 21:23:48,487 INFO L231 Difference]: Finished difference. Result has 407 places, 697 transitions, 11142 flow [2025-01-09 21:23:48,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=10561, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=695, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=264, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=11142, PETRI_PLACES=407, PETRI_TRANSITIONS=697} [2025-01-09 21:23:48,488 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 244 predicate places. [2025-01-09 21:23:48,488 INFO L471 AbstractCegarLoop]: Abstraction has has 407 places, 697 transitions, 11142 flow [2025-01-09 21:23:48,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:23:48,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:48,489 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] [2025-01-09 21:23:48,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 21:23:48,489 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:48,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:48,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1559958453, now seen corresponding path program 1 times [2025-01-09 21:23:48,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:48,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485409679] [2025-01-09 21:23:48,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:48,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:48,501 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:23:48,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:48,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:48,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:51,809 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 237 trivial. 0 not checked. [2025-01-09 21:23:51,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485409679] [2025-01-09 21:23:51,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485409679] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:51,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246699692] [2025-01-09 21:23:51,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 21:23:51,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:51,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 21:23:51,813 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:23:51,813 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:23:51,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:23:51,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:23:51,921 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:23:51,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:51,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 371 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-01-09 21:23:51,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 21:23:52,088 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 16 treesize of output 12 [2025-01-09 21:23:52,235 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-01-09 21:23:52,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 22 treesize of output 15 [2025-01-09 21:23:52,309 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-09 21:23:52,354 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-01-09 21:23:52,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-01-09 21:23:52,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-01-09 21:23:52,555 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:52,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:52,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 21:23:52,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 21:23:52,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 64 treesize of output 47 [2025-01-09 21:23:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 197 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-09 21:23:52,573 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 21:23:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246699692] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 21:23:53,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 21:23:53,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [12, 21] total 39 [2025-01-09 21:23:53,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990014575] [2025-01-09 21:23:53,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:53,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 21:23:53,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:53,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 21:23:53,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1369, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 21:23:56,502 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 163 [2025-01-09 21:23:56,504 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 407 places, 697 transitions, 11142 flow. Second operand has 11 states, 11 states have (on average 134.45454545454547) internal successors, (1479), 11 states have internal predecessors, (1479), 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:23:56,504 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:23:56,504 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 163 [2025-01-09 21:23:56,504 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:23:58,509 INFO L124 PetriNetUnfolderBase]: 1034/3571 cut-off events. [2025-01-09 21:23:58,510 INFO L125 PetriNetUnfolderBase]: For 50371/50696 co-relation queries the response was YES. [2025-01-09 21:23:58,532 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21194 conditions, 3571 events. 1034/3571 cut-off events. For 50371/50696 co-relation queries the response was YES. Maximal size of possible extension queue 178. Compared 30181 event pairs, 60 based on Foata normal form. 56/3603 useless extension candidates. Maximal degree in co-relation 20849. Up to 858 conditions per place. [2025-01-09 21:23:58,541 INFO L140 encePairwiseOnDemand]: 146/163 looper letters, 455 selfloop transitions, 156 changer transitions 36/863 dead transitions. [2025-01-09 21:23:58,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 424 places, 863 transitions, 14316 flow [2025-01-09 21:23:58,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 21:23:58,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2025-01-09 21:23:58,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2530 transitions. [2025-01-09 21:23:58,543 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8623040218132243 [2025-01-09 21:23:58,544 INFO L175 Difference]: Start difference. First operand has 407 places, 697 transitions, 11142 flow. Second operand 18 states and 2530 transitions. [2025-01-09 21:23:58,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 424 places, 863 transitions, 14316 flow [2025-01-09 21:23:58,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 863 transitions, 13882 flow, removed 4 selfloop flow, removed 5 redundant places. [2025-01-09 21:23:58,764 INFO L231 Difference]: Finished difference. Result has 428 places, 748 transitions, 12063 flow [2025-01-09 21:23:58,764 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=10760, PETRI_DIFFERENCE_MINUEND_PLACES=402, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=697, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=111, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=561, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=12063, PETRI_PLACES=428, PETRI_TRANSITIONS=748} [2025-01-09 21:23:58,765 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 265 predicate places. [2025-01-09 21:23:58,765 INFO L471 AbstractCegarLoop]: Abstraction has has 428 places, 748 transitions, 12063 flow [2025-01-09 21:23:58,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 134.45454545454547) internal successors, (1479), 11 states have internal predecessors, (1479), 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:23:58,765 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:23:58,765 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] [2025-01-09 21:23:58,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 21:23:58,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 21:23:58,970 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:23:58,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:23:58,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1135295208, now seen corresponding path program 12 times [2025-01-09 21:23:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:23:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388975765] [2025-01-09 21:23:58,971 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-09 21:23:58,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:23:58,979 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 171 statements into 11 equivalence classes. [2025-01-09 21:23:58,984 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) and asserted 116 of 171 statements. [2025-01-09 21:23:58,984 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2025-01-09 21:23:58,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 21:23:59,458 INFO L134 CoverageAnalysis]: Checked inductivity of 239 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-01-09 21:23:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 21:23:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388975765] [2025-01-09 21:23:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388975765] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 21:23:59,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 21:23:59,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 21:23:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615447788] [2025-01-09 21:23:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 21:23:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 21:23:59,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 21:23:59,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 21:23:59,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2025-01-09 21:24:00,370 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 163 [2025-01-09 21:24:00,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 428 places, 748 transitions, 12063 flow. Second operand has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:00,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-01-09 21:24:00,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 163 [2025-01-09 21:24:00,372 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-01-09 21:24:01,642 INFO L124 PetriNetUnfolderBase]: 1205/3965 cut-off events. [2025-01-09 21:24:01,643 INFO L125 PetriNetUnfolderBase]: For 53462/53839 co-relation queries the response was YES. [2025-01-09 21:24:01,666 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23798 conditions, 3965 events. 1205/3965 cut-off events. For 53462/53839 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 33721 event pairs, 151 based on Foata normal form. 158/4063 useless extension candidates. Maximal degree in co-relation 23580. Up to 1673 conditions per place. [2025-01-09 21:24:01,676 INFO L140 encePairwiseOnDemand]: 143/163 looper letters, 332 selfloop transitions, 281 changer transitions 9/791 dead transitions. [2025-01-09 21:24:01,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 435 places, 791 transitions, 13932 flow [2025-01-09 21:24:01,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 21:24:01,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-01-09 21:24:01,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1788 transitions. [2025-01-09 21:24:01,678 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437942425672487 [2025-01-09 21:24:01,678 INFO L175 Difference]: Start difference. First operand has 428 places, 748 transitions, 12063 flow. Second operand 13 states and 1788 transitions. [2025-01-09 21:24:01,678 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 435 places, 791 transitions, 13932 flow [2025-01-09 21:24:01,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 428 places, 791 transitions, 13836 flow, removed 20 selfloop flow, removed 7 redundant places. [2025-01-09 21:24:01,957 INFO L231 Difference]: Finished difference. Result has 433 places, 759 transitions, 12812 flow [2025-01-09 21:24:01,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=163, PETRI_DIFFERENCE_MINUEND_FLOW=11975, PETRI_DIFFERENCE_MINUEND_PLACES=416, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=748, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=270, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=473, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=12812, PETRI_PLACES=433, PETRI_TRANSITIONS=759} [2025-01-09 21:24:01,958 INFO L279 CegarLoopForPetriNet]: 163 programPoint places, 270 predicate places. [2025-01-09 21:24:01,958 INFO L471 AbstractCegarLoop]: Abstraction has has 433 places, 759 transitions, 12812 flow [2025-01-09 21:24:01,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 131.0) internal successors, (1310), 10 states have internal predecessors, (1310), 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:01,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-01-09 21:24:01,959 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] [2025-01-09 21:24:01,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 21:24:01,959 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-01-09 21:24:01,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 21:24:01,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1223341028, now seen corresponding path program 13 times [2025-01-09 21:24:01,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 21:24:01,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032982225] [2025-01-09 21:24:01,960 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-09 21:24:01,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 21:24:01,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 21:24:01,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 21:24:01,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 21:24:01,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat