./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 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-798a7b3-m [2025-03-04 06:46:56,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:46:56,123 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:46:56,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:46:56,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:46:56,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:46:56,150 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:46:56,150 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:46:56,151 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:46:56,151 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:46:56,151 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:46:56,151 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:46:56,152 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:46:56,152 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:46:56,152 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:46:56,152 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:46:56,153 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:46:56,154 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:56,154 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:46:56,154 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:46:56,155 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:46:56,155 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:46:56,155 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:46:56,155 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:46:56,155 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:46:56,155 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/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-03-04 06:46:56,371 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:46:56,376 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:46:56,378 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:46:56,379 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:46:56,379 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:46:56,380 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-04 06:46:57,513 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8909ae3/53798b9ae7b3497f89b55be4d102fe38/FLAG38e63f302 [2025-03-04 06:46:57,904 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:46:57,906 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_13-arraycollapse_nr.i [2025-03-04 06:46:57,926 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8909ae3/53798b9ae7b3497f89b55be4d102fe38/FLAG38e63f302 [2025-03-04 06:46:58,094 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8909ae3/53798b9ae7b3497f89b55be4d102fe38 [2025-03-04 06:46:58,096 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:46:58,097 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:46:58,098 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:58,099 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:46:58,101 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:46:58,102 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,103 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4316ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58, skipping insertion in model container [2025-03-04 06:46:58,103 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,137 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:46:58,510 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:58,546 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:46:58,604 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:46:58,659 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:46:58,659 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58 WrapperNode [2025-03-04 06:46:58,659 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:46:58,660 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:58,660 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:46:58,660 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:46:58,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,709 INFO L138 Inliner]: procedures = 372, calls = 95, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 414 [2025-03-04 06:46:58,710 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:46:58,710 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:46:58,710 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:46:58,711 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:46:58,715 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,726 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,727 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,752 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,757 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,759 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,761 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,769 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:46:58,770 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:46:58,770 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:46:58,770 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:46:58,770 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (1/1) ... [2025-03-04 06:46:58,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:58,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:46:58,795 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:46:58,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:46:58,814 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:46:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:46:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:46:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:46:58,815 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:46:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:46:58,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:46:58,815 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:46:58,816 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:46:58,932 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:46:58,933 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:46:59,558 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:46:59,559 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:46:59,596 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:46:59,596 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:46:59,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:59 BoogieIcfgContainer [2025-03-04 06:46:59,596 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:46:59,598 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:46:59,598 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:46:59,604 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:46:59,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:46:58" (1/3) ... [2025-03-04 06:46:59,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f349c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:59, skipping insertion in model container [2025-03-04 06:46:59,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:46:58" (2/3) ... [2025-03-04 06:46:59,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f349c0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:46:59, skipping insertion in model container [2025-03-04 06:46:59,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:46:59" (3/3) ... [2025-03-04 06:46:59,606 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_13-arraycollapse_nr.i [2025-03-04 06:46:59,617 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:46:59,620 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-03-04 06:46:59,622 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:46:59,705 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:46:59,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 488 places, 488 transitions, 980 flow [2025-03-04 06:46:59,840 INFO L124 PetriNetUnfolderBase]: 4/487 cut-off events. [2025-03-04 06:46:59,844 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:59,848 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-03-04 06:46:59,848 INFO L82 GeneralOperation]: Start removeDead. Operand has 488 places, 488 transitions, 980 flow [2025-03-04 06:46:59,880 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 487 places, 487 transitions, 977 flow [2025-03-04 06:46:59,892 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:46:59,905 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;@73bfe5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:46:59,905 INFO L334 AbstractCegarLoop]: Starting to check reachability of 37 error locations. [2025-03-04 06:46:59,924 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:46:59,925 INFO L124 PetriNetUnfolderBase]: 1/102 cut-off events. [2025-03-04 06:46:59,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:46:59,925 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:46:59,926 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-03-04 06:46:59,927 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-03-04 06:46:59,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:46:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash -538343192, now seen corresponding path program 1 times [2025-03-04 06:46:59,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:46:59,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923793841] [2025-03-04 06:46:59,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:46:59,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:00,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 85 statements into 1 equivalence classes. [2025-03-04 06:47:00,056 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 85 of 85 statements. [2025-03-04 06:47:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:00,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:00,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923793841] [2025-03-04 06:47:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923793841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:00,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040421835] [2025-03-04 06:47:00,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:00,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:00,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:01,446 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-03-04 06:47:01,450 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-03-04 06:47:01,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:01,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-03-04 06:47:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:01,843 INFO L124 PetriNetUnfolderBase]: 365/1842 cut-off events. [2025-03-04 06:47:01,843 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:01,849 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-03-04 06:47:01,857 INFO L140 encePairwiseOnDemand]: 461/488 looper letters, 113 selfloop transitions, 20 changer transitions 2/480 dead transitions. [2025-03-04 06:47:01,857 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 488 places, 480 transitions, 1229 flow [2025-03-04 06:47:01,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:01,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:01,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2228 transitions. [2025-03-04 06:47:01,879 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7609289617486339 [2025-03-04 06:47:01,880 INFO L175 Difference]: Start difference. First operand has 487 places, 487 transitions, 977 flow. Second operand 6 states and 2228 transitions. [2025-03-04 06:47:01,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 488 places, 480 transitions, 1229 flow [2025-03-04 06:47:01,888 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 487 places, 480 transitions, 1228 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:01,900 INFO L231 Difference]: Finished difference. Result has 487 places, 478 transitions, 998 flow [2025-03-04 06:47:01,902 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-03-04 06:47:01,905 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 0 predicate places. [2025-03-04 06:47:01,906 INFO L471 AbstractCegarLoop]: Abstraction has has 487 places, 478 transitions, 998 flow [2025-03-04 06:47:01,908 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-03-04 06:47:01,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:01,908 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-03-04 06:47:01,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:01,909 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-03-04 06:47:01,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:01,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1447730720, now seen corresponding path program 1 times [2025-03-04 06:47:01,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:01,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377346475] [2025-03-04 06:47:01,910 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:01,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:01,932 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-04 06:47:01,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-04 06:47:01,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:01,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:02,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:02,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:02,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377346475] [2025-03-04 06:47:02,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377346475] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:02,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:02,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:02,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818927346] [2025-03-04 06:47:02,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:02,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:02,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:02,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:02,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:03,038 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 348 out of 488 [2025-03-04 06:47:03,040 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-03-04 06:47:03,040 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:03,041 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 348 of 488 [2025-03-04 06:47:03,041 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:03,241 INFO L124 PetriNetUnfolderBase]: 365/1836 cut-off events. [2025-03-04 06:47:03,242 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:03,244 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-03-04 06:47:03,248 INFO L140 encePairwiseOnDemand]: 464/488 looper letters, 113 selfloop transitions, 20 changer transitions 0/474 dead transitions. [2025-03-04 06:47:03,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 486 places, 474 transitions, 1256 flow [2025-03-04 06:47:03,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:03,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:03,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2225 transitions. [2025-03-04 06:47:03,253 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7599043715846995 [2025-03-04 06:47:03,253 INFO L175 Difference]: Start difference. First operand has 487 places, 478 transitions, 998 flow. Second operand 6 states and 2225 transitions. [2025-03-04 06:47:03,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 486 places, 474 transitions, 1256 flow [2025-03-04 06:47:03,255 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 474 transitions, 1216 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:03,259 INFO L231 Difference]: Finished difference. Result has 481 places, 474 transitions, 990 flow [2025-03-04 06:47:03,260 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-03-04 06:47:03,260 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-03-04 06:47:03,260 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 474 transitions, 990 flow [2025-03-04 06:47:03,261 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-03-04 06:47:03,261 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:03,261 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-03-04 06:47:03,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:03,262 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-03-04 06:47:03,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:03,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1954067955, now seen corresponding path program 1 times [2025-03-04 06:47:03,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:03,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245144359] [2025-03-04 06:47:03,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:03,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:03,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 105 statements into 1 equivalence classes. [2025-03-04 06:47:03,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 105 of 105 statements. [2025-03-04 06:47:03,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:03,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:03,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:03,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245144359] [2025-03-04 06:47:03,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245144359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:03,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:03,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:03,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863585540] [2025-03-04 06:47:03,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:03,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:03,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:03,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:03,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:04,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 349 out of 488 [2025-03-04 06:47:04,295 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-03-04 06:47:04,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:04,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 349 of 488 [2025-03-04 06:47:04,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:04,469 INFO L124 PetriNetUnfolderBase]: 391/1924 cut-off events. [2025-03-04 06:47:04,469 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:04,471 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-03-04 06:47:04,476 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 130 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-03-04 06:47:04,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 485 places, 473 transitions, 1258 flow [2025-03-04 06:47:04,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:04,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:04,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2230 transitions. [2025-03-04 06:47:04,482 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7616120218579235 [2025-03-04 06:47:04,482 INFO L175 Difference]: Start difference. First operand has 481 places, 474 transitions, 990 flow. Second operand 6 states and 2230 transitions. [2025-03-04 06:47:04,482 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 485 places, 473 transitions, 1258 flow [2025-03-04 06:47:04,484 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 473 transitions, 1218 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:04,488 INFO L231 Difference]: Finished difference. Result has 480 places, 473 transitions, 958 flow [2025-03-04 06:47:04,489 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-03-04 06:47:04,489 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -7 predicate places. [2025-03-04 06:47:04,489 INFO L471 AbstractCegarLoop]: Abstraction has has 480 places, 473 transitions, 958 flow [2025-03-04 06:47:04,491 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-03-04 06:47:04,491 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:04,491 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-03-04 06:47:04,491 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:04,491 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-03-04 06:47:04,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:04,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1076505214, now seen corresponding path program 1 times [2025-03-04 06:47:04,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:04,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141181770] [2025-03-04 06:47:04,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:04,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:04,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-04 06:47:04,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-04 06:47:04,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:04,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:04,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:04,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:04,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141181770] [2025-03-04 06:47:04,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141181770] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:04,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:04,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:04,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827376683] [2025-03-04 06:47:04,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:04,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:04,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:04,602 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:04,602 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:04,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 474 out of 488 [2025-03-04 06:47:04,627 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-03-04 06:47:04,627 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:04,627 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 474 of 488 [2025-03-04 06:47:04,627 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:04,677 INFO L124 PetriNetUnfolderBase]: 7/658 cut-off events. [2025-03-04 06:47:04,677 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:04,678 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-03-04 06:47:04,679 INFO L140 encePairwiseOnDemand]: 485/488 looper letters, 10 selfloop transitions, 2 changer transitions 0/474 dead transitions. [2025-03-04 06:47:04,679 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 474 transitions, 984 flow [2025-03-04 06:47:04,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:04,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:04,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1435 transitions. [2025-03-04 06:47:04,682 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.980191256830601 [2025-03-04 06:47:04,682 INFO L175 Difference]: Start difference. First operand has 480 places, 473 transitions, 958 flow. Second operand 3 states and 1435 transitions. [2025-03-04 06:47:04,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 474 transitions, 984 flow [2025-03-04 06:47:04,684 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 477 places, 474 transitions, 974 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:04,689 INFO L231 Difference]: Finished difference. Result has 478 places, 474 transitions, 960 flow [2025-03-04 06:47:04,689 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-03-04 06:47:04,690 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-04 06:47:04,690 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 474 transitions, 960 flow [2025-03-04 06:47:04,691 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-03-04 06:47:04,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:04,691 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-03-04 06:47:04,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:04,691 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-03-04 06:47:04,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:04,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2022354614, now seen corresponding path program 1 times [2025-03-04 06:47:04,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:04,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519616183] [2025-03-04 06:47:04,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:04,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:04,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-04 06:47:04,717 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-04 06:47:04,717 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:04,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:05,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:05,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:05,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519616183] [2025-03-04 06:47:05,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519616183] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:05,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:05,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:05,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922755729] [2025-03-04 06:47:05,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:05,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:05,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:05,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:05,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:05,901 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 391 out of 488 [2025-03-04 06:47:05,903 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-03-04 06:47:05,903 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:05,903 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 391 of 488 [2025-03-04 06:47:05,903 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:06,065 INFO L124 PetriNetUnfolderBase]: 55/899 cut-off events. [2025-03-04 06:47:06,065 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-03-04 06:47:06,066 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-03-04 06:47:06,068 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 89 selfloop transitions, 5 changer transitions 0/473 dead transitions. [2025-03-04 06:47:06,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 473 transitions, 1146 flow [2025-03-04 06:47:06,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:06,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:06,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2440 transitions. [2025-03-04 06:47:06,072 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8333333333333334 [2025-03-04 06:47:06,073 INFO L175 Difference]: Start difference. First operand has 478 places, 474 transitions, 960 flow. Second operand 6 states and 2440 transitions. [2025-03-04 06:47:06,074 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 473 transitions, 1146 flow [2025-03-04 06:47:06,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 473 transitions, 1144 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:06,083 INFO L231 Difference]: Finished difference. Result has 481 places, 473 transitions, 966 flow [2025-03-04 06:47:06,084 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-03-04 06:47:06,085 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -6 predicate places. [2025-03-04 06:47:06,085 INFO L471 AbstractCegarLoop]: Abstraction has has 481 places, 473 transitions, 966 flow [2025-03-04 06:47:06,086 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-03-04 06:47:06,086 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:06,086 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-03-04 06:47:06,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 06:47:06,086 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-03-04 06:47:06,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:06,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1856699464, now seen corresponding path program 1 times [2025-03-04 06:47:06,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:06,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226606142] [2025-03-04 06:47:06,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:06,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:06,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-04 06:47:06,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-04 06:47:06,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:06,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:06,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:06,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:06,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226606142] [2025-03-04 06:47:06,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226606142] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:06,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:06,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:06,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526275078] [2025-03-04 06:47:06,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:06,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:06,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:06,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:06,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:06,994 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 374 out of 488 [2025-03-04 06:47:06,996 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-03-04 06:47:06,996 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:06,996 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 374 of 488 [2025-03-04 06:47:06,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:07,234 INFO L124 PetriNetUnfolderBase]: 37/812 cut-off events. [2025-03-04 06:47:07,234 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-03-04 06:47:07,235 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-03-04 06:47:07,236 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 93 selfloop transitions, 15 changer transitions 0/470 dead transitions. [2025-03-04 06:47:07,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 483 places, 470 transitions, 1176 flow [2025-03-04 06:47:07,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:07,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:07,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2355 transitions. [2025-03-04 06:47:07,240 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8043032786885246 [2025-03-04 06:47:07,240 INFO L175 Difference]: Start difference. First operand has 481 places, 473 transitions, 966 flow. Second operand 6 states and 2355 transitions. [2025-03-04 06:47:07,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 483 places, 470 transitions, 1176 flow [2025-03-04 06:47:07,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 478 places, 470 transitions, 1166 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:07,245 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 980 flow [2025-03-04 06:47:07,246 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-03-04 06:47:07,246 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-04 06:47:07,246 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 980 flow [2025-03-04 06:47:07,247 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-03-04 06:47:07,247 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:07,247 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-03-04 06:47:07,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:07,248 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-03-04 06:47:07,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:07,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1043417486, now seen corresponding path program 1 times [2025-03-04 06:47:07,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:07,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173877373] [2025-03-04 06:47:07,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:07,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:07,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-03-04 06:47:07,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-03-04 06:47:07,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:07,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:07,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:07,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:07,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173877373] [2025-03-04 06:47:07,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173877373] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:07,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:07,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:07,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859219065] [2025-03-04 06:47:07,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:07,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:07,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:07,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:07,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:08,064 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 336 out of 488 [2025-03-04 06:47:08,066 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-03-04 06:47:08,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:08,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 336 of 488 [2025-03-04 06:47:08,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:08,448 INFO L124 PetriNetUnfolderBase]: 365/1934 cut-off events. [2025-03-04 06:47:08,448 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:08,450 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-03-04 06:47:08,455 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 131 selfloop transitions, 15 changer transitions 0/467 dead transitions. [2025-03-04 06:47:08,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 467 transitions, 1266 flow [2025-03-04 06:47:08,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:08,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:08,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2165 transitions. [2025-03-04 06:47:08,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7394125683060109 [2025-03-04 06:47:08,459 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 980 flow. Second operand 6 states and 2165 transitions. [2025-03-04 06:47:08,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 467 transitions, 1266 flow [2025-03-04 06:47:08,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 467 transitions, 1236 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:08,465 INFO L231 Difference]: Finished difference. Result has 475 places, 467 transitions, 974 flow [2025-03-04 06:47:08,466 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-03-04 06:47:08,468 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -12 predicate places. [2025-03-04 06:47:08,468 INFO L471 AbstractCegarLoop]: Abstraction has has 475 places, 467 transitions, 974 flow [2025-03-04 06:47:08,469 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-03-04 06:47:08,469 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:08,469 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-03-04 06:47:08,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 06:47:08,469 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-03-04 06:47:08,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:08,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1887725144, now seen corresponding path program 1 times [2025-03-04 06:47:08,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:08,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981645013] [2025-03-04 06:47:08,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:08,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:08,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-04 06:47:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-04 06:47:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:08,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:08,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:08,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981645013] [2025-03-04 06:47:08,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981645013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:08,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:08,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:08,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552907461] [2025-03-04 06:47:08,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:08,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:08,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:08,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:08,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:09,228 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 339 out of 488 [2025-03-04 06:47:09,230 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-03-04 06:47:09,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:09,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 339 of 488 [2025-03-04 06:47:09,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:09,555 INFO L124 PetriNetUnfolderBase]: 365/1930 cut-off events. [2025-03-04 06:47:09,555 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-04 06:47:09,557 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-03-04 06:47:09,562 INFO L140 encePairwiseOnDemand]: 470/488 looper letters, 128 selfloop transitions, 15 changer transitions 0/464 dead transitions. [2025-03-04 06:47:09,562 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 477 places, 464 transitions, 1254 flow [2025-03-04 06:47:09,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:09,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:09,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2180 transitions. [2025-03-04 06:47:09,566 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.744535519125683 [2025-03-04 06:47:09,566 INFO L175 Difference]: Start difference. First operand has 475 places, 467 transitions, 974 flow. Second operand 6 states and 2180 transitions. [2025-03-04 06:47:09,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 477 places, 464 transitions, 1254 flow [2025-03-04 06:47:09,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 472 places, 464 transitions, 1224 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:09,571 INFO L231 Difference]: Finished difference. Result has 472 places, 464 transitions, 968 flow [2025-03-04 06:47:09,572 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-03-04 06:47:09,572 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -15 predicate places. [2025-03-04 06:47:09,573 INFO L471 AbstractCegarLoop]: Abstraction has has 472 places, 464 transitions, 968 flow [2025-03-04 06:47:09,574 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-03-04 06:47:09,574 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:09,574 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-03-04 06:47:09,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:09,574 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-03-04 06:47:09,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:09,574 INFO L85 PathProgramCache]: Analyzing trace with hash 242584771, now seen corresponding path program 1 times [2025-03-04 06:47:09,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:09,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483726650] [2025-03-04 06:47:09,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:09,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:09,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 06:47:09,613 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 06:47:09,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:09,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:09,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483726650] [2025-03-04 06:47:09,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483726650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:09,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972161407] [2025-03-04 06:47:09,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:09,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:09,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:47:09,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-04 06:47:09,927 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-04 06:47:09,927 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:09,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:09,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 757 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:09,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:10,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:10,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:10,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:10,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972161407] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:10,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:10,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:10,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191593987] [2025-03-04 06:47:10,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:10,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:10,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:10,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:10,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:10,358 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-04 06:47:10,361 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-03-04 06:47:10,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:10,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-04 06:47:10,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:10,470 INFO L124 PetriNetUnfolderBase]: 7/752 cut-off events. [2025-03-04 06:47:10,470 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:10,471 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-03-04 06:47:10,472 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 14 selfloop transitions, 9 changer transitions 0/472 dead transitions. [2025-03-04 06:47:10,472 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 480 places, 472 transitions, 1032 flow [2025-03-04 06:47:10,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:10,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 4264 transitions. [2025-03-04 06:47:10,478 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.970856102003643 [2025-03-04 06:47:10,478 INFO L175 Difference]: Start difference. First operand has 472 places, 464 transitions, 968 flow. Second operand 9 states and 4264 transitions. [2025-03-04 06:47:10,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 480 places, 472 transitions, 1032 flow [2025-03-04 06:47:10,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 475 places, 472 transitions, 1002 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:10,484 INFO L231 Difference]: Finished difference. Result has 478 places, 470 transitions, 988 flow [2025-03-04 06:47:10,484 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-03-04 06:47:10,485 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -9 predicate places. [2025-03-04 06:47:10,485 INFO L471 AbstractCegarLoop]: Abstraction has has 478 places, 470 transitions, 988 flow [2025-03-04 06:47:10,487 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-03-04 06:47:10,487 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:10,487 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-03-04 06:47:10,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:10,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:10,688 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-03-04 06:47:10,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:10,689 INFO L85 PathProgramCache]: Analyzing trace with hash -112324731, now seen corresponding path program 2 times [2025-03-04 06:47:10,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:10,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578202865] [2025-03-04 06:47:10,689 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:10,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:10,739 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 446 statements into 2 equivalence classes. [2025-03-04 06:47:10,743 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 128 of 446 statements. [2025-03-04 06:47:10,744 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:10,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-04 06:47:10,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:10,957 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578202865] [2025-03-04 06:47:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578202865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:10,957 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:10,957 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:10,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660153325] [2025-03-04 06:47:10,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:10,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:10,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:10,958 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:10,958 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:11,637 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 388 out of 488 [2025-03-04 06:47:11,638 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-03-04 06:47:11,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:11,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 388 of 488 [2025-03-04 06:47:11,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:12,072 INFO L124 PetriNetUnfolderBase]: 257/2078 cut-off events. [2025-03-04 06:47:12,073 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-04 06:47:12,074 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-03-04 06:47:12,078 INFO L140 encePairwiseOnDemand]: 459/488 looper letters, 99 selfloop transitions, 75 changer transitions 0/547 dead transitions. [2025-03-04 06:47:12,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 482 places, 547 transitions, 1490 flow [2025-03-04 06:47:12,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:12,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:12,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2504 transitions. [2025-03-04 06:47:12,082 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.855191256830601 [2025-03-04 06:47:12,082 INFO L175 Difference]: Start difference. First operand has 478 places, 470 transitions, 988 flow. Second operand 6 states and 2504 transitions. [2025-03-04 06:47:12,082 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 482 places, 547 transitions, 1490 flow [2025-03-04 06:47:12,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 481 places, 547 transitions, 1484 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:12,088 INFO L231 Difference]: Finished difference. Result has 486 places, 538 transitions, 1462 flow [2025-03-04 06:47:12,089 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-03-04 06:47:12,089 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, -1 predicate places. [2025-03-04 06:47:12,089 INFO L471 AbstractCegarLoop]: Abstraction has has 486 places, 538 transitions, 1462 flow [2025-03-04 06:47:12,090 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-03-04 06:47:12,090 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:12,090 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-03-04 06:47:12,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:12,091 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-03-04 06:47:12,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:12,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1442875350, now seen corresponding path program 1 times [2025-03-04 06:47:12,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:12,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774649871] [2025-03-04 06:47:12,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:12,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:12,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 06:47:12,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 06:47:12,197 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:12,197 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:12,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774649871] [2025-03-04 06:47:12,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774649871] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:12,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890449529] [2025-03-04 06:47:12,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:12,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:12,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:12,590 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:12,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:47:12,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 512 statements into 1 equivalence classes. [2025-03-04 06:47:12,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 512 of 512 statements. [2025-03-04 06:47:12,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:12,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:12,996 INFO L256 TraceCheckSpWp]: Trace formula consists of 1878 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:13,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:13,307 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:13,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:13,624 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 0 proven. 321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:13,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890449529] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:13,624 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:13,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:47:13,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058913343] [2025-03-04 06:47:13,624 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:13,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:47:13,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:13,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:47:13,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:47:13,823 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-04 06:47:13,827 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-03-04 06:47:13,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:13,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-04 06:47:13,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:14,290 INFO L124 PetriNetUnfolderBase]: 150/2178 cut-off events. [2025-03-04 06:47:14,290 INFO L125 PetriNetUnfolderBase]: For 184/204 co-relation queries the response was YES. [2025-03-04 06:47:14,292 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-03-04 06:47:14,296 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 19 selfloop transitions, 21 changer transitions 0/556 dead transitions. [2025-03-04 06:47:14,296 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 506 places, 556 transitions, 1630 flow [2025-03-04 06:47:14,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:47:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:47:14,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 9934 transitions. [2025-03-04 06:47:14,304 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.96935987509758 [2025-03-04 06:47:14,304 INFO L175 Difference]: Start difference. First operand has 486 places, 538 transitions, 1462 flow. Second operand 21 states and 9934 transitions. [2025-03-04 06:47:14,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 506 places, 556 transitions, 1630 flow [2025-03-04 06:47:14,308 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 506 places, 556 transitions, 1630 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:14,311 INFO L231 Difference]: Finished difference. Result has 511 places, 551 transitions, 1592 flow [2025-03-04 06:47:14,312 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-03-04 06:47:14,312 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 24 predicate places. [2025-03-04 06:47:14,312 INFO L471 AbstractCegarLoop]: Abstraction has has 511 places, 551 transitions, 1592 flow [2025-03-04 06:47:14,314 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-03-04 06:47:14,314 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:14,315 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-03-04 06:47:14,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 06:47:14,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-04 06:47:14,515 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-03-04 06:47:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1236607570, now seen corresponding path program 2 times [2025-03-04 06:47:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032146917] [2025-03-04 06:47:14,517 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:14,622 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 936 statements into 2 equivalence classes. [2025-03-04 06:47:14,631 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 194 of 936 statements. [2025-03-04 06:47:14,631 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:14,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2233 trivial. 0 not checked. [2025-03-04 06:47:14,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:14,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032146917] [2025-03-04 06:47:14,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032146917] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:14,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:14,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125164683] [2025-03-04 06:47:14,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:14,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:14,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:14,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:15,499 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-03-04 06:47:15,501 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-03-04 06:47:15,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:15,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-03-04 06:47:15,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:15,910 INFO L124 PetriNetUnfolderBase]: 212/2342 cut-off events. [2025-03-04 06:47:15,910 INFO L125 PetriNetUnfolderBase]: For 454/488 co-relation queries the response was YES. [2025-03-04 06:47:15,913 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-03-04 06:47:15,917 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 150 selfloop transitions, 5 changer transitions 0/550 dead transitions. [2025-03-04 06:47:15,917 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 515 places, 550 transitions, 1900 flow [2025-03-04 06:47:15,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:15,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:15,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2455 transitions. [2025-03-04 06:47:15,920 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8384562841530054 [2025-03-04 06:47:15,920 INFO L175 Difference]: Start difference. First operand has 511 places, 551 transitions, 1592 flow. Second operand 6 states and 2455 transitions. [2025-03-04 06:47:15,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 515 places, 550 transitions, 1900 flow [2025-03-04 06:47:15,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 509 places, 550 transitions, 1876 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:15,927 INFO L231 Difference]: Finished difference. Result has 509 places, 550 transitions, 1576 flow [2025-03-04 06:47:15,928 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-03-04 06:47:15,928 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 22 predicate places. [2025-03-04 06:47:15,928 INFO L471 AbstractCegarLoop]: Abstraction has has 509 places, 550 transitions, 1576 flow [2025-03-04 06:47:15,929 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-03-04 06:47:15,929 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:15,930 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-03-04 06:47:15,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:15,930 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-03-04 06:47:15,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:15,931 INFO L85 PathProgramCache]: Analyzing trace with hash -1794064447, now seen corresponding path program 1 times [2025-03-04 06:47:15,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:15,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104625603] [2025-03-04 06:47:15,932 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:15,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:16,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-04 06:47:16,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-04 06:47:16,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:17,416 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:17,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104625603] [2025-03-04 06:47:17,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104625603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:17,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622823822] [2025-03-04 06:47:17,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:17,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:17,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:17,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:17,420 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:47:17,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 987 statements into 1 equivalence classes. [2025-03-04 06:47:18,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 987 of 987 statements. [2025-03-04 06:47:18,068 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:18,068 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:18,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 3788 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:18,101 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:18,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:18,648 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:19,243 INFO L134 CoverageAnalysis]: Checked inductivity of 2233 backedges. 0 proven. 2233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:19,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622823822] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:19,243 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:19,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:47:19,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609789904] [2025-03-04 06:47:19,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:19,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:47:19,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:19,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:47:19,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:47:19,428 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 471 out of 488 [2025-03-04 06:47:19,432 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-03-04 06:47:19,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:19,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 471 of 488 [2025-03-04 06:47:19,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:20,057 INFO L124 PetriNetUnfolderBase]: 150/2495 cut-off events. [2025-03-04 06:47:20,057 INFO L125 PetriNetUnfolderBase]: For 301/321 co-relation queries the response was YES. [2025-03-04 06:47:20,062 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-03-04 06:47:20,067 INFO L140 encePairwiseOnDemand]: 482/488 looper letters, 22 selfloop transitions, 30 changer transitions 0/567 dead transitions. [2025-03-04 06:47:20,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 538 places, 567 transitions, 1802 flow [2025-03-04 06:47:20,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:47:20,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:47:20,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 14184 transitions. [2025-03-04 06:47:20,077 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9688524590163935 [2025-03-04 06:47:20,077 INFO L175 Difference]: Start difference. First operand has 509 places, 550 transitions, 1576 flow. Second operand 30 states and 14184 transitions. [2025-03-04 06:47:20,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 538 places, 567 transitions, 1802 flow [2025-03-04 06:47:20,081 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 533 places, 567 transitions, 1792 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:20,085 INFO L231 Difference]: Finished difference. Result has 537 places, 560 transitions, 1718 flow [2025-03-04 06:47:20,085 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-03-04 06:47:20,086 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 50 predicate places. [2025-03-04 06:47:20,086 INFO L471 AbstractCegarLoop]: Abstraction has has 537 places, 560 transitions, 1718 flow [2025-03-04 06:47:20,088 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-03-04 06:47:20,088 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:20,088 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-03-04 06:47:20,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:20,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:20,289 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-03-04 06:47:20,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:20,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1647373346, now seen corresponding path program 2 times [2025-03-04 06:47:20,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:20,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227399505] [2025-03-04 06:47:20,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:20,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:20,461 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1305 statements into 2 equivalence classes. [2025-03-04 06:47:20,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 245 of 1305 statements. [2025-03-04 06:47:20,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:20,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 4780 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4780 trivial. 0 not checked. [2025-03-04 06:47:20,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:20,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227399505] [2025-03-04 06:47:20,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227399505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:20,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:20,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:20,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122400774] [2025-03-04 06:47:20,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:20,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:20,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:20,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:21,267 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 394 out of 488 [2025-03-04 06:47:21,269 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-03-04 06:47:21,269 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:21,269 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 394 of 488 [2025-03-04 06:47:21,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:22,329 INFO L124 PetriNetUnfolderBase]: 530/3564 cut-off events. [2025-03-04 06:47:22,330 INFO L125 PetriNetUnfolderBase]: For 951/1034 co-relation queries the response was YES. [2025-03-04 06:47:22,335 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-03-04 06:47:22,342 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 163 selfloop transitions, 130 changer transitions 0/697 dead transitions. [2025-03-04 06:47:22,342 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 542 places, 697 transitions, 2954 flow [2025-03-04 06:47:22,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:22,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:22,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2533 transitions. [2025-03-04 06:47:22,344 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8650956284153005 [2025-03-04 06:47:22,344 INFO L175 Difference]: Start difference. First operand has 537 places, 560 transitions, 1718 flow. Second operand 6 states and 2533 transitions. [2025-03-04 06:47:22,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 542 places, 697 transitions, 2954 flow [2025-03-04 06:47:22,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 524 places, 697 transitions, 2908 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:47:22,359 INFO L231 Difference]: Finished difference. Result has 529 places, 689 transitions, 2900 flow [2025-03-04 06:47:22,359 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-03-04 06:47:22,360 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 42 predicate places. [2025-03-04 06:47:22,360 INFO L471 AbstractCegarLoop]: Abstraction has has 529 places, 689 transitions, 2900 flow [2025-03-04 06:47:22,361 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-03-04 06:47:22,361 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:22,362 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-03-04 06:47:22,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 06:47:22,362 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-03-04 06:47:22,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:22,364 INFO L85 PathProgramCache]: Analyzing trace with hash 860894093, now seen corresponding path program 1 times [2025-03-04 06:47:22,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:22,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421951750] [2025-03-04 06:47:22,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:22,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:22,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1315 statements into 1 equivalence classes. [2025-03-04 06:47:22,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1315 of 1315 statements. [2025-03-04 06:47:22,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:22,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-03-04 06:47:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421951750] [2025-03-04 06:47:25,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421951750] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:25,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:25,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:25,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308700949] [2025-03-04 06:47:25,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:25,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:25,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:25,716 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:25,716 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:26,222 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 392 out of 488 [2025-03-04 06:47:26,224 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-03-04 06:47:26,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:26,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 392 of 488 [2025-03-04 06:47:26,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:27,566 INFO L124 PetriNetUnfolderBase]: 806/4335 cut-off events. [2025-03-04 06:47:27,567 INFO L125 PetriNetUnfolderBase]: For 3369/3576 co-relation queries the response was YES. [2025-03-04 06:47:27,576 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-03-04 06:47:27,586 INFO L140 encePairwiseOnDemand]: 465/488 looper letters, 285 selfloop transitions, 131 changer transitions 5/827 dead transitions. [2025-03-04 06:47:27,586 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 534 places, 827 transitions, 4642 flow [2025-03-04 06:47:27,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:27,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:27,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2524 transitions. [2025-03-04 06:47:27,588 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8620218579234973 [2025-03-04 06:47:27,588 INFO L175 Difference]: Start difference. First operand has 529 places, 689 transitions, 2900 flow. Second operand 6 states and 2524 transitions. [2025-03-04 06:47:27,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 534 places, 827 transitions, 4642 flow [2025-03-04 06:47:27,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 534 places, 827 transitions, 4642 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:27,607 INFO L231 Difference]: Finished difference. Result has 539 places, 817 transitions, 4380 flow [2025-03-04 06:47:27,608 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-03-04 06:47:27,608 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 52 predicate places. [2025-03-04 06:47:27,608 INFO L471 AbstractCegarLoop]: Abstraction has has 539 places, 817 transitions, 4380 flow [2025-03-04 06:47:27,609 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-03-04 06:47:27,609 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:27,610 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-03-04 06:47:27,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 06:47:27,610 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-03-04 06:47:27,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:27,613 INFO L85 PathProgramCache]: Analyzing trace with hash -919070086, now seen corresponding path program 1 times [2025-03-04 06:47:27,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:27,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110653126] [2025-03-04 06:47:27,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:27,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:27,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1316 statements into 1 equivalence classes. [2025-03-04 06:47:27,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1316 of 1316 statements. [2025-03-04 06:47:27,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:27,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:30,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4790 trivial. 0 not checked. [2025-03-04 06:47:30,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:30,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110653126] [2025-03-04 06:47:30,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110653126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:30,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:30,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:30,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121800167] [2025-03-04 06:47:30,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:30,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:30,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:30,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:30,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:31,411 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 357 out of 488 [2025-03-04 06:47:31,412 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-03-04 06:47:31,412 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:31,412 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 357 of 488 [2025-03-04 06:47:31,412 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:33,152 INFO L124 PetriNetUnfolderBase]: 1308/5703 cut-off events. [2025-03-04 06:47:33,152 INFO L125 PetriNetUnfolderBase]: For 4874/4931 co-relation queries the response was YES. [2025-03-04 06:47:33,165 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-03-04 06:47:33,178 INFO L140 encePairwiseOnDemand]: 469/488 looper letters, 364 selfloop transitions, 84 changer transitions 0/896 dead transitions. [2025-03-04 06:47:33,178 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 543 places, 896 transitions, 5674 flow [2025-03-04 06:47:33,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:33,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:33,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 2332 transitions. [2025-03-04 06:47:33,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.796448087431694 [2025-03-04 06:47:33,181 INFO L175 Difference]: Start difference. First operand has 539 places, 817 transitions, 4380 flow. Second operand 6 states and 2332 transitions. [2025-03-04 06:47:33,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 543 places, 896 transitions, 5674 flow [2025-03-04 06:47:33,196 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 543 places, 896 transitions, 5420 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:33,203 INFO L231 Difference]: Finished difference. Result has 548 places, 888 transitions, 4916 flow [2025-03-04 06:47:33,204 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-03-04 06:47:33,205 INFO L279 CegarLoopForPetriNet]: 487 programPoint places, 61 predicate places. [2025-03-04 06:47:33,205 INFO L471 AbstractCegarLoop]: Abstraction has has 548 places, 888 transitions, 4916 flow [2025-03-04 06:47:33,205 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-03-04 06:47:33,205 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:33,206 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-03-04 06:47:33,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 06:47:33,206 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-03-04 06:47:33,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:33,209 INFO L85 PathProgramCache]: Analyzing trace with hash 585557596, now seen corresponding path program 1 times [2025-03-04 06:47:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:33,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086519948] [2025-03-04 06:47:33,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:33,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:33,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-03-04 06:47:36,131 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-03-04 06:47:36,131 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:36,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 57 proven. 1137 refuted. 0 times theorem prover too weak. 3596 trivial. 0 not checked. [2025-03-04 06:47:53,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086519948] [2025-03-04 06:47:53,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086519948] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:53,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437424844] [2025-03-04 06:47:53,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:53,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:53,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:53,143 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:53,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:47:53,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1322 statements into 1 equivalence classes. [2025-03-04 06:47:54,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1322 of 1322 statements. [2025-03-04 06:47:54,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:54,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:54,550 INFO L256 TraceCheckSpWp]: Trace formula consists of 5102 conjuncts, 120 conjuncts are in the unsatisfiable core [2025-03-04 06:47:54,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:54,698 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-04 06:47:54,699 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-03-04 06:47:54,833 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-04 06:47:54,833 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-03-04 06:47:55,505 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-04 06:47:55,506 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-03-04 06:47:55,877 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-03-04 06:47:56,087 INFO L349 Elim1Store]: treesize reduction 72, result has 35.7 percent of original size [2025-03-04 06:47:56,088 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-03-04 06:47:56,234 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-03-04 06:47:56,402 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-03-04 06:47:56,711 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-03-04 06:47:57,814 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-04 06:47:57,814 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-03-04 06:47:58,648 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:47:58,648 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-03-04 06:47:59,893 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:47:59,893 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-03-04 06:48:00,632 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:00,633 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-03-04 06:48:01,884 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:01,884 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-03-04 06:48:02,543 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:02,543 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-03-04 06:48:03,816 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:03,816 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-03-04 06:48:04,440 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:04,441 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-03-04 06:48:05,644 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:05,644 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-03-04 06:48:06,309 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:06,310 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-03-04 06:48:07,650 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:07,650 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-03-04 06:48:08,265 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-04 06:48:08,265 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-03-04 06:48:09,512 INFO L349 Elim1Store]: treesize reduction 80, result has 31.6 percent of original size [2025-03-04 06:48:09,513 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-03-04 06:48:10,129 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-04 06:48:10,130 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-03-04 06:48:11,389 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-04 06:48:11,389 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-03-04 06:48:12,062 INFO L349 Elim1Store]: treesize reduction 56, result has 27.3 percent of original size [2025-03-04 06:48:12,062 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-03-04 06:48:13,734 INFO L349 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2025-03-04 06:48:13,735 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-03-04 06:48:15,654 INFO L349 Elim1Store]: treesize reduction 100, result has 31.5 percent of original size [2025-03-04 06:48:15,654 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-03-04 06:48:17,944 INFO L349 Elim1Store]: treesize reduction 20, result has 51.2 percent of original size [2025-03-04 06:48:17,944 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-03-04 06:48:18,010 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-03-04 06:48:18,036 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-03-04 06:48:18,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:48:18,068 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-03-04 06:48:18,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 06:48:18,102 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-03-04 06:48:18,142 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-03-04 06:48:18,182 INFO L134 CoverageAnalysis]: Checked inductivity of 4790 backedges. 1021 proven. 552 refuted. 0 times theorem prover too weak. 3217 trivial. 0 not checked. [2025-03-04 06:48:18,182 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:48:20,031 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