./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version f8ab0bd5 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_10-arraylist_rc.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 406569de44adfe8c1be02a1261bb34c87b6e96e16ab8124ccb5c3636d70e4f02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-f8ab0bd-m [2025-03-13 22:17:01,423 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-13 22:17:01,472 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-13 22:17:01,476 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-13 22:17:01,476 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-13 22:17:01,491 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-13 22:17:01,492 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-13 22:17:01,492 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-13 22:17:01,493 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-13 22:17:01,493 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-13 22:17:01,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-13 22:17:01,494 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-13 22:17:01,494 INFO L153 SettingsManager]: * Use SBE=true [2025-03-13 22:17:01,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-13 22:17:01,494 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-13 22:17:01,494 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-13 22:17:01,494 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-13 22:17:01,495 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-13 22:17:01,496 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:01,496 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-13 22:17:01,496 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-13 22:17:01,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-13 22:17:01,497 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-13 22:17:01,497 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-13 22:17:01,497 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-13 22:17:01,497 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-13 22:17:01,497 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 -> 406569de44adfe8c1be02a1261bb34c87b6e96e16ab8124ccb5c3636d70e4f02 [2025-03-13 22:17:01,728 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-13 22:17:01,733 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-13 22:17:01,736 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-13 22:17:01,737 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-13 22:17:01,737 INFO L274 PluginConnector]: CDTParser initialized [2025-03-13 22:17:01,739 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i [2025-03-13 22:17:02,916 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3de3791/4326399209d74522a50b88caae9e7232/FLAG04aad7f34 [2025-03-13 22:17:03,198 INFO L384 CDTParser]: Found 1 translation units. [2025-03-13 22:17:03,199 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_10-arraylist_rc.i [2025-03-13 22:17:03,217 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3de3791/4326399209d74522a50b88caae9e7232/FLAG04aad7f34 [2025-03-13 22:17:03,231 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/db3de3791/4326399209d74522a50b88caae9e7232 [2025-03-13 22:17:03,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-13 22:17:03,234 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-13 22:17:03,236 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:03,236 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-13 22:17:03,240 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-13 22:17:03,241 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,242 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72690f0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03, skipping insertion in model container [2025-03-13 22:17:03,243 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-13 22:17:03,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:03,675 INFO L200 MainTranslator]: Completed pre-run [2025-03-13 22:17:03,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-13 22:17:03,795 INFO L204 MainTranslator]: Completed translation [2025-03-13 22:17:03,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03 WrapperNode [2025-03-13 22:17:03,796 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-13 22:17:03,797 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:03,797 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-13 22:17:03,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-13 22:17:03,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,824 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,852 INFO L138 Inliner]: procedures = 372, calls = 88, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 294 [2025-03-13 22:17:03,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-13 22:17:03,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-13 22:17:03,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-13 22:17:03,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-13 22:17:03,857 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,858 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,864 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,864 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,876 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,880 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,881 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,883 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-13 22:17:03,884 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-13 22:17:03,884 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-13 22:17:03,884 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-13 22:17:03,885 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (1/1) ... [2025-03-13 22:17:03,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-13 22:17:03,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:03,917 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-13 22:17:03,919 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-13 22:17:03,935 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-13 22:17:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-13 22:17:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-13 22:17:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-13 22:17:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-13 22:17:03,936 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-13 22:17:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-13 22:17:03,937 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-13 22:17:03,937 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-13 22:17:03,938 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-13 22:17:04,043 INFO L256 CfgBuilder]: Building ICFG [2025-03-13 22:17:04,044 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-13 22:17:04,546 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-13 22:17:04,547 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-13 22:17:04,547 INFO L318 CfgBuilder]: Performing block encoding [2025-03-13 22:17:04,570 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-13 22:17:04,571 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:04 BoogieIcfgContainer [2025-03-13 22:17:04,571 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-13 22:17:04,572 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-13 22:17:04,573 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-13 22:17:04,576 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-13 22:17:04,576 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.03 10:17:03" (1/3) ... [2025-03-13 22:17:04,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c34539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:04, skipping insertion in model container [2025-03-13 22:17:04,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.03 10:17:03" (2/3) ... [2025-03-13 22:17:04,577 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22c34539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.03 10:17:04, skipping insertion in model container [2025-03-13 22:17:04,577 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.03 10:17:04" (3/3) ... [2025-03-13 22:17:04,578 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_10-arraylist_rc.i [2025-03-13 22:17:04,592 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-13 22:17:04,595 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_10-arraylist_rc.i that has 2 procedures, 336 locations, 1 initial locations, 2 loop locations, and 18 error locations. [2025-03-13 22:17:04,595 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-13 22:17:04,665 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-13 22:17:04,701 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 339 places, 339 transitions, 682 flow [2025-03-13 22:17:04,783 INFO L124 PetriNetUnfolderBase]: 4/338 cut-off events. [2025-03-13 22:17:04,785 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:04,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 342 conditions, 338 events. 4/338 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 416 event pairs, 0 based on Foata normal form. 0/316 useless extension candidates. Maximal degree in co-relation 210. Up to 2 conditions per place. [2025-03-13 22:17:04,789 INFO L82 GeneralOperation]: Start removeDead. Operand has 339 places, 339 transitions, 682 flow [2025-03-13 22:17:04,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 338 places, 338 transitions, 679 flow [2025-03-13 22:17:04,806 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-13 22:17:04,818 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;@143a5343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-13 22:17:04,818 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-13 22:17:04,845 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-13 22:17:04,845 INFO L124 PetriNetUnfolderBase]: 2/128 cut-off events. [2025-03-13 22:17:04,845 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-13 22:17:04,845 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:04,846 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:04,846 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:04,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:04,850 INFO L85 PathProgramCache]: Analyzing trace with hash 914903096, now seen corresponding path program 1 times [2025-03-13 22:17:04,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:04,855 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093510799] [2025-03-13 22:17:04,855 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:04,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:04,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-13 22:17:04,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-13 22:17:04,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:04,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:05,216 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-13 22:17:05,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093510799] [2025-03-13 22:17:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093510799] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:05,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716780084] [2025-03-13 22:17:05,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:05,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:05,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:05,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:05,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:05,260 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-03-13 22:17:05,264 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 338 transitions, 679 flow. Second operand has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:05,264 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:05,264 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-03-13 22:17:05,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:05,347 INFO L124 PetriNetUnfolderBase]: 8/416 cut-off events. [2025-03-13 22:17:05,348 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:05,349 INFO L83 FinitePrefix]: Finished finitePrefix Result has 445 conditions, 416 events. 8/416 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 887 event pairs, 6 based on Foata normal form. 5/390 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2025-03-13 22:17:05,351 INFO L140 encePairwiseOnDemand]: 334/339 looper letters, 10 selfloop transitions, 2 changer transitions 1/337 dead transitions. [2025-03-13 22:17:05,351 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 337 transitions, 701 flow [2025-03-13 22:17:05,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:05,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:05,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 993 transitions. [2025-03-13 22:17:05,363 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.976401179941003 [2025-03-13 22:17:05,364 INFO L175 Difference]: Start difference. First operand has 338 places, 338 transitions, 679 flow. Second operand 3 states and 993 transitions. [2025-03-13 22:17:05,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 337 transitions, 701 flow [2025-03-13 22:17:05,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 339 places, 337 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:05,374 INFO L231 Difference]: Finished difference. Result has 340 places, 336 transitions, 684 flow [2025-03-13 22:17:05,376 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=674, PETRI_DIFFERENCE_MINUEND_PLACES=337, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=684, PETRI_PLACES=340, PETRI_TRANSITIONS=336} [2025-03-13 22:17:05,380 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 2 predicate places. [2025-03-13 22:17:05,381 INFO L471 AbstractCegarLoop]: Abstraction has has 340 places, 336 transitions, 684 flow [2025-03-13 22:17:05,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 327.3333333333333) internal successors, (982), 3 states have internal predecessors, (982), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:05,381 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:05,382 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:05,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-13 22:17:05,382 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:05,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:05,383 INFO L85 PathProgramCache]: Analyzing trace with hash 645831783, now seen corresponding path program 1 times [2025-03-13 22:17:05,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:05,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365701357] [2025-03-13 22:17:05,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:05,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:17:05,425 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:17:05,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:05,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:05,600 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-13 22:17:05,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365701357] [2025-03-13 22:17:05,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365701357] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:05,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532237521] [2025-03-13 22:17:05,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:05,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:05,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:05,603 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-13 22:17:05,605 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-13 22:17:05,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-13 22:17:05,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-13 22:17:05,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:05,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:05,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:05,725 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:05,784 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-13 22:17:05,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:05,827 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-13 22:17:05,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532237521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:05,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:05,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:05,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730878142] [2025-03-13 22:17:05,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:05,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:05,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:05,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:05,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:05,863 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:05,867 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 340 places, 336 transitions, 684 flow. Second operand has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:05,867 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:05,867 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:05,868 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:06,020 INFO L124 PetriNetUnfolderBase]: 8/422 cut-off events. [2025-03-13 22:17:06,021 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-13 22:17:06,021 INFO L83 FinitePrefix]: Finished finitePrefix Result has 469 conditions, 422 events. 8/422 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 880 event pairs, 6 based on Foata normal form. 2/394 useless extension candidates. Maximal degree in co-relation 384. Up to 24 conditions per place. [2025-03-13 22:17:06,023 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/344 dead transitions. [2025-03-13 22:17:06,023 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 347 places, 344 transitions, 748 flow [2025-03-13 22:17:06,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:06,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-03-13 22:17:06,028 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-03-13 22:17:06,029 INFO L175 Difference]: Start difference. First operand has 340 places, 336 transitions, 684 flow. Second operand 9 states and 2932 transitions. [2025-03-13 22:17:06,031 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 347 places, 344 transitions, 748 flow [2025-03-13 22:17:06,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 344 transitions, 746 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:06,038 INFO L231 Difference]: Finished difference. Result has 349 places, 342 transitions, 732 flow [2025-03-13 22:17:06,039 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=682, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=336, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=732, PETRI_PLACES=349, PETRI_TRANSITIONS=342} [2025-03-13 22:17:06,039 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-03-13 22:17:06,040 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 342 transitions, 732 flow [2025-03-13 22:17:06,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 324.8) internal successors, (3248), 10 states have internal predecessors, (3248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:06,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:06,042 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:06,057 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-13 22:17:06,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:06,247 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:06,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash -263212281, now seen corresponding path program 2 times [2025-03-13 22:17:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784182628] [2025-03-13 22:17:06,248 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:06,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:06,261 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-13 22:17:06,278 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 99 of 114 statements. [2025-03-13 22:17:06,279 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:06,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:06,752 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:17:06,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:06,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784182628] [2025-03-13 22:17:06,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784182628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:06,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:06,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:06,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1585301602] [2025-03-13 22:17:06,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:06,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:06,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:06,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:06,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:07,155 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-03-13 22:17:07,156 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 342 transitions, 732 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:07,156 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:07,156 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-03-13 22:17:07,157 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:07,515 INFO L124 PetriNetUnfolderBase]: 366/1706 cut-off events. [2025-03-13 22:17:07,515 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2025-03-13 22:17:07,518 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2548 conditions, 1706 events. 366/1706 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10167 event pairs, 364 based on Foata normal form. 0/1580 useless extension candidates. Maximal degree in co-relation 2435. Up to 800 conditions per place. [2025-03-13 22:17:07,523 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/340 dead transitions. [2025-03-13 22:17:07,523 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 340 transitions, 890 flow [2025-03-13 22:17:07,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:07,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-03-13 22:17:07,526 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-03-13 22:17:07,526 INFO L175 Difference]: Start difference. First operand has 349 places, 342 transitions, 732 flow. Second operand 6 states and 1607 transitions. [2025-03-13 22:17:07,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 340 transitions, 890 flow [2025-03-13 22:17:07,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 351 places, 340 transitions, 884 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:07,531 INFO L231 Difference]: Finished difference. Result has 351 places, 340 transitions, 742 flow [2025-03-13 22:17:07,532 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=742, PETRI_PLACES=351, PETRI_TRANSITIONS=340} [2025-03-13 22:17:07,532 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 13 predicate places. [2025-03-13 22:17:07,532 INFO L471 AbstractCegarLoop]: Abstraction has has 351 places, 340 transitions, 742 flow [2025-03-13 22:17:07,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:07,533 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:07,533 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:07,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-13 22:17:07,534 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:07,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:07,534 INFO L85 PathProgramCache]: Analyzing trace with hash 937474965, now seen corresponding path program 1 times [2025-03-13 22:17:07,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:07,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407407208] [2025-03-13 22:17:07,534 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:07,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:07,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-13 22:17:07,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-13 22:17:07,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:07,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:07,592 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-13 22:17:07,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:07,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407407208] [2025-03-13 22:17:07,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407407208] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:07,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:07,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-13 22:17:07,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281695529] [2025-03-13 22:17:07,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:07,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-13 22:17:07,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:07,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-13 22:17:07,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-13 22:17:07,636 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 326 out of 339 [2025-03-13 22:17:07,637 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 340 transitions, 742 flow. Second operand has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:07,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:07,637 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 326 of 339 [2025-03-13 22:17:07,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:07,723 INFO L124 PetriNetUnfolderBase]: 8/531 cut-off events. [2025-03-13 22:17:07,723 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-03-13 22:17:07,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 606 conditions, 531 events. 8/531 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 871 event pairs, 6 based on Foata normal form. 1/498 useless extension candidates. Maximal degree in co-relation 494. Up to 24 conditions per place. [2025-03-13 22:17:07,725 INFO L140 encePairwiseOnDemand]: 336/339 looper letters, 10 selfloop transitions, 2 changer transitions 0/341 dead transitions. [2025-03-13 22:17:07,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 353 places, 341 transitions, 768 flow [2025-03-13 22:17:07,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-13 22:17:07,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-13 22:17:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 991 transitions. [2025-03-13 22:17:07,727 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9744346116027532 [2025-03-13 22:17:07,727 INFO L175 Difference]: Start difference. First operand has 351 places, 340 transitions, 742 flow. Second operand 3 states and 991 transitions. [2025-03-13 22:17:07,727 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 353 places, 341 transitions, 768 flow [2025-03-13 22:17:07,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 348 places, 341 transitions, 748 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:07,732 INFO L231 Difference]: Finished difference. Result has 349 places, 341 transitions, 734 flow [2025-03-13 22:17:07,732 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=722, PETRI_DIFFERENCE_MINUEND_PLACES=346, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=340, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=338, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=734, PETRI_PLACES=349, PETRI_TRANSITIONS=341} [2025-03-13 22:17:07,733 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 11 predicate places. [2025-03-13 22:17:07,733 INFO L471 AbstractCegarLoop]: Abstraction has has 349 places, 341 transitions, 734 flow [2025-03-13 22:17:07,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 328.0) internal successors, (984), 3 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:07,734 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:07,734 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:07,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-13 22:17:07,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:07,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:07,735 INFO L85 PathProgramCache]: Analyzing trace with hash 1434565419, now seen corresponding path program 1 times [2025-03-13 22:17:07,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:07,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637438522] [2025-03-13 22:17:07,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:07,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:07,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:17:07,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:17:07,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:07,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637438522] [2025-03-13 22:17:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637438522] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604392039] [2025-03-13 22:17:07,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:07,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:07,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:07,879 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-13 22:17:07,882 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-13 22:17:07,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-13 22:17:07,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-13 22:17:07,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:07,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:07,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:07,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:08,018 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:08,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:08,104 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:08,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604392039] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:08,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544655214] [2025-03-13 22:17:08,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:08,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:08,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:08,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:08,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:08,146 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:08,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 349 places, 341 transitions, 734 flow. Second operand has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:08,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:08,151 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:08,151 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:08,375 INFO L124 PetriNetUnfolderBase]: 8/551 cut-off events. [2025-03-13 22:17:08,376 INFO L125 PetriNetUnfolderBase]: For 24/24 co-relation queries the response was YES. [2025-03-13 22:17:08,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 663 conditions, 551 events. 8/551 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 871 event pairs, 6 based on Foata normal form. 4/521 useless extension candidates. Maximal degree in co-relation 476. Up to 24 conditions per place. [2025-03-13 22:17:08,377 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 18 selfloop transitions, 21 changer transitions 0/359 dead transitions. [2025-03-13 22:17:08,377 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 369 places, 359 transitions, 900 flow [2025-03-13 22:17:08,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:08,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:08,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-03-13 22:17:08,390 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-03-13 22:17:08,390 INFO L175 Difference]: Start difference. First operand has 349 places, 341 transitions, 734 flow. Second operand 21 states and 6826 transitions. [2025-03-13 22:17:08,391 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 369 places, 359 transitions, 900 flow [2025-03-13 22:17:08,393 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 359 transitions, 898 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:08,400 INFO L231 Difference]: Finished difference. Result has 373 places, 354 transitions, 862 flow [2025-03-13 22:17:08,400 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=732, PETRI_DIFFERENCE_MINUEND_PLACES=348, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=330, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=862, PETRI_PLACES=373, PETRI_TRANSITIONS=354} [2025-03-13 22:17:08,401 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 35 predicate places. [2025-03-13 22:17:08,401 INFO L471 AbstractCegarLoop]: Abstraction has has 373 places, 354 transitions, 862 flow [2025-03-13 22:17:08,403 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 324.8888888888889) internal successors, (5848), 18 states have internal predecessors, (5848), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:08,403 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:08,403 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:08,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:08,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:08,608 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:08,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:08,609 INFO L85 PathProgramCache]: Analyzing trace with hash 1641631851, now seen corresponding path program 2 times [2025-03-13 22:17:08,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:08,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419249459] [2025-03-13 22:17:08,609 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:08,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:08,624 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 142 statements into 2 equivalence classes. [2025-03-13 22:17:08,632 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 107 of 142 statements. [2025-03-13 22:17:08,632 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:08,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-13 22:17:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419249459] [2025-03-13 22:17:08,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419249459] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:08,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:08,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:08,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643291130] [2025-03-13 22:17:08,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:08,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:08,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:08,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:08,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:09,259 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 254 out of 339 [2025-03-13 22:17:09,260 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 373 places, 354 transitions, 862 flow. Second operand has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:09,260 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:09,261 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 254 of 339 [2025-03-13 22:17:09,261 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:09,569 INFO L124 PetriNetUnfolderBase]: 366/1833 cut-off events. [2025-03-13 22:17:09,570 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2025-03-13 22:17:09,574 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2783 conditions, 1833 events. 366/1833 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10063 event pairs, 364 based on Foata normal form. 0/1705 useless extension candidates. Maximal degree in co-relation 2590. Up to 830 conditions per place. [2025-03-13 22:17:09,579 INFO L140 encePairwiseOnDemand]: 327/339 looper letters, 71 selfloop transitions, 10 changer transitions 0/352 dead transitions. [2025-03-13 22:17:09,579 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 376 places, 352 transitions, 1020 flow [2025-03-13 22:17:09,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:09,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:09,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1607 transitions. [2025-03-13 22:17:09,583 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7900688298918387 [2025-03-13 22:17:09,583 INFO L175 Difference]: Start difference. First operand has 373 places, 354 transitions, 862 flow. Second operand 6 states and 1607 transitions. [2025-03-13 22:17:09,583 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 376 places, 352 transitions, 1020 flow [2025-03-13 22:17:09,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 370 places, 352 transitions, 996 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:09,588 INFO L231 Difference]: Finished difference. Result has 370 places, 352 transitions, 854 flow [2025-03-13 22:17:09,588 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=342, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=854, PETRI_PLACES=370, PETRI_TRANSITIONS=352} [2025-03-13 22:17:09,589 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 32 predicate places. [2025-03-13 22:17:09,589 INFO L471 AbstractCegarLoop]: Abstraction has has 370 places, 352 transitions, 854 flow [2025-03-13 22:17:09,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 255.33333333333334) internal successors, (1532), 6 states have internal predecessors, (1532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:09,590 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:09,590 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:09,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-13 22:17:09,590 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:09,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:09,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1509174260, now seen corresponding path program 1 times [2025-03-13 22:17:09,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:09,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647944153] [2025-03-13 22:17:09,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:09,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:09,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-13 22:17:09,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-13 22:17:09,614 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:09,614 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:09,888 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:09,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647944153] [2025-03-13 22:17:09,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647944153] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:09,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148780123] [2025-03-13 22:17:09,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:09,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:09,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:09,891 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-13 22:17:09,892 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-13 22:17:09,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-13 22:17:10,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-13 22:17:10,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:10,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:10,015 INFO L256 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:10,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:10,098 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:10,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:10,279 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-13 22:17:10,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148780123] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:10,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:10,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:10,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499262554] [2025-03-13 22:17:10,279 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:10,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:10,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:10,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:10,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:10,308 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:10,315 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 370 places, 352 transitions, 854 flow. Second operand has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:10,315 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:10,315 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:10,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:10,603 INFO L124 PetriNetUnfolderBase]: 8/562 cut-off events. [2025-03-13 22:17:10,604 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2025-03-13 22:17:10,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 768 conditions, 562 events. 8/562 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 857 event pairs, 6 based on Foata normal form. 3/535 useless extension candidates. Maximal degree in co-relation 498. Up to 24 conditions per place. [2025-03-13 22:17:10,606 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 21 selfloop transitions, 30 changer transitions 0/369 dead transitions. [2025-03-13 22:17:10,606 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 399 places, 369 transitions, 1078 flow [2025-03-13 22:17:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:10,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:10,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-03-13 22:17:10,618 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-03-13 22:17:10,618 INFO L175 Difference]: Start difference. First operand has 370 places, 352 transitions, 854 flow. Second operand 30 states and 9744 transitions. [2025-03-13 22:17:10,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 399 places, 369 transitions, 1078 flow [2025-03-13 22:17:10,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 394 places, 369 transitions, 1058 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:10,625 INFO L231 Difference]: Finished difference. Result has 398 places, 362 transitions, 986 flow [2025-03-13 22:17:10,625 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=834, PETRI_DIFFERENCE_MINUEND_PLACES=365, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=352, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=329, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=986, PETRI_PLACES=398, PETRI_TRANSITIONS=362} [2025-03-13 22:17:10,627 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 60 predicate places. [2025-03-13 22:17:10,627 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 362 transitions, 986 flow [2025-03-13 22:17:10,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0) internal successors, (7475), 23 states have internal predecessors, (7475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:10,629 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:10,629 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:10,639 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-13 22:17:10,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:10,830 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:10,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:10,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1292661691, now seen corresponding path program 2 times [2025-03-13 22:17:10,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:10,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461649503] [2025-03-13 22:17:10,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:10,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:10,843 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 169 statements into 2 equivalence classes. [2025-03-13 22:17:10,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 119 of 169 statements. [2025-03-13 22:17:10,849 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:10,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:11,120 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:11,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:11,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461649503] [2025-03-13 22:17:11,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461649503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:11,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:11,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:11,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234406971] [2025-03-13 22:17:11,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:11,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:11,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:11,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:11,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:11,645 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 249 out of 339 [2025-03-13 22:17:11,646 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 398 places, 362 transitions, 986 flow. Second operand has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:11,646 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:11,646 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 249 of 339 [2025-03-13 22:17:11,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:11,858 INFO L124 PetriNetUnfolderBase]: 392/1935 cut-off events. [2025-03-13 22:17:11,859 INFO L125 PetriNetUnfolderBase]: For 121/121 co-relation queries the response was YES. [2025-03-13 22:17:11,862 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3012 conditions, 1935 events. 392/1935 cut-off events. For 121/121 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 10924 event pairs, 390 based on Foata normal form. 0/1804 useless extension candidates. Maximal degree in co-relation 2740. Up to 899 conditions per place. [2025-03-13 22:17:11,866 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 83 selfloop transitions, 5 changer transitions 0/361 dead transitions. [2025-03-13 22:17:11,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 402 places, 361 transitions, 1160 flow [2025-03-13 22:17:11,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:11,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:11,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1582 transitions. [2025-03-13 22:17:11,869 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7777777777777778 [2025-03-13 22:17:11,869 INFO L175 Difference]: Start difference. First operand has 398 places, 362 transitions, 986 flow. Second operand 6 states and 1582 transitions. [2025-03-13 22:17:11,869 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 402 places, 361 transitions, 1160 flow [2025-03-13 22:17:11,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 384 places, 361 transitions, 1114 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:11,874 INFO L231 Difference]: Finished difference. Result has 384 places, 361 transitions, 948 flow [2025-03-13 22:17:11,874 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=938, PETRI_DIFFERENCE_MINUEND_PLACES=379, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=361, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=356, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=948, PETRI_PLACES=384, PETRI_TRANSITIONS=361} [2025-03-13 22:17:11,875 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 46 predicate places. [2025-03-13 22:17:11,875 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 361 transitions, 948 flow [2025-03-13 22:17:11,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 251.83333333333334) internal successors, (1511), 6 states have internal predecessors, (1511), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:11,876 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:11,876 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:11,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-13 22:17:11,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:11,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:11,877 INFO L85 PathProgramCache]: Analyzing trace with hash -763943389, now seen corresponding path program 1 times [2025-03-13 22:17:11,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:11,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806328916] [2025-03-13 22:17:11,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:11,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:11,893 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-13 22:17:11,903 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-13 22:17:11,903 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:11,903 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:12,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:12,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806328916] [2025-03-13 22:17:12,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806328916] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:12,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:12,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:12,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442758677] [2025-03-13 22:17:12,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:12,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:12,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:12,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:12,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:12,756 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 275 out of 339 [2025-03-13 22:17:12,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 361 transitions, 948 flow. Second operand has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:12,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:12,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 275 of 339 [2025-03-13 22:17:12,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:12,931 INFO L124 PetriNetUnfolderBase]: 56/801 cut-off events. [2025-03-13 22:17:12,931 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-13 22:17:12,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1162 conditions, 801 events. 56/801 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 2596 event pairs, 54 based on Foata normal form. 0/749 useless extension candidates. Maximal degree in co-relation 911. Up to 195 conditions per place. [2025-03-13 22:17:12,934 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 57 selfloop transitions, 5 changer transitions 0/360 dead transitions. [2025-03-13 22:17:12,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 360 transitions, 1070 flow [2025-03-13 22:17:12,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:12,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:12,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1712 transitions. [2025-03-13 22:17:12,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416912487708947 [2025-03-13 22:17:12,938 INFO L175 Difference]: Start difference. First operand has 384 places, 361 transitions, 948 flow. Second operand 6 states and 1712 transitions. [2025-03-13 22:17:12,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 360 transitions, 1070 flow [2025-03-13 22:17:12,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 360 transitions, 1060 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:12,948 INFO L231 Difference]: Finished difference. Result has 383 places, 360 transitions, 946 flow [2025-03-13 22:17:12,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=936, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=360, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=355, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=946, PETRI_PLACES=383, PETRI_TRANSITIONS=360} [2025-03-13 22:17:12,950 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 45 predicate places. [2025-03-13 22:17:12,950 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 360 transitions, 946 flow [2025-03-13 22:17:12,951 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 279.8333333333333) internal successors, (1679), 6 states have internal predecessors, (1679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:12,951 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:12,952 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:12,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-13 22:17:12,952 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:12,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:12,953 INFO L85 PathProgramCache]: Analyzing trace with hash 239713264, now seen corresponding path program 1 times [2025-03-13 22:17:12,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:12,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236777307] [2025-03-13 22:17:12,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:12,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:12,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-13 22:17:12,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-13 22:17:12,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:12,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:13,458 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2025-03-13 22:17:13,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:13,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236777307] [2025-03-13 22:17:13,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236777307] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:13,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:13,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:13,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619310226] [2025-03-13 22:17:13,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:13,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:13,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:13,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:13,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:13,852 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-03-13 22:17:13,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 360 transitions, 946 flow. Second operand has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:13,854 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:13,854 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-03-13 22:17:13,854 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:13,976 INFO L124 PetriNetUnfolderBase]: 38/716 cut-off events. [2025-03-13 22:17:13,976 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:13,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1040 conditions, 716 events. 38/716 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2074 event pairs, 36 based on Foata normal form. 0/677 useless extension candidates. Maximal degree in co-relation 791. Up to 158 conditions per place. [2025-03-13 22:17:13,978 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 53 selfloop transitions, 5 changer transitions 0/359 dead transitions. [2025-03-13 22:17:13,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 359 transitions, 1060 flow [2025-03-13 22:17:13,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:13,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1727 transitions. [2025-03-13 22:17:13,981 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8490658800393314 [2025-03-13 22:17:13,981 INFO L175 Difference]: Start difference. First operand has 383 places, 360 transitions, 946 flow. Second operand 6 states and 1727 transitions. [2025-03-13 22:17:13,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 359 transitions, 1060 flow [2025-03-13 22:17:13,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 382 places, 359 transitions, 1050 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:13,987 INFO L231 Difference]: Finished difference. Result has 382 places, 359 transitions, 944 flow [2025-03-13 22:17:13,988 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=934, PETRI_DIFFERENCE_MINUEND_PLACES=377, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=359, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=354, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=944, PETRI_PLACES=382, PETRI_TRANSITIONS=359} [2025-03-13 22:17:13,989 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 44 predicate places. [2025-03-13 22:17:13,989 INFO L471 AbstractCegarLoop]: Abstraction has has 382 places, 359 transitions, 944 flow [2025-03-13 22:17:13,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 282.5) internal successors, (1695), 6 states have internal predecessors, (1695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:13,989 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:13,990 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:13,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-13 22:17:13,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:13,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:13,991 INFO L85 PathProgramCache]: Analyzing trace with hash 215701357, now seen corresponding path program 1 times [2025-03-13 22:17:13,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:13,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055935051] [2025-03-13 22:17:13,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:13,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:14,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-03-13 22:17:14,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-03-13 22:17:14,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:14,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:14,426 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-13 22:17:14,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:14,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055935051] [2025-03-13 22:17:14,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055935051] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:14,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:14,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:14,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702047227] [2025-03-13 22:17:14,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:14,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:14,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:14,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:14,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:14,691 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 339 [2025-03-13 22:17:14,692 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 382 places, 359 transitions, 944 flow. Second operand has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:14,692 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:14,692 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 339 [2025-03-13 22:17:14,692 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:14,973 INFO L124 PetriNetUnfolderBase]: 366/1840 cut-off events. [2025-03-13 22:17:14,974 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:14,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2852 conditions, 1840 events. 366/1840 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10052 event pairs, 364 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2603. Up to 846 conditions per place. [2025-03-13 22:17:14,981 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 79 selfloop transitions, 5 changer transitions 0/358 dead transitions. [2025-03-13 22:17:14,981 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 386 places, 358 transitions, 1110 flow [2025-03-13 22:17:14,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:14,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:14,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1597 transitions. [2025-03-13 22:17:14,983 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7851524090462143 [2025-03-13 22:17:14,983 INFO L175 Difference]: Start difference. First operand has 382 places, 359 transitions, 944 flow. Second operand 6 states and 1597 transitions. [2025-03-13 22:17:14,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 386 places, 358 transitions, 1110 flow [2025-03-13 22:17:14,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 381 places, 358 transitions, 1100 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:14,988 INFO L231 Difference]: Finished difference. Result has 381 places, 358 transitions, 942 flow [2025-03-13 22:17:14,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=376, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=358, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=353, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=942, PETRI_PLACES=381, PETRI_TRANSITIONS=358} [2025-03-13 22:17:14,989 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 43 predicate places. [2025-03-13 22:17:14,989 INFO L471 AbstractCegarLoop]: Abstraction has has 381 places, 358 transitions, 942 flow [2025-03-13 22:17:14,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 258.1666666666667) internal successors, (1549), 6 states have internal predecessors, (1549), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:14,990 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:14,990 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:14,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-13 22:17:14,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:14,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:14,991 INFO L85 PathProgramCache]: Analyzing trace with hash -597701135, now seen corresponding path program 1 times [2025-03-13 22:17:14,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:14,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [213784218] [2025-03-13 22:17:14,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:14,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:15,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-13 22:17:15,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-13 22:17:15,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:15,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:15,395 INFO L134 CoverageAnalysis]: Checked inductivity of 236 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2025-03-13 22:17:15,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:15,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [213784218] [2025-03-13 22:17:15,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [213784218] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:15,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:15,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:15,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748727290] [2025-03-13 22:17:15,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:15,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:15,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:15,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:15,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:15,660 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 253 out of 339 [2025-03-13 22:17:15,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 381 places, 358 transitions, 942 flow. Second operand has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:15,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:15,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 253 of 339 [2025-03-13 22:17:15,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:16,046 INFO L124 PetriNetUnfolderBase]: 366/1838 cut-off events. [2025-03-13 22:17:16,047 INFO L125 PetriNetUnfolderBase]: For 127/127 co-relation queries the response was YES. [2025-03-13 22:17:16,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1838 events. 366/1838 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 10062 event pairs, 364 based on Foata normal form. 0/1720 useless extension candidates. Maximal degree in co-relation 2599. Up to 844 conditions per place. [2025-03-13 22:17:16,053 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 78 selfloop transitions, 5 changer transitions 0/357 dead transitions. [2025-03-13 22:17:16,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 385 places, 357 transitions, 1106 flow [2025-03-13 22:17:16,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:16,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:16,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1602 transitions. [2025-03-13 22:17:16,056 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7876106194690266 [2025-03-13 22:17:16,056 INFO L175 Difference]: Start difference. First operand has 381 places, 358 transitions, 942 flow. Second operand 6 states and 1602 transitions. [2025-03-13 22:17:16,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 385 places, 357 transitions, 1106 flow [2025-03-13 22:17:16,059 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 380 places, 357 transitions, 1096 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:16,061 INFO L231 Difference]: Finished difference. Result has 380 places, 357 transitions, 940 flow [2025-03-13 22:17:16,061 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=352, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=940, PETRI_PLACES=380, PETRI_TRANSITIONS=357} [2025-03-13 22:17:16,063 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 42 predicate places. [2025-03-13 22:17:16,063 INFO L471 AbstractCegarLoop]: Abstraction has has 380 places, 357 transitions, 940 flow [2025-03-13 22:17:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 259.6666666666667) internal successors, (1558), 6 states have internal predecessors, (1558), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:16,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:16,064 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:16,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-13 22:17:16,064 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:16,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:16,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1595220511, now seen corresponding path program 1 times [2025-03-13 22:17:16,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:16,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520266897] [2025-03-13 22:17:16,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:16,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:16,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-13 22:17:16,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-13 22:17:16,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:16,099 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-13 22:17:16,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:16,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520266897] [2025-03-13 22:17:16,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520266897] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:16,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1202890419] [2025-03-13 22:17:16,192 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:16,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:16,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:16,194 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-13 22:17:16,195 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-13 22:17:16,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 255 statements into 1 equivalence classes. [2025-03-13 22:17:16,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 255 of 255 statements. [2025-03-13 22:17:16,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:16,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:16,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 754 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-13 22:17:16,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:16,486 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-13 22:17:16,486 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-03-13 22:17:16,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1202890419] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:16,606 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:16,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-13 22:17:16,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485783528] [2025-03-13 22:17:16,606 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:16,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-13 22:17:16,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:16,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-13 22:17:16,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-13 22:17:16,696 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:16,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 380 places, 357 transitions, 940 flow. Second operand has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:16,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:16,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:16,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:16,813 INFO L124 PetriNetUnfolderBase]: 8/659 cut-off events. [2025-03-13 22:17:16,813 INFO L125 PetriNetUnfolderBase]: For 126/126 co-relation queries the response was YES. [2025-03-13 22:17:16,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 659 events. 8/659 cut-off events. For 126/126 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 390 event pairs, 6 based on Foata normal form. 2/641 useless extension candidates. Maximal degree in co-relation 607. Up to 24 conditions per place. [2025-03-13 22:17:16,815 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 14 selfloop transitions, 9 changer transitions 0/365 dead transitions. [2025-03-13 22:17:16,815 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 388 places, 365 transitions, 1004 flow [2025-03-13 22:17:16,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-13 22:17:16,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-13 22:17:16,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2932 transitions. [2025-03-13 22:17:16,816 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9609963946247132 [2025-03-13 22:17:16,816 INFO L175 Difference]: Start difference. First operand has 380 places, 357 transitions, 940 flow. Second operand 9 states and 2932 transitions. [2025-03-13 22:17:16,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 388 places, 365 transitions, 1004 flow [2025-03-13 22:17:16,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 365 transitions, 994 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-13 22:17:16,822 INFO L231 Difference]: Finished difference. Result has 386 places, 363 transitions, 980 flow [2025-03-13 22:17:16,822 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=375, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=357, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=351, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=980, PETRI_PLACES=386, PETRI_TRANSITIONS=363} [2025-03-13 22:17:16,823 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 48 predicate places. [2025-03-13 22:17:16,823 INFO L471 AbstractCegarLoop]: Abstraction has has 386 places, 363 transitions, 980 flow [2025-03-13 22:17:16,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 325.0) internal successors, (3250), 10 states have internal predecessors, (3250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:16,824 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:16,825 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:16,832 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:17,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:17,030 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:17,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:17,031 INFO L85 PathProgramCache]: Analyzing trace with hash -511377087, now seen corresponding path program 2 times [2025-03-13 22:17:17,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:17,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88899474] [2025-03-13 22:17:17,031 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:17,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:17,079 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 465 statements into 2 equivalence classes. [2025-03-13 22:17:17,084 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 100 of 465 statements. [2025-03-13 22:17:17,084 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:17,084 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:17,237 INFO L134 CoverageAnalysis]: Checked inductivity of 643 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 643 trivial. 0 not checked. [2025-03-13 22:17:17,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:17,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88899474] [2025-03-13 22:17:17,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88899474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:17,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:17,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:17,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281210841] [2025-03-13 22:17:17,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:17,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:17,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:17,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:17,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:17,625 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-03-13 22:17:17,626 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 386 places, 363 transitions, 980 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:17,626 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:17,626 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-03-13 22:17:17,626 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:17,965 INFO L124 PetriNetUnfolderBase]: 258/1966 cut-off events. [2025-03-13 22:17:17,965 INFO L125 PetriNetUnfolderBase]: For 130/130 co-relation queries the response was YES. [2025-03-13 22:17:17,969 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2769 conditions, 1966 events. 258/1966 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 10091 event pairs, 34 based on Foata normal form. 0/1840 useless extension candidates. Maximal degree in co-relation 2516. Up to 491 conditions per place. [2025-03-13 22:17:17,973 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 67 selfloop transitions, 70 changer transitions 0/441 dead transitions. [2025-03-13 22:17:17,973 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 391 places, 441 transitions, 1410 flow [2025-03-13 22:17:17,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:17,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-03-13 22:17:17,977 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-03-13 22:17:17,977 INFO L175 Difference]: Start difference. First operand has 386 places, 363 transitions, 980 flow. Second operand 6 states and 1806 transitions. [2025-03-13 22:17:17,977 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 391 places, 441 transitions, 1410 flow [2025-03-13 22:17:17,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 390 places, 441 transitions, 1404 flow, removed 2 selfloop flow, removed 1 redundant places. [2025-03-13 22:17:17,982 INFO L231 Difference]: Finished difference. Result has 395 places, 432 transitions, 1436 flow [2025-03-13 22:17:17,983 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=974, PETRI_DIFFERENCE_MINUEND_PLACES=385, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1436, PETRI_PLACES=395, PETRI_TRANSITIONS=432} [2025-03-13 22:17:17,983 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 57 predicate places. [2025-03-13 22:17:17,983 INFO L471 AbstractCegarLoop]: Abstraction has has 395 places, 432 transitions, 1436 flow [2025-03-13 22:17:17,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:17,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:17,984 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:17,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-13 22:17:17,984 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:17,985 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:17,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1106740087, now seen corresponding path program 1 times [2025-03-13 22:17:17,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:17,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104707788] [2025-03-13 22:17:17,986 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:17,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:18,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-13 22:17:18,058 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-13 22:17:18,058 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:18,058 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:18,372 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-13 22:17:18,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104707788] [2025-03-13 22:17:18,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104707788] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:18,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087394640] [2025-03-13 22:17:18,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:18,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:18,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:18,375 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:18,376 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-13 22:17:18,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 471 statements into 1 equivalence classes. [2025-03-13 22:17:18,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 471 of 471 statements. [2025-03-13 22:17:18,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:18,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:18,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-13 22:17:18,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:18,975 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-13 22:17:18,975 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:19,298 INFO L134 CoverageAnalysis]: Checked inductivity of 688 backedges. 0 proven. 408 refuted. 0 times theorem prover too weak. 280 trivial. 0 not checked. [2025-03-13 22:17:19,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087394640] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:19,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:19,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-13 22:17:19,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313285785] [2025-03-13 22:17:19,299 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:19,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-13 22:17:19,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:19,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-13 22:17:19,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-13 22:17:19,443 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:19,445 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 395 places, 432 transitions, 1436 flow. Second operand has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:19,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:19,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:19,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:19,938 INFO L124 PetriNetUnfolderBase]: 121/2052 cut-off events. [2025-03-13 22:17:19,938 INFO L125 PetriNetUnfolderBase]: For 309/329 co-relation queries the response was YES. [2025-03-13 22:17:19,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2854 conditions, 2052 events. 121/2052 cut-off events. For 309/329 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 7335 event pairs, 21 based on Foata normal form. 4/1969 useless extension candidates. Maximal degree in co-relation 2597. Up to 206 conditions per place. [2025-03-13 22:17:19,945 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 19 selfloop transitions, 21 changer transitions 0/450 dead transitions. [2025-03-13 22:17:19,945 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 415 places, 450 transitions, 1604 flow [2025-03-13 22:17:19,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-13 22:17:19,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-13 22:17:19,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6826 transitions. [2025-03-13 22:17:19,948 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.958842534063773 [2025-03-13 22:17:19,948 INFO L175 Difference]: Start difference. First operand has 395 places, 432 transitions, 1436 flow. Second operand 21 states and 6826 transitions. [2025-03-13 22:17:19,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 415 places, 450 transitions, 1604 flow [2025-03-13 22:17:19,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 415 places, 450 transitions, 1604 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:19,955 INFO L231 Difference]: Finished difference. Result has 420 places, 445 transitions, 1566 flow [2025-03-13 22:17:19,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1436, PETRI_DIFFERENCE_MINUEND_PLACES=395, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=432, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=421, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1566, PETRI_PLACES=420, PETRI_TRANSITIONS=445} [2025-03-13 22:17:19,955 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 82 predicate places. [2025-03-13 22:17:19,955 INFO L471 AbstractCegarLoop]: Abstraction has has 420 places, 445 transitions, 1566 flow [2025-03-13 22:17:19,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 325.0) internal successors, (5850), 18 states have internal predecessors, (5850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:19,956 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:19,957 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:19,965 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-13 22:17:20,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-13 22:17:20,157 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:20,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:20,159 INFO L85 PathProgramCache]: Analyzing trace with hash 208366409, now seen corresponding path program 2 times [2025-03-13 22:17:20,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:20,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209334297] [2025-03-13 22:17:20,159 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:20,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:20,248 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 891 statements into 2 equivalence classes. [2025-03-13 22:17:20,251 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 106 of 891 statements. [2025-03-13 22:17:20,252 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:20,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:20,389 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3182 trivial. 0 not checked. [2025-03-13 22:17:20,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:20,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209334297] [2025-03-13 22:17:20,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209334297] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:20,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:20,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:20,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094261953] [2025-03-13 22:17:20,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:20,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:20,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:20,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:20,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:20,729 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-03-13 22:17:20,730 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 420 places, 445 transitions, 1566 flow. Second operand has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:20,730 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:20,730 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-03-13 22:17:20,730 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:21,589 INFO L124 PetriNetUnfolderBase]: 501/3121 cut-off events. [2025-03-13 22:17:21,589 INFO L125 PetriNetUnfolderBase]: For 991/1074 co-relation queries the response was YES. [2025-03-13 22:17:21,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5522 conditions, 3121 events. 501/3121 cut-off events. For 991/1074 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 16096 event pairs, 92 based on Foata normal form. 16/2980 useless extension candidates. Maximal degree in co-relation 5260. Up to 981 conditions per place. [2025-03-13 22:17:21,600 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 131 selfloop transitions, 130 changer transitions 0/582 dead transitions. [2025-03-13 22:17:21,600 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 425 places, 582 transitions, 2738 flow [2025-03-13 22:17:21,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:21,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:21,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1805 transitions. [2025-03-13 22:17:21,602 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8874139626352016 [2025-03-13 22:17:21,602 INFO L175 Difference]: Start difference. First operand has 420 places, 445 transitions, 1566 flow. Second operand 6 states and 1805 transitions. [2025-03-13 22:17:21,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 425 places, 582 transitions, 2738 flow [2025-03-13 22:17:21,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 419 places, 582 transitions, 2714 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-13 22:17:21,611 INFO L231 Difference]: Finished difference. Result has 424 places, 574 transitions, 2770 flow [2025-03-13 22:17:21,611 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=1542, PETRI_DIFFERENCE_MINUEND_PLACES=414, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=445, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=408, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2770, PETRI_PLACES=424, PETRI_TRANSITIONS=574} [2025-03-13 22:17:21,612 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 86 predicate places. [2025-03-13 22:17:21,612 INFO L471 AbstractCegarLoop]: Abstraction has has 424 places, 574 transitions, 2770 flow [2025-03-13 22:17:21,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.1666666666667) internal successors, (1705), 6 states have internal predecessors, (1705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:21,612 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:21,613 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:21,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-13 22:17:21,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:21,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:21,615 INFO L85 PathProgramCache]: Analyzing trace with hash 2016651925, now seen corresponding path program 1 times [2025-03-13 22:17:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:21,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1553677410] [2025-03-13 22:17:21,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:21,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-03-13 22:17:21,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-03-13 22:17:21,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:21,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:22,841 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-13 22:17:22,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1553677410] [2025-03-13 22:17:22,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1553677410] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:17:22,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915851808] [2025-03-13 22:17:22,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:22,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:17:22,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:17:22,843 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:17:22,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-13 22:17:23,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 901 statements into 1 equivalence classes. [2025-03-13 22:17:23,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 901 of 901 statements. [2025-03-13 22:17:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:23,430 INFO L256 TraceCheckSpWp]: Trace formula consists of 3341 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-13 22:17:23,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:17:24,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-13 22:17:24,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-13 22:17:24,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3182 backedges. 0 proven. 2842 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2025-03-13 22:17:24,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915851808] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-13 22:17:24,740 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-13 22:17:24,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-13 22:17:24,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67613661] [2025-03-13 22:17:24,740 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-13 22:17:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-13 22:17:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:24,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-13 22:17:24,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-13 22:17:24,912 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 323 out of 339 [2025-03-13 22:17:24,916 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 424 places, 574 transitions, 2770 flow. Second operand has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:24,916 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:24,916 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 323 of 339 [2025-03-13 22:17:24,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:25,912 INFO L124 PetriNetUnfolderBase]: 382/3132 cut-off events. [2025-03-13 22:17:25,912 INFO L125 PetriNetUnfolderBase]: For 1289/1327 co-relation queries the response was YES. [2025-03-13 22:17:25,919 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5427 conditions, 3132 events. 382/3132 cut-off events. For 1289/1327 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 13258 event pairs, 37 based on Foata normal form. 7/3031 useless extension candidates. Maximal degree in co-relation 5160. Up to 467 conditions per place. [2025-03-13 22:17:25,924 INFO L140 encePairwiseOnDemand]: 333/339 looper letters, 22 selfloop transitions, 30 changer transitions 0/591 dead transitions. [2025-03-13 22:17:25,924 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 591 transitions, 2996 flow [2025-03-13 22:17:25,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-13 22:17:25,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-13 22:17:25,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9744 transitions. [2025-03-13 22:17:25,928 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9581120943952802 [2025-03-13 22:17:25,928 INFO L175 Difference]: Start difference. First operand has 424 places, 574 transitions, 2770 flow. Second operand 30 states and 9744 transitions. [2025-03-13 22:17:25,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 591 transitions, 2996 flow [2025-03-13 22:17:25,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 591 transitions, 2996 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:25,939 INFO L231 Difference]: Finished difference. Result has 457 places, 584 transitions, 2922 flow [2025-03-13 22:17:25,940 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2770, PETRI_DIFFERENCE_MINUEND_PLACES=424, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=574, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=551, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=2922, PETRI_PLACES=457, PETRI_TRANSITIONS=584} [2025-03-13 22:17:25,940 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 119 predicate places. [2025-03-13 22:17:25,940 INFO L471 AbstractCegarLoop]: Abstraction has has 457 places, 584 transitions, 2922 flow [2025-03-13 22:17:25,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 325.0869565217391) internal successors, (7477), 23 states have internal predecessors, (7477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:25,941 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:25,942 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:25,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-13 22:17:26,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-13 22:17:26,142 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:26,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:26,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1301413208, now seen corresponding path program 2 times [2025-03-13 22:17:26,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:26,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611430096] [2025-03-13 22:17:26,145 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-13 22:17:26,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:26,266 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 1216 statements into 2 equivalence classes. [2025-03-13 22:17:26,272 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 116 of 1216 statements. [2025-03-13 22:17:26,272 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-13 22:17:26,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:26,437 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-13 22:17:26,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:26,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611430096] [2025-03-13 22:17:26,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611430096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:26,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:26,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:26,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381602285] [2025-03-13 22:17:26,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:26,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:26,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:26,438 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:26,438 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:26,731 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 278 out of 339 [2025-03-13 22:17:26,732 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 457 places, 584 transitions, 2922 flow. Second operand has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:26,732 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:26,732 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 278 of 339 [2025-03-13 22:17:26,732 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:27,938 INFO L124 PetriNetUnfolderBase]: 777/4207 cut-off events. [2025-03-13 22:17:27,938 INFO L125 PetriNetUnfolderBase]: For 3426/3601 co-relation queries the response was YES. [2025-03-13 22:17:27,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8874 conditions, 4207 events. 777/4207 cut-off events. For 3426/3601 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 22292 event pairs, 65 based on Foata normal form. 52/4094 useless extension candidates. Maximal degree in co-relation 8603. Up to 1323 conditions per place. [2025-03-13 22:17:27,956 INFO L140 encePairwiseOnDemand]: 316/339 looper letters, 251 selfloop transitions, 131 changer transitions 5/722 dead transitions. [2025-03-13 22:17:27,956 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 462 places, 722 transitions, 4596 flow [2025-03-13 22:17:27,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1806 transitions. [2025-03-13 22:17:27,957 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.887905604719764 [2025-03-13 22:17:27,957 INFO L175 Difference]: Start difference. First operand has 457 places, 584 transitions, 2922 flow. Second operand 6 states and 1806 transitions. [2025-03-13 22:17:27,957 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 462 places, 722 transitions, 4596 flow [2025-03-13 22:17:27,965 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 444 places, 722 transitions, 4550 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-13 22:17:27,971 INFO L231 Difference]: Finished difference. Result has 449 places, 712 transitions, 4356 flow [2025-03-13 22:17:27,971 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=2876, PETRI_DIFFERENCE_MINUEND_PLACES=439, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=584, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=546, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4356, PETRI_PLACES=449, PETRI_TRANSITIONS=712} [2025-03-13 22:17:27,971 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 111 predicate places. [2025-03-13 22:17:27,972 INFO L471 AbstractCegarLoop]: Abstraction has has 449 places, 712 transitions, 4356 flow [2025-03-13 22:17:27,972 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 284.3333333333333) internal successors, (1706), 6 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:27,972 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:27,972 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:27,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-13 22:17:27,972 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:27,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1064133320, now seen corresponding path program 1 times [2025-03-13 22:17:27,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325406086] [2025-03-13 22:17:27,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:28,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1217 statements into 1 equivalence classes. [2025-03-13 22:17:28,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1217 of 1217 statements. [2025-03-13 22:17:28,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:28,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:17:30,963 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6470 trivial. 0 not checked. [2025-03-13 22:17:30,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:17:30,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325406086] [2025-03-13 22:17:30,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325406086] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-13 22:17:30,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-13 22:17:30,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-13 22:17:30,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939120434] [2025-03-13 22:17:30,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-13 22:17:30,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-13 22:17:30,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-13 22:17:30,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-13 22:17:30,965 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-13 22:17:31,182 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 339 [2025-03-13 22:17:31,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 449 places, 712 transitions, 4356 flow. Second operand has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:31,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-13 22:17:31,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 339 [2025-03-13 22:17:31,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-13 22:17:33,132 INFO L124 PetriNetUnfolderBase]: 1309/5605 cut-off events. [2025-03-13 22:17:33,132 INFO L125 PetriNetUnfolderBase]: For 4997/5054 co-relation queries the response was YES. [2025-03-13 22:17:33,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13621 conditions, 5605 events. 1309/5605 cut-off events. For 4997/5054 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 33836 event pairs, 369 based on Foata normal form. 11/5371 useless extension candidates. Maximal degree in co-relation 13346. Up to 2549 conditions per place. [2025-03-13 22:17:33,160 INFO L140 encePairwiseOnDemand]: 320/339 looper letters, 316 selfloop transitions, 84 changer transitions 0/791 dead transitions. [2025-03-13 22:17:33,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 453 places, 791 transitions, 5554 flow [2025-03-13 22:17:33,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-13 22:17:33,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-13 22:17:33,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-03-13 22:17:33,162 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8279252704031466 [2025-03-13 22:17:33,162 INFO L175 Difference]: Start difference. First operand has 449 places, 712 transitions, 4356 flow. Second operand 6 states and 1684 transitions. [2025-03-13 22:17:33,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 453 places, 791 transitions, 5554 flow [2025-03-13 22:17:33,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 453 places, 791 transitions, 5300 flow, removed 127 selfloop flow, removed 0 redundant places. [2025-03-13 22:17:33,187 INFO L231 Difference]: Finished difference. Result has 458 places, 783 transitions, 4892 flow [2025-03-13 22:17:33,188 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=339, PETRI_DIFFERENCE_MINUEND_FLOW=4108, PETRI_DIFFERENCE_MINUEND_PLACES=448, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=712, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=664, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4892, PETRI_PLACES=458, PETRI_TRANSITIONS=783} [2025-03-13 22:17:33,188 INFO L279 CegarLoopForPetriNet]: 338 programPoint places, 120 predicate places. [2025-03-13 22:17:33,188 INFO L471 AbstractCegarLoop]: Abstraction has has 458 places, 783 transitions, 4892 flow [2025-03-13 22:17:33,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 264.6666666666667) internal successors, (1588), 6 states have internal predecessors, (1588), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-13 22:17:33,188 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-13 22:17:33,189 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-13 22:17:33,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-13 22:17:33,189 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-13 22:17:33,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-13 22:17:33,193 INFO L85 PathProgramCache]: Analyzing trace with hash 24383486, now seen corresponding path program 1 times [2025-03-13 22:17:33,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-13 22:17:33,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282011009] [2025-03-13 22:17:33,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:17:33,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-13 22:17:33,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-03-13 22:17:35,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-03-13 22:17:35,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:17:35,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:18,599 INFO L134 CoverageAnalysis]: Checked inductivity of 6470 backedges. 2207 proven. 3710 refuted. 0 times theorem prover too weak. 553 trivial. 0 not checked. [2025-03-13 22:18:18,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-13 22:18:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282011009] [2025-03-13 22:18:18,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282011009] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-13 22:18:18,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1279440240] [2025-03-13 22:18:18,599 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-13 22:18:18,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-13 22:18:18,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-13 22:18:18,601 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-13 22:18:18,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-13 22:18:19,121 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1223 statements into 1 equivalence classes. [2025-03-13 22:18:19,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1223 of 1223 statements. [2025-03-13 22:18:19,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-13 22:18:19,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-13 22:18:19,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 4610 conjuncts, 122 conjuncts are in the unsatisfiable core [2025-03-13 22:18:19,778 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-13 22:18:20,232 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:18:20,233 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-13 22:18:20,490 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-13 22:18:20,490 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-13 22:18:20,895 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-13 22:18:20,896 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-13 22:18:21,338 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-13 22:18:21,338 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-13 22:18:22,422 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-13 22:18:22,422 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 29 treesize of output 40 [2025-03-13 22:18:23,028 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-13 22:18:23,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-13 22:18:24,392 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-13 22:18:24,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-13 22:18:25,001 INFO L349 Elim1Store]: treesize reduction 42, result has 27.6 percent of original size [2025-03-13 22:18:25,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 30 [2025-03-13 22:18:26,119 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-13 22:18:26,119 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 29 treesize of output 40 [2025-03-13 22:18:26,674 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-13 22:18:26,674 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 29 treesize of output 40 [2025-03-13 22:18:27,652 INFO L349 Elim1Store]: treesize reduction 60, result has 31.8 percent of original size [2025-03-13 22:18:27,653 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 29 treesize of output 40