./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.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 bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 05:32:40,240 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 05:32:40,298 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-08 05:32:40,303 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 05:32:40,303 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 05:32:40,327 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 05:32:40,328 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 05:32:40,328 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 05:32:40,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 05:32:40,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 05:32:40,330 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 05:32:40,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 05:32:40,330 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 05:32:40,330 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 05:32:40,330 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-08 05:32:40,330 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 05:32:40,331 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 05:32:40,332 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 05:32:40,332 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 05:32:40,332 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 05:32:40,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:40,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 05:32:40,333 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 05:32:40,333 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 -> bf117fc0bf8ae8b9ef4bb89156c7168763fcd2ba3d8567cd686924f85ad04dca [2025-02-08 05:32:40,606 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 05:32:40,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 05:32:40,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 05:32:40,619 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 05:32:40,619 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 05:32:40,620 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-02-08 05:32:41,794 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcccb7c15/711305f7960d4823b08a91086645e632/FLAGa97337a12 [2025-02-08 05:32:42,117 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 05:32:42,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_18-nested_rc.i [2025-02-08 05:32:42,137 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcccb7c15/711305f7960d4823b08a91086645e632/FLAGa97337a12 [2025-02-08 05:32:42,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fcccb7c15/711305f7960d4823b08a91086645e632 [2025-02-08 05:32:42,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 05:32:42,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 05:32:42,372 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:42,372 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 05:32:42,375 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 05:32:42,377 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6df84ce1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42, skipping insertion in model container [2025-02-08 05:32:42,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 05:32:42,738 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:42,761 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 05:32:42,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 05:32:42,874 INFO L204 MainTranslator]: Completed translation [2025-02-08 05:32:42,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42 WrapperNode [2025-02-08 05:32:42,874 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 05:32:42,875 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:42,875 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 05:32:42,875 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 05:32:42,880 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,900 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,925 INFO L138 Inliner]: procedures = 372, calls = 87, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 286 [2025-02-08 05:32:42,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 05:32:42,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 05:32:42,926 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 05:32:42,926 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 05:32:42,931 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,937 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,938 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,960 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,968 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,969 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 05:32:42,972 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 05:32:42,972 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 05:32:42,972 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 05:32:42,973 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (1/1) ... [2025-02-08 05:32:42,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 05:32:42,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:42,997 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 05:32:42,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 05:32:43,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-08 05:32:43,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-08 05:32:43,014 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-08 05:32:43,014 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-08 05:32:43,015 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-08 05:32:43,015 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 05:32:43,015 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 05:32:43,016 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-08 05:32:43,133 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 05:32:43,134 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 05:32:43,569 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-08 05:32:43,570 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 05:32:43,596 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 05:32:43,600 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 05:32:43,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43 BoogieIcfgContainer [2025-02-08 05:32:43,601 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 05:32:43,603 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 05:32:43,603 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 05:32:43,606 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 05:32:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 05:32:42" (1/3) ... [2025-02-08 05:32:43,607 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a0ca9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container [2025-02-08 05:32:43,607 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 05:32:42" (2/3) ... [2025-02-08 05:32:43,608 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a0ca9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 05:32:43, skipping insertion in model container [2025-02-08 05:32:43,608 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 05:32:43" (3/3) ... [2025-02-08 05:32:43,609 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_18-nested_rc.i [2025-02-08 05:32:43,621 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 05:32:43,623 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_18-nested_rc.i that has 2 procedures, 328 locations, 1 initial locations, 1 loop locations, and 18 error locations. [2025-02-08 05:32:43,623 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-08 05:32:43,699 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-08 05:32:43,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 331 places, 330 transitions, 664 flow [2025-02-08 05:32:43,818 INFO L124 PetriNetUnfolderBase]: 3/329 cut-off events. [2025-02-08 05:32:43,821 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:43,825 INFO L83 FinitePrefix]: Finished finitePrefix Result has 333 conditions, 329 events. 3/329 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 129 event pairs, 0 based on Foata normal form. 0/308 useless extension candidates. Maximal degree in co-relation 201. Up to 2 conditions per place. [2025-02-08 05:32:43,825 INFO L82 GeneralOperation]: Start removeDead. Operand has 331 places, 330 transitions, 664 flow [2025-02-08 05:32:43,832 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 330 places, 329 transitions, 661 flow [2025-02-08 05:32:43,844 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 05:32:43,855 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;@55948551, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 05:32:43,856 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-02-08 05:32:43,873 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-08 05:32:43,874 INFO L124 PetriNetUnfolderBase]: 2/102 cut-off events. [2025-02-08 05:32:43,874 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-08 05:32:43,874 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:43,874 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] [2025-02-08 05:32:43,875 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:43,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:43,879 INFO L85 PathProgramCache]: Analyzing trace with hash 379374871, now seen corresponding path program 1 times [2025-02-08 05:32:43,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:43,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367485037] [2025-02-08 05:32:43,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:43,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:43,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-08 05:32:44,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-08 05:32:44,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:44,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:44,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:44,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:44,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367485037] [2025-02-08 05:32:44,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367485037] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:44,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:44,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 05:32:44,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340274814] [2025-02-08 05:32:44,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:44,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 05:32:44,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:44,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 05:32:44,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 05:32:44,296 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 317 out of 330 [2025-02-08 05:32:44,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 329 transitions, 661 flow. Second operand has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:44,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:44,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 317 of 330 [2025-02-08 05:32:44,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:44,399 INFO L124 PetriNetUnfolderBase]: 7/407 cut-off events. [2025-02-08 05:32:44,399 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:44,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 407 events. 7/407 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 421 event pairs, 6 based on Foata normal form. 5/382 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-02-08 05:32:44,403 INFO L140 encePairwiseOnDemand]: 325/330 looper letters, 10 selfloop transitions, 2 changer transitions 1/328 dead transitions. [2025-02-08 05:32:44,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 328 transitions, 683 flow [2025-02-08 05:32:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 05:32:44,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-08 05:32:44,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 966 transitions. [2025-02-08 05:32:44,419 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9757575757575757 [2025-02-08 05:32:44,421 INFO L175 Difference]: Start difference. First operand has 330 places, 329 transitions, 661 flow. Second operand 3 states and 966 transitions. [2025-02-08 05:32:44,421 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 328 transitions, 683 flow [2025-02-08 05:32:44,427 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 331 places, 328 transitions, 682 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:44,434 INFO L231 Difference]: Finished difference. Result has 332 places, 327 transitions, 666 flow [2025-02-08 05:32:44,436 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=656, PETRI_DIFFERENCE_MINUEND_PLACES=329, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=325, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=666, PETRI_PLACES=332, PETRI_TRANSITIONS=327} [2025-02-08 05:32:44,440 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 2 predicate places. [2025-02-08 05:32:44,440 INFO L471 AbstractCegarLoop]: Abstraction has has 332 places, 327 transitions, 666 flow [2025-02-08 05:32:44,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 318.3333333333333) internal successors, (955), 3 states have internal predecessors, (955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:44,440 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:44,442 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:44,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 05:32:44,442 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:44,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:44,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1083994581, now seen corresponding path program 1 times [2025-02-08 05:32:44,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:44,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765840739] [2025-02-08 05:32:44,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:44,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:44,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:32:44,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:32:44,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:44,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:44,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:44,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765840739] [2025-02-08 05:32:44,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765840739] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:44,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [271831201] [2025-02-08 05:32:44,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:44,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:44,649 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:44,652 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-02-08 05:32:44,654 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-02-08 05:32:44,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-02-08 05:32:44,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-02-08 05:32:44,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:44,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:44,756 INFO L256 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-08 05:32:44,762 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:44,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:44,820 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:44,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [271831201] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:44,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-08 05:32:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621755596] [2025-02-08 05:32:44,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-08 05:32:44,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:44,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-08 05:32:44,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-08 05:32:44,915 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-02-08 05:32:44,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 332 places, 327 transitions, 666 flow. Second operand has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:44,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:44,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-02-08 05:32:44,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:45,061 INFO L124 PetriNetUnfolderBase]: 7/413 cut-off events. [2025-02-08 05:32:45,061 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-08 05:32:45,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 413 events. 7/413 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 414 event pairs, 6 based on Foata normal form. 2/386 useless extension candidates. Maximal degree in co-relation 377. Up to 24 conditions per place. [2025-02-08 05:32:45,064 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 14 selfloop transitions, 9 changer transitions 0/335 dead transitions. [2025-02-08 05:32:45,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 339 places, 335 transitions, 730 flow [2025-02-08 05:32:45,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 05:32:45,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-08 05:32:45,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2851 transitions. [2025-02-08 05:32:45,074 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.95993265993266 [2025-02-08 05:32:45,075 INFO L175 Difference]: Start difference. First operand has 332 places, 327 transitions, 666 flow. Second operand 9 states and 2851 transitions. [2025-02-08 05:32:45,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 339 places, 335 transitions, 730 flow [2025-02-08 05:32:45,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 338 places, 335 transitions, 728 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:45,084 INFO L231 Difference]: Finished difference. Result has 341 places, 333 transitions, 714 flow [2025-02-08 05:32:45,085 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=330, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=327, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=714, PETRI_PLACES=341, PETRI_TRANSITIONS=333} [2025-02-08 05:32:45,085 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 11 predicate places. [2025-02-08 05:32:45,085 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 333 transitions, 714 flow [2025-02-08 05:32:45,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 315.8) internal successors, (3158), 10 states have internal predecessors, (3158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:45,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:45,088 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] [2025-02-08 05:32:45,096 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-02-08 05:32:45,293 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-02-08 05:32:45,294 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:45,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash 297128363, now seen corresponding path program 2 times [2025-02-08 05:32:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115714730] [2025-02-08 05:32:45,296 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:45,317 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-02-08 05:32:45,331 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 95 of 110 statements. [2025-02-08 05:32:45,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:45,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:45,790 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-08 05:32:45,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115714730] [2025-02-08 05:32:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115714730] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:45,790 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:45,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:45,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735733315] [2025-02-08 05:32:45,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:45,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:45,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:45,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:45,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:46,221 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-02-08 05:32:46,223 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 333 transitions, 714 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:46,223 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:46,223 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-02-08 05:32:46,223 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:46,550 INFO L124 PetriNetUnfolderBase]: 365/1697 cut-off events. [2025-02-08 05:32:46,551 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-08 05:32:46,555 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 1697 events. 365/1697 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9277 event pairs, 364 based on Foata normal form. 0/1572 useless extension candidates. Maximal degree in co-relation 2428. Up to 800 conditions per place. [2025-02-08 05:32:46,561 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/331 dead transitions. [2025-02-08 05:32:46,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 344 places, 331 transitions, 872 flow [2025-02-08 05:32:46,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:46,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-02-08 05:32:46,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-02-08 05:32:46,566 INFO L175 Difference]: Start difference. First operand has 341 places, 333 transitions, 714 flow. Second operand 6 states and 1553 transitions. [2025-02-08 05:32:46,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 344 places, 331 transitions, 872 flow [2025-02-08 05:32:46,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 343 places, 331 transitions, 866 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-08 05:32:46,571 INFO L231 Difference]: Finished difference. Result has 343 places, 331 transitions, 724 flow [2025-02-08 05:32:46,572 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=321, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=724, PETRI_PLACES=343, PETRI_TRANSITIONS=331} [2025-02-08 05:32:46,572 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 13 predicate places. [2025-02-08 05:32:46,572 INFO L471 AbstractCegarLoop]: Abstraction has has 343 places, 331 transitions, 724 flow [2025-02-08 05:32:46,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:46,573 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:46,573 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:46,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 05:32:46,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:46,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:46,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1745217713, now seen corresponding path program 1 times [2025-02-08 05:32:46,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:46,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995252328] [2025-02-08 05:32:46,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:46,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:46,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:32:46,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:32:46,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:46,735 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:46,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995252328] [2025-02-08 05:32:46,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995252328] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:46,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1689380149] [2025-02-08 05:32:46,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:46,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:46,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:46,739 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-02-08 05:32:46,756 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-02-08 05:32:46,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-02-08 05:32:46,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-02-08 05:32:46,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:46,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:46,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-08 05:32:46,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:46,892 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:46,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:46,974 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:46,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1689380149] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:46,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:46,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-08 05:32:46,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484190935] [2025-02-08 05:32:46,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:46,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 05:32:46,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:46,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 05:32:46,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-08 05:32:47,007 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-02-08 05:32:47,012 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 343 places, 331 transitions, 724 flow. Second operand has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,012 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:47,012 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-02-08 05:32:47,012 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:47,208 INFO L124 PetriNetUnfolderBase]: 7/431 cut-off events. [2025-02-08 05:32:47,208 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2025-02-08 05:32:47,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 547 conditions, 431 events. 7/431 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 407 event pairs, 6 based on Foata normal form. 4/408 useless extension candidates. Maximal degree in co-relation 363. Up to 24 conditions per place. [2025-02-08 05:32:47,210 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 18 selfloop transitions, 21 changer transitions 0/349 dead transitions. [2025-02-08 05:32:47,210 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 349 transitions, 890 flow [2025-02-08 05:32:47,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-08 05:32:47,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-08 05:32:47,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6637 transitions. [2025-02-08 05:32:47,219 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9577200577200577 [2025-02-08 05:32:47,219 INFO L175 Difference]: Start difference. First operand has 343 places, 331 transitions, 724 flow. Second operand 21 states and 6637 transitions. [2025-02-08 05:32:47,219 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 349 transitions, 890 flow [2025-02-08 05:32:47,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 358 places, 349 transitions, 870 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:47,223 INFO L231 Difference]: Finished difference. Result has 363 places, 344 transitions, 834 flow [2025-02-08 05:32:47,224 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=704, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=331, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=320, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=834, PETRI_PLACES=363, PETRI_TRANSITIONS=344} [2025-02-08 05:32:47,224 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 33 predicate places. [2025-02-08 05:32:47,224 INFO L471 AbstractCegarLoop]: Abstraction has has 363 places, 344 transitions, 834 flow [2025-02-08 05:32:47,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 315.8888888888889) internal successors, (5686), 18 states have internal predecessors, (5686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:47,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:47,227 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] [2025-02-08 05:32:47,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-08 05:32:47,427 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-02-08 05:32:47,428 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:47,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:47,428 INFO L85 PathProgramCache]: Analyzing trace with hash 983858767, now seen corresponding path program 2 times [2025-02-08 05:32:47,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:47,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1740232115] [2025-02-08 05:32:47,429 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:47,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:47,442 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 138 statements into 2 equivalence classes. [2025-02-08 05:32:47,447 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 103 of 138 statements. [2025-02-08 05:32:47,448 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:47,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:47,729 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-02-08 05:32:47,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:47,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1740232115] [2025-02-08 05:32:47,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1740232115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:47,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:47,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:47,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286098203] [2025-02-08 05:32:47,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:47,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:47,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:47,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:47,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:48,129 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 245 out of 330 [2025-02-08 05:32:48,131 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 363 places, 344 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:48,131 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:48,131 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 245 of 330 [2025-02-08 05:32:48,131 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:48,389 INFO L124 PetriNetUnfolderBase]: 365/1715 cut-off events. [2025-02-08 05:32:48,389 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-02-08 05:32:48,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2620 conditions, 1715 events. 365/1715 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9322 event pairs, 364 based on Foata normal form. 0/1592 useless extension candidates. Maximal degree in co-relation 2430. Up to 800 conditions per place. [2025-02-08 05:32:48,396 INFO L140 encePairwiseOnDemand]: 318/330 looper letters, 71 selfloop transitions, 10 changer transitions 0/342 dead transitions. [2025-02-08 05:32:48,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 366 places, 342 transitions, 992 flow [2025-02-08 05:32:48,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:48,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:48,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1553 transitions. [2025-02-08 05:32:48,399 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7843434343434343 [2025-02-08 05:32:48,399 INFO L175 Difference]: Start difference. First operand has 363 places, 344 transitions, 834 flow. Second operand 6 states and 1553 transitions. [2025-02-08 05:32:48,399 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 366 places, 342 transitions, 992 flow [2025-02-08 05:32:48,402 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 360 places, 342 transitions, 968 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-08 05:32:48,404 INFO L231 Difference]: Finished difference. Result has 360 places, 342 transitions, 826 flow [2025-02-08 05:32:48,405 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=332, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=360, PETRI_TRANSITIONS=342} [2025-02-08 05:32:48,405 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 30 predicate places. [2025-02-08 05:32:48,406 INFO L471 AbstractCegarLoop]: Abstraction has has 360 places, 342 transitions, 826 flow [2025-02-08 05:32:48,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.33333333333334) internal successors, (1478), 6 states have internal predecessors, (1478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:48,406 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:48,407 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:48,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 05:32:48,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:48,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:48,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1521248121, now seen corresponding path program 1 times [2025-02-08 05:32:48,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:48,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059993737] [2025-02-08 05:32:48,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:48,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:48,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:32:48,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:32:48,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:48,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,698 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:48,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059993737] [2025-02-08 05:32:48,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059993737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:32:48,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753480372] [2025-02-08 05:32:48,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:48,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:32:48,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:32:48,701 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-02-08 05:32:48,703 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-02-08 05:32:48,765 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-08 05:32:48,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-08 05:32:48,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:48,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:48,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-08 05:32:48,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:32:48,889 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:48,889 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:32:49,058 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 05:32:49,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753480372] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:32:49,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:32:49,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-08 05:32:49,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706174418] [2025-02-08 05:32:49,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:32:49,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-08 05:32:49,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:49,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-08 05:32:49,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-08 05:32:49,085 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 314 out of 330 [2025-02-08 05:32:49,090 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 360 places, 342 transitions, 826 flow. Second operand has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:49,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:49,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 314 of 330 [2025-02-08 05:32:49,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:49,363 INFO L124 PetriNetUnfolderBase]: 7/444 cut-off events. [2025-02-08 05:32:49,363 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-02-08 05:32:49,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 635 conditions, 444 events. 7/444 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 401 event pairs, 6 based on Foata normal form. 3/422 useless extension candidates. Maximal degree in co-relation 368. Up to 24 conditions per place. [2025-02-08 05:32:49,366 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 21 selfloop transitions, 30 changer transitions 0/359 dead transitions. [2025-02-08 05:32:49,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 359 transitions, 1050 flow [2025-02-08 05:32:49,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 05:32:49,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-08 05:32:49,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9474 transitions. [2025-02-08 05:32:49,378 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9569696969696969 [2025-02-08 05:32:49,378 INFO L175 Difference]: Start difference. First operand has 360 places, 342 transitions, 826 flow. Second operand 30 states and 9474 transitions. [2025-02-08 05:32:49,378 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 359 transitions, 1050 flow [2025-02-08 05:32:49,382 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 359 transitions, 1030 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:49,385 INFO L231 Difference]: Finished difference. Result has 388 places, 352 transitions, 958 flow [2025-02-08 05:32:49,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=806, PETRI_DIFFERENCE_MINUEND_PLACES=355, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=342, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=319, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=958, PETRI_PLACES=388, PETRI_TRANSITIONS=352} [2025-02-08 05:32:49,388 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 58 predicate places. [2025-02-08 05:32:49,388 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 352 transitions, 958 flow [2025-02-08 05:32:49,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 316.0) internal successors, (7268), 23 states have internal predecessors, (7268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:49,391 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:49,391 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-02-08 05:32:49,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-08 05:32:49,592 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-02-08 05:32:49,592 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:49,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1540961179, now seen corresponding path program 2 times [2025-02-08 05:32:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:49,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933392116] [2025-02-08 05:32:49,593 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:32:49,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:49,613 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 165 statements into 2 equivalence classes. [2025-02-08 05:32:49,619 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 115 of 165 statements. [2025-02-08 05:32:49,619 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-08 05:32:49,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:49,926 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:49,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:49,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933392116] [2025-02-08 05:32:49,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933392116] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:49,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:49,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:49,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88644607] [2025-02-08 05:32:49,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:49,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:49,928 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:49,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:50,583 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 330 [2025-02-08 05:32:50,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 352 transitions, 958 flow. Second operand has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:50,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:50,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 330 [2025-02-08 05:32:50,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:50,854 INFO L124 PetriNetUnfolderBase]: 417/1909 cut-off events. [2025-02-08 05:32:50,854 INFO L125 PetriNetUnfolderBase]: For 118/118 co-relation queries the response was YES. [2025-02-08 05:32:50,857 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2991 conditions, 1909 events. 417/1909 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10610 event pairs, 416 based on Foata normal form. 0/1777 useless extension candidates. Maximal degree in co-relation 2722. Up to 914 conditions per place. [2025-02-08 05:32:50,862 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 81 selfloop transitions, 5 changer transitions 0/351 dead transitions. [2025-02-08 05:32:50,862 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 351 transitions, 1128 flow [2025-02-08 05:32:50,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:50,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:50,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1533 transitions. [2025-02-08 05:32:50,864 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7742424242424243 [2025-02-08 05:32:50,865 INFO L175 Difference]: Start difference. First operand has 388 places, 352 transitions, 958 flow. Second operand 6 states and 1533 transitions. [2025-02-08 05:32:50,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 351 transitions, 1128 flow [2025-02-08 05:32:50,868 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 374 places, 351 transitions, 1082 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-08 05:32:50,872 INFO L231 Difference]: Finished difference. Result has 374 places, 351 transitions, 920 flow [2025-02-08 05:32:50,872 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=910, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=351, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=920, PETRI_PLACES=374, PETRI_TRANSITIONS=351} [2025-02-08 05:32:50,873 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 44 predicate places. [2025-02-08 05:32:50,873 INFO L471 AbstractCegarLoop]: Abstraction has has 374 places, 351 transitions, 920 flow [2025-02-08 05:32:50,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 243.83333333333334) internal successors, (1463), 6 states have internal predecessors, (1463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:50,875 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:50,875 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:50,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-08 05:32:50,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:50,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:50,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1667747845, now seen corresponding path program 1 times [2025-02-08 05:32:50,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:50,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056934644] [2025-02-08 05:32:50,876 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:50,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-08 05:32:50,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-08 05:32:50,907 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:50,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:51,361 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:51,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:51,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056934644] [2025-02-08 05:32:51,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056934644] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:51,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:51,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:51,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462182792] [2025-02-08 05:32:51,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:51,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:51,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:51,363 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:51,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:51,942 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 262 out of 330 [2025-02-08 05:32:51,943 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 374 places, 351 transitions, 920 flow. Second operand has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 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-02-08 05:32:51,943 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:51,943 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 262 of 330 [2025-02-08 05:32:51,943 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:52,341 INFO L124 PetriNetUnfolderBase]: 257/1749 cut-off events. [2025-02-08 05:32:52,341 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-02-08 05:32:52,345 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2479 conditions, 1749 events. 257/1749 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10094 event pairs, 34 based on Foata normal form. 0/1620 useless extension candidates. Maximal degree in co-relation 2231. Up to 436 conditions per place. [2025-02-08 05:32:52,350 INFO L140 encePairwiseOnDemand]: 301/330 looper letters, 68 selfloop transitions, 75 changer transitions 0/428 dead transitions. [2025-02-08 05:32:52,350 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 378 places, 428 transitions, 1360 flow [2025-02-08 05:32:52,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:52,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:52,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1717 transitions. [2025-02-08 05:32:52,353 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8671717171717171 [2025-02-08 05:32:52,353 INFO L175 Difference]: Start difference. First operand has 374 places, 351 transitions, 920 flow. Second operand 6 states and 1717 transitions. [2025-02-08 05:32:52,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 378 places, 428 transitions, 1360 flow [2025-02-08 05:32:52,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 428 transitions, 1350 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:52,362 INFO L231 Difference]: Finished difference. Result has 378 places, 419 transitions, 1390 flow [2025-02-08 05:32:52,363 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=908, PETRI_DIFFERENCE_MINUEND_PLACES=368, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=350, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=323, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1390, PETRI_PLACES=378, PETRI_TRANSITIONS=419} [2025-02-08 05:32:52,364 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 48 predicate places. [2025-02-08 05:32:52,364 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 419 transitions, 1390 flow [2025-02-08 05:32:52,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.8333333333333) internal successors, (1601), 6 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-02-08 05:32:52,365 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:52,366 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:52,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-08 05:32:52,366 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:52,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:52,367 INFO L85 PathProgramCache]: Analyzing trace with hash 659360289, now seen corresponding path program 1 times [2025-02-08 05:32:52,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:52,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682354807] [2025-02-08 05:32:52,367 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:52,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:52,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-02-08 05:32:52,401 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-02-08 05:32:52,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:52,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:52,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:52,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682354807] [2025-02-08 05:32:52,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682354807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:52,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:52,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:52,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46862474] [2025-02-08 05:32:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:52,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:52,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:52,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:52,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:53,179 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-02-08 05:32:53,180 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 419 transitions, 1390 flow. Second operand has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:53,180 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:53,180 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-02-08 05:32:53,180 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:53,468 INFO L124 PetriNetUnfolderBase]: 209/1624 cut-off events. [2025-02-08 05:32:53,469 INFO L125 PetriNetUnfolderBase]: For 477/499 co-relation queries the response was YES. [2025-02-08 05:32:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2745 conditions, 1624 events. 209/1624 cut-off events. For 477/499 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 8633 event pairs, 53 based on Foata normal form. 0/1509 useless extension candidates. Maximal degree in co-relation 2495. Up to 336 conditions per place. [2025-02-08 05:32:53,477 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 117 selfloop transitions, 5 changer transitions 0/418 dead transitions. [2025-02-08 05:32:53,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 418 transitions, 1632 flow [2025-02-08 05:32:53,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:53,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1673 transitions. [2025-02-08 05:32:53,480 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8449494949494949 [2025-02-08 05:32:53,480 INFO L175 Difference]: Start difference. First operand has 378 places, 419 transitions, 1390 flow. Second operand 6 states and 1673 transitions. [2025-02-08 05:32:53,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 418 transitions, 1632 flow [2025-02-08 05:32:53,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 418 transitions, 1632 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:53,487 INFO L231 Difference]: Finished difference. Result has 382 places, 418 transitions, 1398 flow [2025-02-08 05:32:53,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1388, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=418, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=413, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1398, PETRI_PLACES=382, PETRI_TRANSITIONS=418} [2025-02-08 05:32:53,488 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 52 predicate places. [2025-02-08 05:32:53,489 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 418 transitions, 1398 flow [2025-02-08 05:32:53,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 273.5) internal successors, (1641), 6 states have internal predecessors, (1641), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:53,489 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:53,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:53,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-08 05:32:53,490 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:53,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:53,491 INFO L85 PathProgramCache]: Analyzing trace with hash 790082390, now seen corresponding path program 1 times [2025-02-08 05:32:53,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:53,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832744906] [2025-02-08 05:32:53,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:53,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:53,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-02-08 05:32:53,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-02-08 05:32:53,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:53,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:53,883 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:53,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:53,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832744906] [2025-02-08 05:32:53,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832744906] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:53,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:53,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:53,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1600842416] [2025-02-08 05:32:53,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:53,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:53,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:53,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:53,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:54,125 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 243 out of 330 [2025-02-08 05:32:54,126 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 418 transitions, 1398 flow. Second operand has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:54,126 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:54,126 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 243 of 330 [2025-02-08 05:32:54,127 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:54,575 INFO L124 PetriNetUnfolderBase]: 717/2984 cut-off events. [2025-02-08 05:32:54,576 INFO L125 PetriNetUnfolderBase]: For 950/1011 co-relation queries the response was YES. [2025-02-08 05:32:54,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5756 conditions, 2984 events. 717/2984 cut-off events. For 950/1011 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19903 event pairs, 399 based on Foata normal form. 0/2763 useless extension candidates. Maximal degree in co-relation 5505. Up to 1485 conditions per place. [2025-02-08 05:32:54,589 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 146 selfloop transitions, 5 changer transitions 0/417 dead transitions. [2025-02-08 05:32:54,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 417 transitions, 1698 flow [2025-02-08 05:32:54,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:54,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:54,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1543 transitions. [2025-02-08 05:32:54,592 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7792929292929293 [2025-02-08 05:32:54,592 INFO L175 Difference]: Start difference. First operand has 382 places, 418 transitions, 1398 flow. Second operand 6 states and 1543 transitions. [2025-02-08 05:32:54,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 417 transitions, 1698 flow [2025-02-08 05:32:54,598 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 417 transitions, 1688 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:54,601 INFO L231 Difference]: Finished difference. Result has 381 places, 417 transitions, 1396 flow [2025-02-08 05:32:54,602 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1386, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=417, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=412, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1396, PETRI_PLACES=381, PETRI_TRANSITIONS=417} [2025-02-08 05:32:54,602 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 51 predicate places. [2025-02-08 05:32:54,602 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 417 transitions, 1396 flow [2025-02-08 05:32:54,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 249.16666666666666) internal successors, (1495), 6 states have internal predecessors, (1495), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:54,603 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:54,604 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:54,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-08 05:32:54,604 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:54,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:54,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1429766680, now seen corresponding path program 1 times [2025-02-08 05:32:54,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:54,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703701130] [2025-02-08 05:32:54,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:54,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:54,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 227 statements into 1 equivalence classes. [2025-02-08 05:32:54,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 227 of 227 statements. [2025-02-08 05:32:54,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:54,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:54,995 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-02-08 05:32:54,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:54,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703701130] [2025-02-08 05:32:54,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703701130] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:54,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:54,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:54,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797198411] [2025-02-08 05:32:54,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:54,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:54,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:54,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:54,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:55,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 244 out of 330 [2025-02-08 05:32:55,229 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 417 transitions, 1396 flow. Second operand has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:55,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:55,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 244 of 330 [2025-02-08 05:32:55,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:55,788 INFO L124 PetriNetUnfolderBase]: 717/2983 cut-off events. [2025-02-08 05:32:55,788 INFO L125 PetriNetUnfolderBase]: For 952/1013 co-relation queries the response was YES. [2025-02-08 05:32:55,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5754 conditions, 2983 events. 717/2983 cut-off events. For 952/1013 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 19925 event pairs, 399 based on Foata normal form. 0/2763 useless extension candidates. Maximal degree in co-relation 5503. Up to 1484 conditions per place. [2025-02-08 05:32:55,805 INFO L140 encePairwiseOnDemand]: 324/330 looper letters, 145 selfloop transitions, 5 changer transitions 0/416 dead transitions. [2025-02-08 05:32:55,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 416 transitions, 1694 flow [2025-02-08 05:32:55,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:55,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:55,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1548 transitions. [2025-02-08 05:32:55,809 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7818181818181819 [2025-02-08 05:32:55,809 INFO L175 Difference]: Start difference. First operand has 381 places, 417 transitions, 1396 flow. Second operand 6 states and 1548 transitions. [2025-02-08 05:32:55,809 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 416 transitions, 1694 flow [2025-02-08 05:32:55,814 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 416 transitions, 1684 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:55,817 INFO L231 Difference]: Finished difference. Result has 380 places, 416 transitions, 1394 flow [2025-02-08 05:32:55,818 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=411, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1394, PETRI_PLACES=380, PETRI_TRANSITIONS=416} [2025-02-08 05:32:55,819 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 50 predicate places. [2025-02-08 05:32:55,819 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 416 transitions, 1394 flow [2025-02-08 05:32:55,819 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 250.66666666666666) internal successors, (1504), 6 states have internal predecessors, (1504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:55,819 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:55,820 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:55,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-08 05:32:55,820 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:55,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:55,821 INFO L85 PathProgramCache]: Analyzing trace with hash 37689654, now seen corresponding path program 1 times [2025-02-08 05:32:55,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:55,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282664398] [2025-02-08 05:32:55,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:55,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:55,854 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 252 statements into 1 equivalence classes. [2025-02-08 05:32:55,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 252 of 252 statements. [2025-02-08 05:32:55,871 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:55,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:56,249 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-02-08 05:32:56,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:56,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282664398] [2025-02-08 05:32:56,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282664398] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:56,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:56,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:56,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792785657] [2025-02-08 05:32:56,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:56,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:56,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:56,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:56,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:56,573 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-02-08 05:32:56,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 416 transitions, 1394 flow. Second operand has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:56,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:56,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-02-08 05:32:56,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:57,028 INFO L124 PetriNetUnfolderBase]: 530/2540 cut-off events. [2025-02-08 05:32:57,028 INFO L125 PetriNetUnfolderBase]: For 952/1054 co-relation queries the response was YES. [2025-02-08 05:32:57,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4742 conditions, 2540 events. 530/2540 cut-off events. For 952/1054 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 16124 event pairs, 93 based on Foata normal form. 16/2391 useless extension candidates. Maximal degree in co-relation 4490. Up to 813 conditions per place. [2025-02-08 05:32:57,041 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 131 selfloop transitions, 130 changer transitions 0/553 dead transitions. [2025-02-08 05:32:57,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 553 transitions, 2566 flow [2025-02-08 05:32:57,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:57,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:57,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1751 transitions. [2025-02-08 05:32:57,042 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8843434343434343 [2025-02-08 05:32:57,042 INFO L175 Difference]: Start difference. First operand has 380 places, 416 transitions, 1394 flow. Second operand 6 states and 1751 transitions. [2025-02-08 05:32:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 553 transitions, 2566 flow [2025-02-08 05:32:57,047 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 553 transitions, 2556 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-08 05:32:57,052 INFO L231 Difference]: Finished difference. Result has 385 places, 545 transitions, 2612 flow [2025-02-08 05:32:57,054 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=1384, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=379, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2612, PETRI_PLACES=385, PETRI_TRANSITIONS=545} [2025-02-08 05:32:57,054 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 55 predicate places. [2025-02-08 05:32:57,054 INFO L471 AbstractCegarLoop]: Abstraction has has 385 places, 545 transitions, 2612 flow [2025-02-08 05:32:57,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.1666666666667) internal successors, (1651), 6 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:57,056 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:57,056 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:57,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-08 05:32:57,056 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:57,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:57,058 INFO L85 PathProgramCache]: Analyzing trace with hash 416584866, now seen corresponding path program 1 times [2025-02-08 05:32:57,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:57,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723858284] [2025-02-08 05:32:57,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:57,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:57,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-02-08 05:32:57,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-02-08 05:32:57,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:57,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:57,495 INFO L134 CoverageAnalysis]: Checked inductivity of 238 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-02-08 05:32:57,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:57,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723858284] [2025-02-08 05:32:57,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723858284] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:57,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:57,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:57,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219261953] [2025-02-08 05:32:57,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:57,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:57,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:57,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:57,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:57,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 269 out of 330 [2025-02-08 05:32:57,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 385 places, 545 transitions, 2612 flow. Second operand has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:57,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:57,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 269 of 330 [2025-02-08 05:32:57,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:58,271 INFO L124 PetriNetUnfolderBase]: 806/3306 cut-off events. [2025-02-08 05:32:58,271 INFO L125 PetriNetUnfolderBase]: For 3361/3641 co-relation queries the response was YES. [2025-02-08 05:32:58,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7616 conditions, 3306 events. 806/3306 cut-off events. For 3361/3641 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22264 event pairs, 74 based on Foata normal form. 76/3207 useless extension candidates. Maximal degree in co-relation 7360. Up to 1071 conditions per place. [2025-02-08 05:32:58,290 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 251 selfloop transitions, 131 changer transitions 5/683 dead transitions. [2025-02-08 05:32:58,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 390 places, 683 transitions, 4286 flow [2025-02-08 05:32:58,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1752 transitions. [2025-02-08 05:32:58,292 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8848484848484849 [2025-02-08 05:32:58,292 INFO L175 Difference]: Start difference. First operand has 385 places, 545 transitions, 2612 flow. Second operand 6 states and 1752 transitions. [2025-02-08 05:32:58,292 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 390 places, 683 transitions, 4286 flow [2025-02-08 05:32:58,302 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 683 transitions, 4286 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:58,308 INFO L231 Difference]: Finished difference. Result has 395 places, 673 transitions, 4092 flow [2025-02-08 05:32:58,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=2612, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=545, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=507, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4092, PETRI_PLACES=395, PETRI_TRANSITIONS=673} [2025-02-08 05:32:58,309 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 65 predicate places. [2025-02-08 05:32:58,309 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 673 transitions, 4092 flow [2025-02-08 05:32:58,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 275.3333333333333) internal successors, (1652), 6 states have internal predecessors, (1652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:58,310 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:58,310 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:58,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-08 05:32:58,310 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:58,311 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:58,311 INFO L85 PathProgramCache]: Analyzing trace with hash -180345638, now seen corresponding path program 1 times [2025-02-08 05:32:58,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:58,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614631567] [2025-02-08 05:32:58,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:58,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:58,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-02-08 05:32:58,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-02-08 05:32:58,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:58,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:32:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:32:58,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:32:58,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614631567] [2025-02-08 05:32:58,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614631567] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:32:58,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 05:32:58,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 05:32:58,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377790702] [2025-02-08 05:32:58,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:32:58,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 05:32:58,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:32:58,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 05:32:58,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-08 05:32:59,112 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 248 out of 330 [2025-02-08 05:32:59,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 673 transitions, 4092 flow. Second operand has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:59,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:32:59,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 248 of 330 [2025-02-08 05:32:59,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:32:59,751 INFO L124 PetriNetUnfolderBase]: 1308/4650 cut-off events. [2025-02-08 05:32:59,751 INFO L125 PetriNetUnfolderBase]: For 4863/4920 co-relation queries the response was YES. [2025-02-08 05:32:59,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12215 conditions, 4650 events. 1308/4650 cut-off events. For 4863/4920 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33786 event pairs, 369 based on Foata normal form. 11/4416 useless extension candidates. Maximal degree in co-relation 11955. Up to 2225 conditions per place. [2025-02-08 05:32:59,777 INFO L140 encePairwiseOnDemand]: 311/330 looper letters, 316 selfloop transitions, 84 changer transitions 0/752 dead transitions. [2025-02-08 05:32:59,777 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 752 transitions, 5290 flow [2025-02-08 05:32:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 05:32:59,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-08 05:32:59,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1630 transitions. [2025-02-08 05:32:59,779 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8232323232323232 [2025-02-08 05:32:59,779 INFO L175 Difference]: Start difference. First operand has 395 places, 673 transitions, 4092 flow. Second operand 6 states and 1630 transitions. [2025-02-08 05:32:59,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 752 transitions, 5290 flow [2025-02-08 05:32:59,794 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 399 places, 752 transitions, 5036 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-02-08 05:32:59,800 INFO L231 Difference]: Finished difference. Result has 404 places, 744 transitions, 4628 flow [2025-02-08 05:32:59,801 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=3844, PETRI_DIFFERENCE_MINUEND_PLACES=394, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=673, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=625, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4628, PETRI_PLACES=404, PETRI_TRANSITIONS=744} [2025-02-08 05:32:59,802 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 74 predicate places. [2025-02-08 05:32:59,802 INFO L471 AbstractCegarLoop]: Abstraction has has 404 places, 744 transitions, 4628 flow [2025-02-08 05:32:59,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.66666666666666) internal successors, (1534), 6 states have internal predecessors, (1534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:32:59,802 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:32:59,802 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:32:59,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-08 05:32:59,802 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:32:59,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:32:59,803 INFO L85 PathProgramCache]: Analyzing trace with hash 28262866, now seen corresponding path program 1 times [2025-02-08 05:32:59,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:32:59,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881009630] [2025-02-08 05:32:59,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:32:59,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:32:59,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-08 05:32:59,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:32:59,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:32:59,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-08 05:33:00,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881009630] [2025-02-08 05:33:00,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881009630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:00,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1550124774] [2025-02-08 05:33:00,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 05:33:00,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:00,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:00,779 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-02-08 05:33:00,779 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-02-08 05:33:00,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-02-08 05:33:00,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:00,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 05:33:00,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:00,992 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 05:33:00,997 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:01,338 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:01,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:01,436 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:33:01,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 05:33:01,655 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:01,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-08 05:33:01,691 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-02-08 05:33:01,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-08 05:33:01,747 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:01,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-08 05:33:01,784 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:01,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-08 05:33:01,825 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 56 treesize of output 45 [2025-02-08 05:33:01,855 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:33:01,855 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:33:01,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1550124774] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:01,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:33:01,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [13] total 19 [2025-02-08 05:33:01,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1688138140] [2025-02-08 05:33:01,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:01,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-08 05:33:01,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:01,856 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-08 05:33:01,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=297, Unknown=0, NotChecked=0, Total=380 [2025-02-08 05:33:03,337 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 256 out of 330 [2025-02-08 05:33:03,339 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 404 places, 744 transitions, 4628 flow. Second operand has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:03,339 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:03,339 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 256 of 330 [2025-02-08 05:33:03,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:04,225 INFO L124 PetriNetUnfolderBase]: 1038/3966 cut-off events. [2025-02-08 05:33:04,225 INFO L125 PetriNetUnfolderBase]: For 6152/6435 co-relation queries the response was YES. [2025-02-08 05:33:04,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11612 conditions, 3966 events. 1038/3966 cut-off events. For 6152/6435 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 27696 event pairs, 87 based on Foata normal form. 74/3894 useless extension candidates. Maximal degree in co-relation 11344. Up to 892 conditions per place. [2025-02-08 05:33:04,252 INFO L140 encePairwiseOnDemand]: 307/330 looper letters, 401 selfloop transitions, 143 changer transitions 1/869 dead transitions. [2025-02-08 05:33:04,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 420 places, 869 transitions, 6652 flow [2025-02-08 05:33:04,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:33:04,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:33:04,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4514 transitions. [2025-02-08 05:33:04,258 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046345811051694 [2025-02-08 05:33:04,258 INFO L175 Difference]: Start difference. First operand has 404 places, 744 transitions, 4628 flow. Second operand 17 states and 4514 transitions. [2025-02-08 05:33:04,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 420 places, 869 transitions, 6652 flow [2025-02-08 05:33:04,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 420 places, 869 transitions, 6580 flow, removed 36 selfloop flow, removed 0 redundant places. [2025-02-08 05:33:04,288 INFO L231 Difference]: Finished difference. Result has 431 places, 801 transitions, 5574 flow [2025-02-08 05:33:04,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=404, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=744, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=91, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=624, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=5574, PETRI_PLACES=431, PETRI_TRANSITIONS=801} [2025-02-08 05:33:04,289 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 101 predicate places. [2025-02-08 05:33:04,289 INFO L471 AbstractCegarLoop]: Abstraction has has 431 places, 801 transitions, 5574 flow [2025-02-08 05:33:04,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 260.6363636363636) internal successors, (2867), 11 states have internal predecessors, (2867), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:04,290 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:04,290 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:04,299 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-02-08 05:33:04,490 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-02-08 05:33:04,491 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:33:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:04,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1077212536, now seen corresponding path program 2 times [2025-02-08 05:33:04,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:04,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898083050] [2025-02-08 05:33:04,492 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:33:04,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:04,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-02-08 05:33:04,555 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:04,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:33:04,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:06,683 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-08 05:33:06,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:06,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898083050] [2025-02-08 05:33:06,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898083050] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:06,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155041047] [2025-02-08 05:33:06,684 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 05:33:06,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:06,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:06,686 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-02-08 05:33:06,687 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-02-08 05:33:06,811 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 269 statements into 2 equivalence classes. [2025-02-08 05:33:07,530 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:07,530 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 05:33:07,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:07,534 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 44 conjuncts are in the unsatisfiable core [2025-02-08 05:33:07,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:08,043 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:08,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:08,321 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:08,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:08,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-02-08 05:33:08,643 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2025-02-08 05:33:08,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:08,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 38 [2025-02-08 05:33:08,723 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:08,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 52 [2025-02-08 05:33:08,786 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:08,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:33:08,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:08,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 55 [2025-02-08 05:33:08,949 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:33:08,949 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:33:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155041047] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:33:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [14] total 25 [2025-02-08 05:33:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681171615] [2025-02-08 05:33:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:08,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:08,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:08,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:08,950 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2025-02-08 05:33:11,789 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 330 [2025-02-08 05:33:11,791 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 431 places, 801 transitions, 5574 flow. Second operand has 15 states, 15 states have (on average 244.6) internal successors, (3669), 15 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:11,791 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:11,791 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 330 [2025-02-08 05:33:11,791 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:13,242 INFO L124 PetriNetUnfolderBase]: 1469/5663 cut-off events. [2025-02-08 05:33:13,242 INFO L125 PetriNetUnfolderBase]: For 13261/13626 co-relation queries the response was YES. [2025-02-08 05:33:13,259 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17675 conditions, 5663 events. 1469/5663 cut-off events. For 13261/13626 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 45632 event pairs, 94 based on Foata normal form. 151/5623 useless extension candidates. Maximal degree in co-relation 17393. Up to 1284 conditions per place. [2025-02-08 05:33:13,271 INFO L140 encePairwiseOnDemand]: 283/330 looper letters, 422 selfloop transitions, 274 changer transitions 4/1008 dead transitions. [2025-02-08 05:33:13,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 447 places, 1008 transitions, 8802 flow [2025-02-08 05:33:13,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-02-08 05:33:13,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-02-08 05:33:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 4287 transitions. [2025-02-08 05:33:13,274 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7641711229946524 [2025-02-08 05:33:13,274 INFO L175 Difference]: Start difference. First operand has 431 places, 801 transitions, 5574 flow. Second operand 17 states and 4287 transitions. [2025-02-08 05:33:13,274 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 447 places, 1008 transitions, 8802 flow [2025-02-08 05:33:13,311 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 443 places, 1008 transitions, 8756 flow, removed 5 selfloop flow, removed 4 redundant places. [2025-02-08 05:33:13,322 INFO L231 Difference]: Finished difference. Result has 448 places, 902 transitions, 7793 flow [2025-02-08 05:33:13,322 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=5550, PETRI_DIFFERENCE_MINUEND_PLACES=427, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=801, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=173, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=530, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=7793, PETRI_PLACES=448, PETRI_TRANSITIONS=902} [2025-02-08 05:33:13,323 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 118 predicate places. [2025-02-08 05:33:13,323 INFO L471 AbstractCegarLoop]: Abstraction has has 448 places, 902 transitions, 7793 flow [2025-02-08 05:33:13,324 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.6) internal successors, (3669), 15 states have internal predecessors, (3669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:13,324 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:13,324 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:13,337 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-02-08 05:33:13,524 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,SelfDestructingSolverStorable15 [2025-02-08 05:33:13,525 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:33:13,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:13,526 INFO L85 PathProgramCache]: Analyzing trace with hash -64932822, now seen corresponding path program 3 times [2025-02-08 05:33:13,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:13,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021007446] [2025-02-08 05:33:13,526 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:33:13,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:13,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-02-08 05:33:13,570 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 208 of 269 statements. [2025-02-08 05:33:13,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:33:13,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:14,637 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-08 05:33:14,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:14,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021007446] [2025-02-08 05:33:14,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021007446] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:14,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16779085] [2025-02-08 05:33:14,637 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 05:33:14,637 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:14,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:14,639 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-02-08 05:33:14,640 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-02-08 05:33:14,769 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 269 statements into 11 equivalence classes. [2025-02-08 05:33:15,087 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 208 of 269 statements. [2025-02-08 05:33:15,087 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-08 05:33:15,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:15,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 05:33:15,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:15,341 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:15,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:15,477 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:15,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:15,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-02-08 05:33:15,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-08 05:33:15,723 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:15,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:33:15,789 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:15,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-08 05:33:15,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:15,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-08 05:33:15,885 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 56 treesize of output 45 [2025-02-08 05:33:15,915 INFO L134 CoverageAnalysis]: Checked inductivity of 250 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:33:15,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 05:33:15,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16779085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 05:33:15,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 05:33:15,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 25 [2025-02-08 05:33:15,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108710257] [2025-02-08 05:33:15,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 05:33:15,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-08 05:33:15,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:15,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-08 05:33:15,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=569, Unknown=0, NotChecked=0, Total=650 [2025-02-08 05:33:18,976 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 330 [2025-02-08 05:33:18,978 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 448 places, 902 transitions, 7793 flow. Second operand has 15 states, 15 states have (on average 244.53333333333333) internal successors, (3668), 15 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:18,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:18,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 330 [2025-02-08 05:33:18,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:20,827 INFO L124 PetriNetUnfolderBase]: 1974/7555 cut-off events. [2025-02-08 05:33:20,827 INFO L125 PetriNetUnfolderBase]: For 25970/26512 co-relation queries the response was YES. [2025-02-08 05:33:20,870 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25189 conditions, 7555 events. 1974/7555 cut-off events. For 25970/26512 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 67454 event pairs, 137 based on Foata normal form. 180/7468 useless extension candidates. Maximal degree in co-relation 24901. Up to 1674 conditions per place. [2025-02-08 05:33:20,891 INFO L140 encePairwiseOnDemand]: 284/330 looper letters, 530 selfloop transitions, 331 changer transitions 3/1172 dead transitions. [2025-02-08 05:33:20,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 469 places, 1172 transitions, 12462 flow [2025-02-08 05:33:20,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 05:33:20,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2025-02-08 05:33:20,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 5498 transitions. [2025-02-08 05:33:20,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7573002754820937 [2025-02-08 05:33:20,894 INFO L175 Difference]: Start difference. First operand has 448 places, 902 transitions, 7793 flow. Second operand 22 states and 5498 transitions. [2025-02-08 05:33:20,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 469 places, 1172 transitions, 12462 flow [2025-02-08 05:33:20,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 458 places, 1172 transitions, 12340 flow, removed 0 selfloop flow, removed 11 redundant places. [2025-02-08 05:33:20,967 INFO L231 Difference]: Finished difference. Result has 468 places, 1040 transitions, 10752 flow [2025-02-08 05:33:20,968 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=7685, PETRI_DIFFERENCE_MINUEND_PLACES=437, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=902, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=206, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=595, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=10752, PETRI_PLACES=468, PETRI_TRANSITIONS=1040} [2025-02-08 05:33:20,968 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 138 predicate places. [2025-02-08 05:33:20,968 INFO L471 AbstractCegarLoop]: Abstraction has has 468 places, 1040 transitions, 10752 flow [2025-02-08 05:33:20,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 244.53333333333333) internal successors, (3668), 15 states have internal predecessors, (3668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:20,969 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:20,969 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:20,978 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-02-08 05:33:21,170 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-02-08 05:33:21,170 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:33:21,171 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:21,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1732315346, now seen corresponding path program 4 times [2025-02-08 05:33:21,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:21,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2118087652] [2025-02-08 05:33:21,171 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:33:21,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:21,190 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-02-08 05:33:21,276 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:21,276 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:33:21,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:23,611 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-02-08 05:33:23,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:23,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2118087652] [2025-02-08 05:33:23,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2118087652] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:23,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874731481] [2025-02-08 05:33:23,612 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-08 05:33:23,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:23,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:23,616 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:33:23,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 05:33:23,819 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 269 statements into 2 equivalence classes. [2025-02-08 05:33:26,021 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:26,021 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-08 05:33:26,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:26,028 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 05:33:26,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:26,372 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:33:26,373 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 05:33:26,482 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:26,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:26,703 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:26,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2025-02-08 05:33:26,756 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-02-08 05:33:26,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-08 05:33:26,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:26,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-08 05:33:26,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:26,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-08 05:33:26,855 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 56 treesize of output 45 [2025-02-08 05:33:26,864 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:33:26,865 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:33:26,912 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)))) is different from false [2025-02-08 05:33:26,925 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)))))) is different from false [2025-02-08 05:33:27,141 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse4 (+ |c_~#c~0.offset| .cse1 1)) (.cse3 (+ 2 |c_~#c~0.offset| .cse1)) (.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse4 0) .cse3 0) .cse2 0)))) (and (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2633) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2633) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2633) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2633 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2633) |c_~#c~0.base|) .cse4) 0)))))) is different from false [2025-02-08 05:33:27,157 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:27,157 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-02-08 05:33:27,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:27,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-02-08 05:33:27,171 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:27,171 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:33:27,175 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:27,176 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:33:27,180 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:27,180 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-02-08 05:33:27,556 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-02-08 05:33:27,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874731481] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:33:27,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:33:27,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 10, 10] total 33 [2025-02-08 05:33:27,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135632466] [2025-02-08 05:33:27,557 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:33:27,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2025-02-08 05:33:27,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:27,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2025-02-08 05:33:27,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=752, Unknown=53, NotChecked=180, Total=1122 [2025-02-08 05:33:27,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 330 [2025-02-08 05:33:27,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 468 places, 1040 transitions, 10752 flow. Second operand has 34 states, 34 states have (on average 110.82352941176471) internal successors, (3768), 34 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:27,580 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:27,580 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 330 [2025-02-08 05:33:27,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-08 05:33:36,180 INFO L124 PetriNetUnfolderBase]: 8184/21333 cut-off events. [2025-02-08 05:33:36,181 INFO L125 PetriNetUnfolderBase]: For 81409/81580 co-relation queries the response was YES. [2025-02-08 05:33:36,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78661 conditions, 21333 events. 8184/21333 cut-off events. For 81409/81580 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 202548 event pairs, 2205 based on Foata normal form. 101/20539 useless extension candidates. Maximal degree in co-relation 78292. Up to 8379 conditions per place. [2025-02-08 05:33:36,548 INFO L140 encePairwiseOnDemand]: 284/330 looper letters, 958 selfloop transitions, 454 changer transitions 2/1542 dead transitions. [2025-02-08 05:33:36,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 493 places, 1542 transitions, 18968 flow [2025-02-08 05:33:36,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-02-08 05:33:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-02-08 05:33:36,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 2999 transitions. [2025-02-08 05:33:36,571 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.34953379953379954 [2025-02-08 05:33:36,572 INFO L175 Difference]: Start difference. First operand has 468 places, 1040 transitions, 10752 flow. Second operand 26 states and 2999 transitions. [2025-02-08 05:33:36,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 493 places, 1542 transitions, 18968 flow [2025-02-08 05:33:36,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 483 places, 1542 transitions, 18768 flow, removed 69 selfloop flow, removed 10 redundant places. [2025-02-08 05:33:36,971 INFO L231 Difference]: Finished difference. Result has 494 places, 1225 transitions, 15640 flow [2025-02-08 05:33:36,972 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=330, PETRI_DIFFERENCE_MINUEND_FLOW=10566, PETRI_DIFFERENCE_MINUEND_PLACES=458, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1040, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=273, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=610, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=15640, PETRI_PLACES=494, PETRI_TRANSITIONS=1225} [2025-02-08 05:33:36,974 INFO L279 CegarLoopForPetriNet]: 330 programPoint places, 164 predicate places. [2025-02-08 05:33:36,975 INFO L471 AbstractCegarLoop]: Abstraction has has 494 places, 1225 transitions, 15640 flow [2025-02-08 05:33:36,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 110.82352941176471) internal successors, (3768), 34 states have internal predecessors, (3768), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:36,978 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-08 05:33:36,979 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 05:33:36,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 05:33:37,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:37,183 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-02-08 05:33:37,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 05:33:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1625001012, now seen corresponding path program 5 times [2025-02-08 05:33:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 05:33:37,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437457401] [2025-02-08 05:33:37,188 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:33:37,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 05:33:37,220 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-02-08 05:33:37,251 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:37,251 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:33:37,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:38,506 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-02-08 05:33:38,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 05:33:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437457401] [2025-02-08 05:33:38,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437457401] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 05:33:38,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [849044875] [2025-02-08 05:33:38,507 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-08 05:33:38,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 05:33:38,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 05:33:38,509 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 05:33:38,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 05:33:38,697 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 269 statements into 11 equivalence classes. [2025-02-08 05:33:40,247 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 269 of 269 statements. [2025-02-08 05:33:40,247 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-02-08 05:33:40,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 05:33:40,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 803 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-02-08 05:33:40,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 05:33:40,553 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-08 05:33:40,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-02-08 05:33:40,636 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 05:33:40,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 05:33:40,852 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-02-08 05:33:40,877 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 05:33:40,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-02-08 05:33:40,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 27 [2025-02-08 05:33:40,960 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:40,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 42 [2025-02-08 05:33:40,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:40,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 57 [2025-02-08 05:33:41,064 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 56 treesize of output 45 [2025-02-08 05:33:41,092 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 250 trivial. 0 not checked. [2025-02-08 05:33:41,092 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 05:33:41,113 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (and (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse0 1)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse0)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ 3 |c_~#c~0.offset| .cse0)) 0)))) is different from false [2025-02-08 05:33:41,154 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (select |c_#race| |c_~#c~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ 2 |c_~#c~0.offset| .cse1)) 0)))))) is different from false [2025-02-08 05:33:41,173 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse1 (+ 2 |c_~#c~0.offset| .cse2)) (.cse3 (+ 3 |c_~#c~0.offset| .cse2))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (select |c_#race| |c_~#c~0.base|) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_2961 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse1))) (forall ((v_ArrVal_2961 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2 1)))) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse2)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse3) 0)))))) is different from false [2025-02-08 05:33:41,187 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#c~0.offset| .cse4 1)) (.cse1 (+ 2 |c_~#c~0.offset| .cse4)) (.cse2 (+ 3 |c_~#c~0.offset| .cse4))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse3 0) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse1) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse4)) 0)))))) is different from false [2025-02-08 05:33:41,214 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse3 (+ |c_~#c~0.offset| .cse1 1)) (.cse4 (+ 2 |c_~#c~0.offset| .cse1)) (.cse2 (+ 3 |c_~#c~0.offset| .cse1))) (let ((.cse0 (store |c_#race| |c_~#c~0.base| (store (store (store (select |c_#race| |c_~#c~0.base|) .cse3 0) .cse4 0) .cse2 0)))) (and (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2961) |c_~#c~0.base|) (+ |c_~#c~0.offset| .cse1)) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse2) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse3) 0)) (forall ((v_ArrVal_2961 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_#t~malloc30#1.base| v_ArrVal_2961) |c_~#c~0.base|) .cse4) 0)))))) is different from false [2025-02-08 05:33:41,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:41,352 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 67 [2025-02-08 05:33:41,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 05:33:41,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 83 treesize of output 39 [2025-02-08 05:33:41,368 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:41,369 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:33:41,374 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:41,374 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 51 treesize of output 1 [2025-02-08 05:33:41,380 INFO L349 Elim1Store]: treesize reduction 51, result has 1.9 percent of original size [2025-02-08 05:33:41,381 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 1 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 1 [2025-02-08 05:33:51,674 INFO L134 CoverageAnalysis]: Checked inductivity of 251 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 250 trivial. 1 not checked. [2025-02-08 05:33:51,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [849044875] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 05:33:51,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 05:33:51,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10, 10] total 28 [2025-02-08 05:33:51,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064967869] [2025-02-08 05:33:51,674 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 05:33:51,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-08 05:33:51,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 05:33:51,675 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-08 05:33:51,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=456, Unknown=7, NotChecked=240, Total=812 [2025-02-08 05:33:52,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 125 out of 330 [2025-02-08 05:33:52,040 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 494 places, 1225 transitions, 15640 flow. Second operand has 29 states, 29 states have (on average 136.31034482758622) internal successors, (3953), 29 states have internal predecessors, (3953), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 05:33:52,041 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-08 05:33:52,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 125 of 330 [2025-02-08 05:33:52,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand