./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c00e63dc 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_13-arraycollapse_nr.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 09:22:23,352 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 09:22:23,394 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-02-06 09:22:23,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 09:22:23,402 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 09:22:23,414 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 09:22:23,414 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 09:22:23,414 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 09:22:23,415 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 09:22:23,415 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 09:22:23,415 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 09:22:23,415 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 09:22:23,415 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 09:22:23,415 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 09:22:23,415 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 09:22:23,415 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 09:22:23,416 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 09:22:23,417 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:23,417 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 09:22:23,417 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 09:22:23,418 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 09:22:23,418 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 09:22:23,418 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 09:22:23,418 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 09:22:23,418 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 -> b018c23c1a90f89310fc4f08bf16b02660af5a398ccd47f63d319e7a234c112b [2025-02-06 09:22:23,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 09:22:23,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 09:22:23,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 09:22:23,644 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 09:22:23,644 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 09:22:23,648 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-02-06 09:22:24,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3cb682d/8293a10aa79e40ca934d85cb8c4b6e1e/FLAGed98cbc8c [2025-02-06 09:22:25,175 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 09:22:25,178 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-02-06 09:22:25,194 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3cb682d/8293a10aa79e40ca934d85cb8c4b6e1e/FLAGed98cbc8c [2025-02-06 09:22:25,209 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ed3cb682d/8293a10aa79e40ca934d85cb8c4b6e1e [2025-02-06 09:22:25,211 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 09:22:25,213 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 09:22:25,213 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:25,214 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 09:22:25,217 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 09:22:25,217 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,218 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3df9af40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25, skipping insertion in model container [2025-02-06 09:22:25,218 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 09:22:25,524 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:25,556 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 09:22:25,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 09:22:25,665 INFO L204 MainTranslator]: Completed translation [2025-02-06 09:22:25,666 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25 WrapperNode [2025-02-06 09:22:25,666 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 09:22:25,666 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:25,667 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 09:22:25,667 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 09:22:25,671 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,682 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,720 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-02-06 09:22:25,721 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 09:22:25,721 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 09:22:25,721 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 09:22:25,722 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 09:22:25,726 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,735 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,735 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,774 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,775 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,781 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,785 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 09:22:25,786 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 09:22:25,786 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 09:22:25,786 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 09:22:25,790 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (1/1) ... [2025-02-06 09:22:25,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 09:22:25,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:25,818 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-06 09:22:25,821 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-06 09:22:25,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-02-06 09:22:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-02-06 09:22:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-02-06 09:22:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-02-06 09:22:25,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-02-06 09:22:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-02-06 09:22:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-06 09:22:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 09:22:25,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-02-06 09:22:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-02-06 09:22:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-02-06 09:22:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-02-06 09:22:25,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 09:22:25,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 09:22:25,840 WARN L227 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-02-06 09:22:25,946 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 09:22:25,948 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 09:22:26,479 INFO L304 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-02-06 09:22:26,479 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 09:22:26,497 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 09:22:26,497 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 09:22:26,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:26 BoogieIcfgContainer [2025-02-06 09:22:26,498 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 09:22:26,499 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 09:22:26,499 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 09:22:26,509 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 09:22:26,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 09:22:25" (1/3) ... [2025-02-06 09:22:26,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c7ec20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:26, skipping insertion in model container [2025-02-06 09:22:26,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 09:22:25" (2/3) ... [2025-02-06 09:22:26,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49c7ec20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 09:22:26, skipping insertion in model container [2025-02-06 09:22:26,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 09:22:26" (3/3) ... [2025-02-06 09:22:26,511 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-02-06 09:22:26,523 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 09:22:26,526 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_13-arraycollapse_nr.i that has 2 procedures, 485 locations, 1 initial locations, 1 loop locations, and 30 error locations. [2025-02-06 09:22:26,527 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-02-06 09:22:26,628 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-02-06 09:22:26,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 488 places, 488 transitions, 980 flow [2025-02-06 09:22:26,792 INFO L124 PetriNetUnfolderBase]: 4/487 cut-off events. [2025-02-06 09:22:26,795 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:26,801 INFO L83 FinitePrefix]: Finished finitePrefix Result has 491 conditions, 487 events. 4/487 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 393 event pairs, 0 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 359. Up to 2 conditions per place. [2025-02-06 09:22:26,801 INFO L82 GeneralOperation]: Start removeDead. Operand has 488 places, 488 transitions, 980 flow [2025-02-06 09:22:26,808 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 487 transitions, 977 flow [2025-02-06 09:22:26,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 09:22:26,827 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;@7c0920a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 09:22:26,827 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-02-06 09:22:26,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-02-06 09:22:26,845 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-02-06 09:22:26,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:26,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:26,846 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] [2025-02-06 09:22:26,847 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:26,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:26,851 INFO L85 PathProgramCache]: Analyzing trace with hash -538343192, now seen corresponding path program 1 times [2025-02-06 09:22:26,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:26,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668729961] [2025-02-06 09:22:26,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:26,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:26,927 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-02-06 09:22:26,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-02-06 09:22:26,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:26,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:27,675 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-06 09:22:27,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668729961] [2025-02-06 09:22:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668729961] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:27,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086922258] [2025-02-06 09:22:27,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:27,686 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:27,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:27,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:27,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:28,389 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-02-06 09:22:28,395 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 487 transitions, 977 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-06 09:22:28,396 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:28,396 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-02-06 09:22:28,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:28,751 INFO L124 PetriNetUnfolderBase]: 365/1842 cut-off events. [2025-02-06 09:22:28,751 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-02-06 09:22:28,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2708 conditions, 1842 events. 365/1842 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9496 event pairs, 364 based on Foata normal form. 13/1717 useless extension candidates. Maximal degree in co-relation 2256. Up to 842 conditions per place. [2025-02-06 09:22:28,758 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 113 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-02-06 09:22:28,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1229 flow [2025-02-06 09:22:28,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:28,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:28,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2228 transitions. [2025-02-06 09:22:28,771 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7609289617486339 [2025-02-06 09:22:28,772 INFO L175 Difference]: Start difference. First operand has 487 places, 487 transitions, 977 flow. Second operand 6 states and 2228 transitions. [2025-02-06 09:22:28,773 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 480 transitions, 1229 flow [2025-02-06 09:22:28,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 480 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:28,783 INFO L231 Difference]: Finished difference. Result has 487 places, 478 transitions, 998 flow [2025-02-06 09:22:28,786 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=962, PETRI_DIFFERENCE_MINUEND_PLACES=482, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=480, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=460, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=998, PETRI_PLACES=487, PETRI_TRANSITIONS=478} [2025-02-06 09:22:28,788 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 0 predicate places. [2025-02-06 09:22:28,789 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 478 transitions, 998 flow [2025-02-06 09:22:28,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-06 09:22:28,790 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:28,790 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:28,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 09:22:28,791 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:28,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:28,792 INFO L85 PathProgramCache]: Analyzing trace with hash -1447730720, now seen corresponding path program 1 times [2025-02-06 09:22:28,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:28,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190537869] [2025-02-06 09:22:28,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:28,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:28,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-02-06 09:22:28,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-02-06 09:22:28,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:28,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:29,167 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-06 09:22:29,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:29,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190537869] [2025-02-06 09:22:29,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190537869] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:29,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:29,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:29,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936627301] [2025-02-06 09:22:29,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:29,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:29,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:29,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:29,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:29,961 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-02-06 09:22:29,963 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 487 places, 478 transitions, 998 flow. Second operand has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-06 09:22:29,963 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:29,963 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-02-06 09:22:29,963 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:30,237 INFO L124 PetriNetUnfolderBase]: 365/1836 cut-off events. [2025-02-06 09:22:30,237 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:30,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2722 conditions, 1836 events. 365/1836 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9493 event pairs, 364 based on Foata normal form. 0/1704 useless extension candidates. Maximal degree in co-relation 2342. Up to 842 conditions per place. [2025-02-06 09:22:30,241 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 113 selfloop transitions, 20 changer transitions 0/474 dead transitions. [2025-02-06 09:22:30,241 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 474 transitions, 1256 flow [2025-02-06 09:22:30,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:30,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:30,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2225 transitions. [2025-02-06 09:22:30,245 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599043715846995 [2025-02-06 09:22:30,245 INFO L175 Difference]: Start difference. First operand has 487 places, 478 transitions, 998 flow. Second operand 6 states and 2225 transitions. [2025-02-06 09:22:30,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 474 transitions, 1256 flow [2025-02-06 09:22:30,248 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 474 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:30,251 INFO L231 Difference]: Finished difference. Result has 481 places, 474 transitions, 990 flow [2025-02-06 09:22:30,252 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=474, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=454, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=481, PETRI_TRANSITIONS=474} [2025-02-06 09:22:30,252 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-02-06 09:22:30,252 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 990 flow [2025-02-06 09:22:30,253 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 349.3333333333333) internal successors, (2096), 6 states have internal predecessors, (2096), 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-06 09:22:30,253 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:30,254 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:30,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 09:22:30,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:30,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:30,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1954067955, now seen corresponding path program 1 times [2025-02-06 09:22:30,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:30,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20371288] [2025-02-06 09:22:30,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:30,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:30,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-02-06 09:22:30,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-02-06 09:22:30,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:30,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:30,660 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-06 09:22:30,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:30,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20371288] [2025-02-06 09:22:30,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20371288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:30,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:30,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:30,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775369666] [2025-02-06 09:22:30,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:30,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:30,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:30,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:30,662 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:31,366 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 488 [2025-02-06 09:22:31,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 474 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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-06 09:22:31,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:31,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 488 [2025-02-06 09:22:31,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:31,548 INFO L124 PetriNetUnfolderBase]: 391/1924 cut-off events. [2025-02-06 09:22:31,548 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:22:31,550 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1924 events. 391/1924 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10265 event pairs, 390 based on Foata normal form. 0/1787 useless extension candidates. Maximal degree in co-relation 2468. Up to 911 conditions per place. [2025-02-06 09:22:31,554 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 130 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-02-06 09:22:31,554 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 473 transitions, 1258 flow [2025-02-06 09:22:31,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:31,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:31,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2230 transitions. [2025-02-06 09:22:31,558 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616120218579235 [2025-02-06 09:22:31,558 INFO L175 Difference]: Start difference. First operand has 481 places, 474 transitions, 990 flow. Second operand 6 states and 2230 transitions. [2025-02-06 09:22:31,558 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 473 transitions, 1258 flow [2025-02-06 09:22:31,560 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 473 transitions, 1218 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:31,564 INFO L231 Difference]: Finished difference. Result has 480 places, 473 transitions, 958 flow [2025-02-06 09:22:31,565 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=958, PETRI_PLACES=480, PETRI_TRANSITIONS=473} [2025-02-06 09:22:31,565 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -7 predicate places. [2025-02-06 09:22:31,565 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 473 transitions, 958 flow [2025-02-06 09:22:31,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 351.8333333333333) internal successors, (2111), 6 states have internal predecessors, (2111), 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-06 09:22:31,567 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:31,567 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:31,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 09:22:31,567 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:31,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:31,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1076505214, now seen corresponding path program 1 times [2025-02-06 09:22:31,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:31,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175084166] [2025-02-06 09:22:31,568 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:31,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:31,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-02-06 09:22:31,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-02-06 09:22:31,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:31,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:31,678 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-06 09:22:31,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:31,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175084166] [2025-02-06 09:22:31,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175084166] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:31,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:31,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 09:22:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359414923] [2025-02-06 09:22:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:31,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 09:22:31,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:31,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 09:22:31,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 09:22:31,705 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 488 [2025-02-06 09:22:31,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 480 places, 473 transitions, 958 flow. Second operand has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-06 09:22:31,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:31,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 488 [2025-02-06 09:22:31,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:31,757 INFO L124 PetriNetUnfolderBase]: 7/658 cut-off events. [2025-02-06 09:22:31,757 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:31,758 INFO L83 FinitePrefix]: Finished finitePrefix Result has 697 conditions, 658 events. 7/658 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 643 event pairs, 6 based on Foata normal form. 1/623 useless extension candidates. Maximal degree in co-relation 496. Up to 24 conditions per place. [2025-02-06 09:22:31,759 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 10 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-02-06 09:22:31,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 474 transitions, 984 flow [2025-02-06 09:22:31,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 09:22:31,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-02-06 09:22:31,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-02-06 09:22:31,761 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.980191256830601 [2025-02-06 09:22:31,761 INFO L175 Difference]: Start difference. First operand has 480 places, 473 transitions, 958 flow. Second operand 3 states and 1435 transitions. [2025-02-06 09:22:31,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 474 transitions, 984 flow [2025-02-06 09:22:31,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 474 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:31,768 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 960 flow [2025-02-06 09:22:31,768 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=948, PETRI_DIFFERENCE_MINUEND_PLACES=475, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=471, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=960, PETRI_PLACES=478, PETRI_TRANSITIONS=474} [2025-02-06 09:22:31,769 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-02-06 09:22:31,769 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 960 flow [2025-02-06 09:22:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 475.3333333333333) internal successors, (1426), 3 states have internal predecessors, (1426), 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-06 09:22:31,770 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:31,770 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:31,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 09:22:31,770 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:31,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:31,770 INFO L85 PathProgramCache]: Analyzing trace with hash 2022354614, now seen corresponding path program 1 times [2025-02-06 09:22:31,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:31,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570506041] [2025-02-06 09:22:31,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:31,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:31,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-02-06 09:22:31,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-02-06 09:22:31,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:31,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:32,197 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-06 09:22:32,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:32,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570506041] [2025-02-06 09:22:32,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570506041] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:32,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:32,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124276141] [2025-02-06 09:22:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:32,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:32,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:32,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:32,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:32,913 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 488 [2025-02-06 09:22:32,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 474 transitions, 960 flow. Second operand has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-06 09:22:32,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:32,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 488 [2025-02-06 09:22:32,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:33,066 INFO L124 PetriNetUnfolderBase]: 55/899 cut-off events. [2025-02-06 09:22:33,066 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-02-06 09:22:33,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1146 conditions, 899 events. 55/899 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2249 event pairs, 54 based on Foata normal form. 0/839 useless extension candidates. Maximal degree in co-relation 924. Up to 227 conditions per place. [2025-02-06 09:22:33,068 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 89 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-02-06 09:22:33,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1146 flow [2025-02-06 09:22:33,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:33,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:33,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2025-02-06 09:22:33,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-02-06 09:22:33,072 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 960 flow. Second operand 6 states and 2440 transitions. [2025-02-06 09:22:33,072 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1146 flow [2025-02-06 09:22:33,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 473 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:33,077 INFO L231 Difference]: Finished difference. Result has 481 places, 473 transitions, 966 flow [2025-02-06 09:22:33,078 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=956, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=473, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=468, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=966, PETRI_PLACES=481, PETRI_TRANSITIONS=473} [2025-02-06 09:22:33,078 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-02-06 09:22:33,078 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 473 transitions, 966 flow [2025-02-06 09:22:33,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.8333333333333) internal successors, (2375), 6 states have internal predecessors, (2375), 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-06 09:22:33,079 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:33,080 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:33,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 09:22:33,081 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:33,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:33,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1856699464, now seen corresponding path program 1 times [2025-02-06 09:22:33,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:33,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5354545] [2025-02-06 09:22:33,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:33,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:33,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-02-06 09:22:33,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-02-06 09:22:33,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:33,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:33,469 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-06 09:22:33,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:33,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5354545] [2025-02-06 09:22:33,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5354545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:33,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:33,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1137482567] [2025-02-06 09:22:33,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:33,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:33,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:33,471 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:33,471 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:34,091 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 488 [2025-02-06 09:22:34,093 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 481 places, 473 transitions, 966 flow. Second operand has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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-06 09:22:34,093 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:34,093 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 488 [2025-02-06 09:22:34,093 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:34,295 INFO L124 PetriNetUnfolderBase]: 37/812 cut-off events. [2025-02-06 09:22:34,295 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-02-06 09:22:34,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1049 conditions, 812 events. 37/812 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1753 event pairs, 36 based on Foata normal form. 0/769 useless extension candidates. Maximal degree in co-relation 792. Up to 198 conditions per place. [2025-02-06 09:22:34,297 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 93 selfloop transitions, 15 changer transitions 0/470 dead transitions. [2025-02-06 09:22:34,297 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 470 transitions, 1176 flow [2025-02-06 09:22:34,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:34,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:34,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2355 transitions. [2025-02-06 09:22:34,301 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043032786885246 [2025-02-06 09:22:34,301 INFO L175 Difference]: Start difference. First operand has 481 places, 473 transitions, 966 flow. Second operand 6 states and 2355 transitions. [2025-02-06 09:22:34,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 470 transitions, 1176 flow [2025-02-06 09:22:34,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 470 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:34,309 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 980 flow [2025-02-06 09:22:34,309 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=950, PETRI_DIFFERENCE_MINUEND_PLACES=473, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=470, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=980, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-02-06 09:22:34,311 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-02-06 09:22:34,311 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 980 flow [2025-02-06 09:22:34,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 378.5) internal successors, (2271), 6 states have internal predecessors, (2271), 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-06 09:22:34,312 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:34,312 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:34,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 09:22:34,312 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:34,312 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:34,312 INFO L85 PathProgramCache]: Analyzing trace with hash -1043417486, now seen corresponding path program 1 times [2025-02-06 09:22:34,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:34,312 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121321755] [2025-02-06 09:22:34,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:34,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:34,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-06 09:22:34,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-06 09:22:34,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:34,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:34,662 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-06 09:22:34,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:34,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121321755] [2025-02-06 09:22:34,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121321755] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:34,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:34,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:34,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105540010] [2025-02-06 09:22:34,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:34,663 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:34,663 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:34,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:34,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:35,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 488 [2025-02-06 09:22:35,118 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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-06 09:22:35,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:35,119 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 488 [2025-02-06 09:22:35,119 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:35,478 INFO L124 PetriNetUnfolderBase]: 365/1934 cut-off events. [2025-02-06 09:22:35,479 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:22:35,480 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2881 conditions, 1934 events. 365/1934 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9501 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2494. Up to 898 conditions per place. [2025-02-06 09:22:35,483 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 131 selfloop transitions, 15 changer transitions 0/467 dead transitions. [2025-02-06 09:22:35,483 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1266 flow [2025-02-06 09:22:35,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:35,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-02-06 09:22:35,487 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7394125683060109 [2025-02-06 09:22:35,487 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 980 flow. Second operand 6 states and 2165 transitions. [2025-02-06 09:22:35,487 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1266 flow [2025-02-06 09:22:35,489 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 467 transitions, 1236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:35,492 INFO L231 Difference]: Finished difference. Result has 475 places, 467 transitions, 974 flow [2025-02-06 09:22:35,492 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=944, PETRI_DIFFERENCE_MINUEND_PLACES=470, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=467, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=452, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=974, PETRI_PLACES=475, PETRI_TRANSITIONS=467} [2025-02-06 09:22:35,493 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -12 predicate places. [2025-02-06 09:22:35,493 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 467 transitions, 974 flow [2025-02-06 09:22:35,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 342.1666666666667) internal successors, (2053), 6 states have internal predecessors, (2053), 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-06 09:22:35,494 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:35,494 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:35,494 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 09:22:35,494 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:35,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:35,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1887725144, now seen corresponding path program 1 times [2025-02-06 09:22:35,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:35,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491468089] [2025-02-06 09:22:35,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:35,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:35,513 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-06 09:22:35,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-06 09:22:35,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:35,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:35,872 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-06 09:22:35,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:35,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491468089] [2025-02-06 09:22:35,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491468089] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:35,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:35,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795735585] [2025-02-06 09:22:35,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:35,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:35,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:35,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:35,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:36,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 488 [2025-02-06 09:22:36,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 475 places, 467 transitions, 974 flow. Second operand has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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-06 09:22:36,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:36,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 488 [2025-02-06 09:22:36,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:36,750 INFO L124 PetriNetUnfolderBase]: 365/1930 cut-off events. [2025-02-06 09:22:36,751 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-02-06 09:22:36,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2873 conditions, 1930 events. 365/1930 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 9501 event pairs, 364 based on Foata normal form. 0/1810 useless extension candidates. Maximal degree in co-relation 2490. Up to 894 conditions per place. [2025-02-06 09:22:36,757 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 128 selfloop transitions, 15 changer transitions 0/464 dead transitions. [2025-02-06 09:22:36,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 464 transitions, 1254 flow [2025-02-06 09:22:36,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:36,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2180 transitions. [2025-02-06 09:22:36,762 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2025-02-06 09:22:36,762 INFO L175 Difference]: Start difference. First operand has 475 places, 467 transitions, 974 flow. Second operand 6 states and 2180 transitions. [2025-02-06 09:22:36,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 464 transitions, 1254 flow [2025-02-06 09:22:36,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 464 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:36,766 INFO L231 Difference]: Finished difference. Result has 472 places, 464 transitions, 968 flow [2025-02-06 09:22:36,767 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=449, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=968, PETRI_PLACES=472, PETRI_TRANSITIONS=464} [2025-02-06 09:22:36,769 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -15 predicate places. [2025-02-06 09:22:36,769 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 464 transitions, 968 flow [2025-02-06 09:22:36,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 345.6666666666667) internal successors, (2074), 6 states have internal predecessors, (2074), 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-06 09:22:36,771 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:36,771 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:36,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 09:22:36,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:36,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:36,771 INFO L85 PathProgramCache]: Analyzing trace with hash 242584771, now seen corresponding path program 1 times [2025-02-06 09:22:36,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:36,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143759252] [2025-02-06 09:22:36,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:36,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:36,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 09:22:36,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 09:22:36,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:36,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:36,943 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-06 09:22:36,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143759252] [2025-02-06 09:22:36,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143759252] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:36,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [753319522] [2025-02-06 09:22:36,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:36,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:36,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:36,946 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-06 09:22:36,947 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-06 09:22:37,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-02-06 09:22:37,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-02-06 09:22:37,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:37,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:37,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-02-06 09:22:37,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:37,286 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-06 09:22:37,286 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:37,436 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-06 09:22:37,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [753319522] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:37,436 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:37,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-02-06 09:22:37,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583670214] [2025-02-06 09:22:37,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:37,437 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 09:22:37,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:37,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 09:22:37,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-06 09:22:37,555 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-02-06 09:22:37,558 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 472 places, 464 transitions, 968 flow. Second operand has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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-06 09:22:37,558 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:37,558 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-02-06 09:22:37,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:37,693 INFO L124 PetriNetUnfolderBase]: 7/752 cut-off events. [2025-02-06 09:22:37,693 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-02-06 09:22:37,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 752 events. 7/752 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 400 event pairs, 6 based on Foata normal form. 2/732 useless extension candidates. Maximal degree in co-relation 394. Up to 24 conditions per place. [2025-02-06 09:22:37,694 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 14 selfloop transitions, 9 changer transitions 0/472 dead transitions. [2025-02-06 09:22:37,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1032 flow [2025-02-06 09:22:37,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 09:22:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-02-06 09:22:37,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4264 transitions. [2025-02-06 09:22:37,704 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970856102003643 [2025-02-06 09:22:37,707 INFO L175 Difference]: Start difference. First operand has 472 places, 464 transitions, 968 flow. Second operand 9 states and 4264 transitions. [2025-02-06 09:22:37,707 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1032 flow [2025-02-06 09:22:37,709 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1002 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:37,712 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 988 flow [2025-02-06 09:22:37,713 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=467, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=464, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=458, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=988, PETRI_PLACES=478, PETRI_TRANSITIONS=470} [2025-02-06 09:22:37,713 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-02-06 09:22:37,713 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 988 flow [2025-02-06 09:22:37,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 472.8) internal successors, (4728), 10 states have internal predecessors, (4728), 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-06 09:22:37,715 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:37,716 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 09:22:37,724 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-06 09:22:37,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:37,920 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:37,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:37,921 INFO L85 PathProgramCache]: Analyzing trace with hash -112324731, now seen corresponding path program 2 times [2025-02-06 09:22:37,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:37,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982292215] [2025-02-06 09:22:37,921 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:37,971 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-02-06 09:22:37,976 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-02-06 09:22:37,976 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:37,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:38,180 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-02-06 09:22:38,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:38,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982292215] [2025-02-06 09:22:38,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982292215] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:38,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:38,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:38,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548599430] [2025-02-06 09:22:38,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:38,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:38,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:38,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:38,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:38,865 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 488 [2025-02-06 09:22:38,868 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 478 places, 470 transitions, 988 flow. Second operand has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-06 09:22:38,868 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:38,868 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 488 [2025-02-06 09:22:38,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:39,351 INFO L124 PetriNetUnfolderBase]: 257/2078 cut-off events. [2025-02-06 09:22:39,351 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-02-06 09:22:39,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2781 conditions, 2078 events. 257/2078 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10111 event pairs, 36 based on Foata normal form. 0/1951 useless extension candidates. Maximal degree in co-relation 2279. Up to 523 conditions per place. [2025-02-06 09:22:39,367 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 99 selfloop transitions, 75 changer transitions 0/547 dead transitions. [2025-02-06 09:22:39,370 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 547 transitions, 1490 flow [2025-02-06 09:22:39,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:39,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:39,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2504 transitions. [2025-02-06 09:22:39,377 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855191256830601 [2025-02-06 09:22:39,377 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 988 flow. Second operand 6 states and 2504 transitions. [2025-02-06 09:22:39,377 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 547 transitions, 1490 flow [2025-02-06 09:22:39,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 547 transitions, 1484 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-02-06 09:22:39,385 INFO L231 Difference]: Finished difference. Result has 486 places, 538 transitions, 1462 flow [2025-02-06 09:22:39,386 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=980, PETRI_DIFFERENCE_MINUEND_PLACES=476, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=469, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=442, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1462, PETRI_PLACES=486, PETRI_TRANSITIONS=538} [2025-02-06 09:22:39,387 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -1 predicate places. [2025-02-06 09:22:39,387 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 538 transitions, 1462 flow [2025-02-06 09:22:39,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 395.3333333333333) internal successors, (2372), 6 states have internal predecessors, (2372), 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-06 09:22:39,387 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:39,388 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:39,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 09:22:39,388 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:39,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:39,390 INFO L85 PathProgramCache]: Analyzing trace with hash -1442875350, now seen corresponding path program 1 times [2025-02-06 09:22:39,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:39,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15534431] [2025-02-06 09:22:39,390 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:39,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:39,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-06 09:22:39,602 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-06 09:22:39,602 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:39,602 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:39,997 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:39,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15534431] [2025-02-06 09:22:39,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15534431] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:39,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1077502028] [2025-02-06 09:22:39,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:39,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:39,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:40,000 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-06 09:22:40,007 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-06 09:22:40,203 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-02-06 09:22:40,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-02-06 09:22:40,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:40,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:40,391 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 09:22:40,405 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:40,746 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:40,746 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:41,110 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:41,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1077502028] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:41,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:41,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-02-06 09:22:41,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472432820] [2025-02-06 09:22:41,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:41,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 09:22:41,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:41,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 09:22:41,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-02-06 09:22:41,310 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-02-06 09:22:41,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 486 places, 538 transitions, 1462 flow. Second operand has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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-06 09:22:41,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:41,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-02-06 09:22:41,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:41,851 INFO L124 PetriNetUnfolderBase]: 150/2178 cut-off events. [2025-02-06 09:22:41,851 INFO L125 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-02-06 09:22:41,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2883 conditions, 2178 events. 150/2178 cut-off events. For 184/204 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7288 event pairs, 21 based on Foata normal form. 4/2094 useless extension candidates. Maximal degree in co-relation 1986. Up to 207 conditions per place. [2025-02-06 09:22:41,856 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 19 selfloop transitions, 21 changer transitions 0/556 dead transitions. [2025-02-06 09:22:41,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 556 transitions, 1630 flow [2025-02-06 09:22:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 09:22:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-02-06 09:22:41,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9934 transitions. [2025-02-06 09:22:41,865 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96935987509758 [2025-02-06 09:22:41,865 INFO L175 Difference]: Start difference. First operand has 486 places, 538 transitions, 1462 flow. Second operand 21 states and 9934 transitions. [2025-02-06 09:22:41,865 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 556 transitions, 1630 flow [2025-02-06 09:22:41,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 556 transitions, 1630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:41,873 INFO L231 Difference]: Finished difference. Result has 511 places, 551 transitions, 1592 flow [2025-02-06 09:22:41,873 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1462, PETRI_DIFFERENCE_MINUEND_PLACES=486, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=538, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1592, PETRI_PLACES=511, PETRI_TRANSITIONS=551} [2025-02-06 09:22:41,874 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 24 predicate places. [2025-02-06 09:22:41,874 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 551 transitions, 1592 flow [2025-02-06 09:22:41,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 472.8888888888889) internal successors, (8512), 18 states have internal predecessors, (8512), 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-06 09:22:41,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:41,876 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:41,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 09:22:42,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:42,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:42,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:42,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1236607570, now seen corresponding path program 2 times [2025-02-06 09:22:42,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:42,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259546912] [2025-02-06 09:22:42,083 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:42,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:42,189 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 936 statements into 2 equivalence classes. [2025-02-06 09:22:42,198 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 194 of 936 statements. [2025-02-06 09:22:42,198 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:42,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:42,561 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2025-02-06 09:22:42,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:42,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259546912] [2025-02-06 09:22:42,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259546912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:42,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:42,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:42,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965175516] [2025-02-06 09:22:42,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:42,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:42,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:42,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:42,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:43,105 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-02-06 09:22:43,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 511 places, 551 transitions, 1592 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-06 09:22:43,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:43,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-02-06 09:22:43,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:43,616 INFO L124 PetriNetUnfolderBase]: 212/2342 cut-off events. [2025-02-06 09:22:43,616 INFO L125 PetriNetUnfolderBase]: For 454/488 co-relation queries the response was YES. [2025-02-06 09:22:43,619 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3642 conditions, 2342 events. 212/2342 cut-off events. For 454/488 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 9069 event pairs, 54 based on Foata normal form. 0/2240 useless extension candidates. Maximal degree in co-relation 2540. Up to 572 conditions per place. [2025-02-06 09:22:43,623 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 150 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-02-06 09:22:43,623 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 550 transitions, 1900 flow [2025-02-06 09:22:43,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:43,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2455 transitions. [2025-02-06 09:22:43,626 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384562841530054 [2025-02-06 09:22:43,626 INFO L175 Difference]: Start difference. First operand has 511 places, 551 transitions, 1592 flow. Second operand 6 states and 2455 transitions. [2025-02-06 09:22:43,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 550 transitions, 1900 flow [2025-02-06 09:22:43,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 550 transitions, 1876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-02-06 09:22:43,634 INFO L231 Difference]: Finished difference. Result has 509 places, 550 transitions, 1576 flow [2025-02-06 09:22:43,634 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1576, PETRI_PLACES=509, PETRI_TRANSITIONS=550} [2025-02-06 09:22:43,635 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 22 predicate places. [2025-02-06 09:22:43,635 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 550 transitions, 1576 flow [2025-02-06 09:22:43,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-06 09:22:43,636 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:43,636 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:43,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 09:22:43,636 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:43,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064447, now seen corresponding path program 1 times [2025-02-06 09:22:43,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:43,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961720020] [2025-02-06 09:22:43,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:43,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:43,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-02-06 09:22:43,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-02-06 09:22:43,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:43,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:45,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:45,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:45,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961720020] [2025-02-06 09:22:45,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961720020] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:22:45,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1002680326] [2025-02-06 09:22:45,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:45,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:45,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:22:45,254 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-06 09:22:45,256 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-06 09:22:45,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-02-06 09:22:45,915 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-02-06 09:22:45,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:45,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:45,929 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-06 09:22:45,941 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:22:46,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:46,635 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:22:47,275 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-06 09:22:47,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1002680326] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 09:22:47,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 09:22:47,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-02-06 09:22:47,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535175377] [2025-02-06 09:22:47,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 09:22:47,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-06 09:22:47,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:47,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-06 09:22:47,280 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-02-06 09:22:47,478 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-02-06 09:22:47,482 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 509 places, 550 transitions, 1576 flow. Second operand has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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-06 09:22:47,482 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:47,482 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-02-06 09:22:47,482 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:48,173 INFO L124 PetriNetUnfolderBase]: 150/2495 cut-off events. [2025-02-06 09:22:48,174 INFO L125 PetriNetUnfolderBase]: For 301/321 co-relation queries the response was YES. [2025-02-06 09:22:48,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3281 conditions, 2495 events. 150/2495 cut-off events. For 301/321 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7270 event pairs, 21 based on Foata normal form. 3/2411 useless extension candidates. Maximal degree in co-relation 1997. Up to 207 conditions per place. [2025-02-06 09:22:48,179 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 22 selfloop transitions, 30 changer transitions 0/567 dead transitions. [2025-02-06 09:22:48,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 567 transitions, 1802 flow [2025-02-06 09:22:48,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-06 09:22:48,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-02-06 09:22:48,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14184 transitions. [2025-02-06 09:22:48,188 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688524590163935 [2025-02-06 09:22:48,188 INFO L175 Difference]: Start difference. First operand has 509 places, 550 transitions, 1576 flow. Second operand 30 states and 14184 transitions. [2025-02-06 09:22:48,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 567 transitions, 1802 flow [2025-02-06 09:22:48,192 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 567 transitions, 1792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-02-06 09:22:48,196 INFO L231 Difference]: Finished difference. Result has 537 places, 560 transitions, 1718 flow [2025-02-06 09:22:48,196 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1566, PETRI_DIFFERENCE_MINUEND_PLACES=504, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=550, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=1718, PETRI_PLACES=537, PETRI_TRANSITIONS=560} [2025-02-06 09:22:48,197 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 50 predicate places. [2025-02-06 09:22:48,197 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 560 transitions, 1718 flow [2025-02-06 09:22:48,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 473.0869565217391) internal successors, (10881), 23 states have internal predecessors, (10881), 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-06 09:22:48,199 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:48,199 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:48,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 09:22:48,402 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:22:48,403 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:48,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:48,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1647373346, now seen corresponding path program 2 times [2025-02-06 09:22:48,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:48,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054071862] [2025-02-06 09:22:48,405 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-06 09:22:48,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:48,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1305 statements into 2 equivalence classes. [2025-02-06 09:22:48,588 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 1305 statements. [2025-02-06 09:22:48,588 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-06 09:22:48,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:48,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-02-06 09:22:48,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:48,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054071862] [2025-02-06 09:22:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054071862] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:48,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:48,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000485554] [2025-02-06 09:22:48,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:48,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:48,999 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:48,999 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:49,617 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-02-06 09:22:49,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 537 places, 560 transitions, 1718 flow. Second operand has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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-06 09:22:49,619 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:49,619 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-02-06 09:22:49,619 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:50,830 INFO L124 PetriNetUnfolderBase]: 530/3564 cut-off events. [2025-02-06 09:22:50,831 INFO L125 PetriNetUnfolderBase]: For 951/1034 co-relation queries the response was YES. [2025-02-06 09:22:50,834 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6052 conditions, 3564 events. 530/3564 cut-off events. For 951/1034 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16077 event pairs, 92 based on Foata normal form. 16/3423 useless extension candidates. Maximal degree in co-relation 4487. Up to 1097 conditions per place. [2025-02-06 09:22:50,843 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 163 selfloop transitions, 130 changer transitions 0/697 dead transitions. [2025-02-06 09:22:50,844 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 697 transitions, 2954 flow [2025-02-06 09:22:50,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:50,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:50,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2533 transitions. [2025-02-06 09:22:50,846 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650956284153005 [2025-02-06 09:22:50,846 INFO L175 Difference]: Start difference. First operand has 537 places, 560 transitions, 1718 flow. Second operand 6 states and 2533 transitions. [2025-02-06 09:22:50,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 697 transitions, 2954 flow [2025-02-06 09:22:50,851 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 697 transitions, 2908 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-02-06 09:22:50,856 INFO L231 Difference]: Finished difference. Result has 529 places, 689 transitions, 2900 flow [2025-02-06 09:22:50,857 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=1672, PETRI_DIFFERENCE_MINUEND_PLACES=519, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=560, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=523, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2900, PETRI_PLACES=529, PETRI_TRANSITIONS=689} [2025-02-06 09:22:50,858 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 42 predicate places. [2025-02-06 09:22:50,858 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 689 transitions, 2900 flow [2025-02-06 09:22:50,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 405.5) internal successors, (2433), 6 states have internal predecessors, (2433), 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-06 09:22:50,858 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:50,859 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:50,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 09:22:50,859 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:50,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:50,861 INFO L85 PathProgramCache]: Analyzing trace with hash 860894093, now seen corresponding path program 1 times [2025-02-06 09:22:50,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:50,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418207298] [2025-02-06 09:22:50,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:50,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:50,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-02-06 09:22:51,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-02-06 09:22:51,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:51,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:54,275 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-02-06 09:22:54,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:54,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418207298] [2025-02-06 09:22:54,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418207298] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:54,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:54,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:54,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213530165] [2025-02-06 09:22:54,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:54,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:54,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:54,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:54,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:22:54,800 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 488 [2025-02-06 09:22:54,802 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 529 places, 689 transitions, 2900 flow. Second operand has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-06 09:22:54,802 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:22:54,802 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 488 [2025-02-06 09:22:54,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:22:56,209 INFO L124 PetriNetUnfolderBase]: 806/4335 cut-off events. [2025-02-06 09:22:56,210 INFO L125 PetriNetUnfolderBase]: For 3369/3576 co-relation queries the response was YES. [2025-02-06 09:22:56,220 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8916 conditions, 4335 events. 806/4335 cut-off events. For 3369/3576 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22243 event pairs, 65 based on Foata normal form. 52/4222 useless extension candidates. Maximal degree in co-relation 7368. Up to 1357 conditions per place. [2025-02-06 09:22:56,231 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 285 selfloop transitions, 131 changer transitions 5/827 dead transitions. [2025-02-06 09:22:56,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 827 transitions, 4642 flow [2025-02-06 09:22:56,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:22:56,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:22:56,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2025-02-06 09:22:56,234 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2025-02-06 09:22:56,234 INFO L175 Difference]: Start difference. First operand has 529 places, 689 transitions, 2900 flow. Second operand 6 states and 2524 transitions. [2025-02-06 09:22:56,234 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 827 transitions, 4642 flow [2025-02-06 09:22:56,247 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 827 transitions, 4642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-02-06 09:22:56,265 INFO L231 Difference]: Finished difference. Result has 539 places, 817 transitions, 4380 flow [2025-02-06 09:22:56,267 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=2900, PETRI_DIFFERENCE_MINUEND_PLACES=529, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=651, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4380, PETRI_PLACES=539, PETRI_TRANSITIONS=817} [2025-02-06 09:22:56,268 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 52 predicate places. [2025-02-06 09:22:56,268 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 817 transitions, 4380 flow [2025-02-06 09:22:56,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 404.0) internal successors, (2424), 6 states have internal predecessors, (2424), 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-06 09:22:56,272 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:22:56,272 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:22:56,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 09:22:56,273 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:22:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:22:56,280 INFO L85 PathProgramCache]: Analyzing trace with hash -919070086, now seen corresponding path program 1 times [2025-02-06 09:22:56,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:22:56,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950803840] [2025-02-06 09:22:56,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:22:56,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:22:56,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1316 statements into 1 equivalence classes. [2025-02-06 09:22:56,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1316 of 1316 statements. [2025-02-06 09:22:56,587 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:22:56,587 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:22:59,753 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-02-06 09:22:59,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:22:59,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950803840] [2025-02-06 09:22:59,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950803840] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 09:22:59,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 09:22:59,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 09:22:59,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967359316] [2025-02-06 09:22:59,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 09:22:59,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 09:22:59,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 09:22:59,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 09:22:59,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-02-06 09:23:00,298 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 488 [2025-02-06 09:23:00,300 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 539 places, 817 transitions, 4380 flow. Second operand has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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-06 09:23:00,300 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-02-06 09:23:00,300 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 488 [2025-02-06 09:23:00,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-02-06 09:23:02,192 INFO L124 PetriNetUnfolderBase]: 1308/5703 cut-off events. [2025-02-06 09:23:02,193 INFO L125 PetriNetUnfolderBase]: For 4874/4931 co-relation queries the response was YES. [2025-02-06 09:23:02,203 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13640 conditions, 5703 events. 1308/5703 cut-off events. For 4874/4931 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33818 event pairs, 369 based on Foata normal form. 11/5469 useless extension candidates. Maximal degree in co-relation 12008. Up to 2597 conditions per place. [2025-02-06 09:23:02,228 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 364 selfloop transitions, 84 changer transitions 0/896 dead transitions. [2025-02-06 09:23:02,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 896 transitions, 5674 flow [2025-02-06 09:23:02,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 09:23:02,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-02-06 09:23:02,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2332 transitions. [2025-02-06 09:23:02,230 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2025-02-06 09:23:02,233 INFO L175 Difference]: Start difference. First operand has 539 places, 817 transitions, 4380 flow. Second operand 6 states and 2332 transitions. [2025-02-06 09:23:02,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 896 transitions, 5674 flow [2025-02-06 09:23:02,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 896 transitions, 5420 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-02-06 09:23:02,272 INFO L231 Difference]: Finished difference. Result has 548 places, 888 transitions, 4916 flow [2025-02-06 09:23:02,277 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=488, PETRI_DIFFERENCE_MINUEND_FLOW=4132, PETRI_DIFFERENCE_MINUEND_PLACES=538, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=817, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=769, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4916, PETRI_PLACES=548, PETRI_TRANSITIONS=888} [2025-02-06 09:23:02,277 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 61 predicate places. [2025-02-06 09:23:02,278 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 888 transitions, 4916 flow [2025-02-06 09:23:02,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 372.6666666666667) internal successors, (2236), 6 states have internal predecessors, (2236), 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-06 09:23:02,278 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-02-06 09:23:02,278 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-06 09:23:02,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 09:23:02,279 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr23ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr22ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE (and 34 more)] === [2025-02-06 09:23:02,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 09:23:02,281 INFO L85 PathProgramCache]: Analyzing trace with hash 585557596, now seen corresponding path program 1 times [2025-02-06 09:23:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 09:23:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376325782] [2025-02-06 09:23:02,281 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:02,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 09:23:02,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-02-06 09:23:04,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-02-06 09:23:04,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:04,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:21,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 57 proven. 1137 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2025-02-06 09:23:21,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 09:23:21,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376325782] [2025-02-06 09:23:21,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376325782] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 09:23:21,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [211754772] [2025-02-06 09:23:21,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 09:23:21,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 09:23:21,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 09:23:21,861 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-06 09:23:21,862 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-06 09:23:22,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-02-06 09:23:23,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-02-06 09:23:23,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 09:23:23,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 09:23:23,267 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-02-06 09:23:23,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 09:23:23,411 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-02-06 09:23:23,412 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-06 09:23:23,559 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-06 09:23:23,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-02-06 09:23:24,102 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-02-06 09:23:24,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-02-06 09:23:24,501 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-02-06 09:23:24,710 INFO L349 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2025-02-06 09:23:24,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 33 treesize of output 57 [2025-02-06 09:23:24,853 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 50 treesize of output 39 [2025-02-06 09:23:25,013 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 50 treesize of output 39 [2025-02-06 09:23:25,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2025-02-06 09:23:26,401 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-06 09:23:26,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 09:23:27,257 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:27,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:28,726 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:28,726 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:29,378 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:29,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:30,704 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:30,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:31,384 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:31,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:32,807 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:32,807 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:33,433 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:33,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:34,645 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:34,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:35,236 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:35,236 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:36,759 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:36,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:37,416 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-06 09:23:37,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 09:23:38,690 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-02-06 09:23:38,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 34 treesize of output 52 [2025-02-06 09:23:39,281 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-06 09:23:39,281 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 09:23:40,641 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-06 09:23:40,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 09:23:41,296 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-02-06 09:23:41,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 27 treesize of output 38 [2025-02-06 09:23:43,058 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-02-06 09:23:43,058 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 32 treesize of output 57 [2025-02-06 09:23:44,957 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-02-06 09:23:44,957 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 39 treesize of output 64 [2025-02-06 09:23:47,511 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-02-06 09:23:47,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 10 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 31 treesize of output 39 [2025-02-06 09:23:47,578 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-06 09:23:47,610 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-06 09:23:47,645 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:23:47,646 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-06 09:23:47,684 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-06 09:23:47,684 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-06 09:23:47,730 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 40 [2025-02-06 09:23:47,775 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 1021 proven. 552 refuted. 0 times theorem prover too weak. 3217 trivial. 0 not checked. [2025-02-06 09:23:47,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 09:23:49,564 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* |c_ULTIMATE.start_main_~j~0#1| 4))) (let ((.cse2 (+ |c_~#slot~0.offset| 3 .cse1))) (let ((.cse0 (store |c_#race| |c_~#slot~0.base| (store (select |c_#race| |c_~#slot~0.base|) .cse2 0)))) (and (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1 1)) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) .cse2) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| 2 .cse1)) 0)) (forall ((v_ArrVal_12036 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_new_~p~0#1.base| v_ArrVal_12036) |c_~#slot~0.base|) (+ |c_~#slot~0.offset| .cse1)) 0)))))) is different from false