./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 735b3cc8 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_04-list2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-735b3cc-m [2025-03-14 01:35:54,981 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-14 01:35:55,029 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-14 01:35:55,033 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-14 01:35:55,033 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-14 01:35:55,053 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-14 01:35:55,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-14 01:35:55,054 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-14 01:35:55,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-14 01:35:55,054 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-14 01:35:55,054 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-14 01:35:55,054 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-14 01:35:55,054 INFO L153 SettingsManager]: * Use SBE=true [2025-03-14 01:35:55,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-14 01:35:55,055 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-14 01:35:55,056 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:55,056 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-14 01:35:55,056 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-14 01:35:55,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-14 01:35:55,057 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-14 01:35:55,057 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-14 01:35:55,057 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-14 01:35:55,057 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-14 01:35:55,057 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2025-03-14 01:35:55,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-14 01:35:55,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-14 01:35:55,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-14 01:35:55,307 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-14 01:35:55,307 INFO L274 PluginConnector]: CDTParser initialized [2025-03-14 01:35:55,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-14 01:35:56,483 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14765c47/61a137635f0f4d2598996502d8047387/FLAG9e3fdb763 [2025-03-14 01:35:56,771 INFO L384 CDTParser]: Found 1 translation units. [2025-03-14 01:35:56,773 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2025-03-14 01:35:56,791 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14765c47/61a137635f0f4d2598996502d8047387/FLAG9e3fdb763 [2025-03-14 01:35:57,037 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b14765c47/61a137635f0f4d2598996502d8047387 [2025-03-14 01:35:57,040 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-14 01:35:57,041 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-14 01:35:57,042 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:57,042 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-14 01:35:57,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-14 01:35:57,045 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,045 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73a3089c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57, skipping insertion in model container [2025-03-14 01:35:57,046 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,079 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-14 01:35:57,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:57,392 INFO L200 MainTranslator]: Completed pre-run [2025-03-14 01:35:57,441 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-14 01:35:57,495 INFO L204 MainTranslator]: Completed translation [2025-03-14 01:35:57,496 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57 WrapperNode [2025-03-14 01:35:57,496 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-14 01:35:57,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:57,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-14 01:35:57,497 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-14 01:35:57,500 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,541 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 199 [2025-03-14 01:35:57,541 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-14 01:35:57,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-14 01:35:57,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-14 01:35:57,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-14 01:35:57,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,549 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,553 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,553 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,571 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,573 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,576 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,579 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,582 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-14 01:35:57,582 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-14 01:35:57,582 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-14 01:35:57,582 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-14 01:35:57,583 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (1/1) ... [2025-03-14 01:35:57,588 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-14 01:35:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:35:57,614 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-14 01:35:57,618 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-14 01:35:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-14 01:35:57,636 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-14 01:35:57,637 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-14 01:35:57,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-14 01:35:57,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-14 01:35:57,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-14 01:35:57,639 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-14 01:35:57,753 INFO L256 CfgBuilder]: Building ICFG [2025-03-14 01:35:57,755 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-14 01:35:58,153 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-14 01:35:58,154 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-14 01:35:58,154 INFO L318 CfgBuilder]: Performing block encoding [2025-03-14 01:35:58,181 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-14 01:35:58,183 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:58 BoogieIcfgContainer [2025-03-14 01:35:58,183 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-14 01:35:58,185 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-14 01:35:58,185 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-14 01:35:58,188 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-14 01:35:58,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.03 01:35:57" (1/3) ... [2025-03-14 01:35:58,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4068daab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:58, skipping insertion in model container [2025-03-14 01:35:58,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.03 01:35:57" (2/3) ... [2025-03-14 01:35:58,189 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4068daab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.03 01:35:58, skipping insertion in model container [2025-03-14 01:35:58,189 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.03 01:35:58" (3/3) ... [2025-03-14 01:35:58,190 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2025-03-14 01:35:58,201 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-14 01:35:58,202 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_04-list2_nr.i that has 2 procedures, 304 locations, 1 initial locations, 0 loop locations, and 30 error locations. [2025-03-14 01:35:58,203 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-14 01:35:58,262 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-14 01:35:58,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 307 places, 303 transitions, 610 flow [2025-03-14 01:35:58,368 INFO L124 PetriNetUnfolderBase]: 0/302 cut-off events. [2025-03-14 01:35:58,371 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:58,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 306 conditions, 302 events. 0/302 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 194 event pairs, 0 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-14 01:35:58,375 INFO L82 GeneralOperation]: Start removeDead. Operand has 307 places, 303 transitions, 610 flow [2025-03-14 01:35:58,381 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 306 places, 302 transitions, 607 flow [2025-03-14 01:35:58,388 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-14 01:35:58,395 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;@72959bb7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-14 01:35:58,396 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2025-03-14 01:35:58,400 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-14 01:35:58,400 INFO L124 PetriNetUnfolderBase]: 0/35 cut-off events. [2025-03-14 01:35:58,400 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:35:58,401 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:35:58,401 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] [2025-03-14 01:35:58,401 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:35:58,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:35:58,405 INFO L85 PathProgramCache]: Analyzing trace with hash 641313957, now seen corresponding path program 1 times [2025-03-14 01:35:58,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:35:58,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095471613] [2025-03-14 01:35:58,410 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:35:58,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:35:58,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-14 01:35:58,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-14 01:35:58,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:35:58,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:35:59,077 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-14 01:35:59,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:35:59,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095471613] [2025-03-14 01:35:59,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095471613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:35:59,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:35:59,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:35:59,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187419056] [2025-03-14 01:35:59,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:35:59,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:35:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:35:59,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:35:59,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:35:59,699 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-03-14 01:35:59,703 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 302 transitions, 607 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-14 01:35:59,703 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:35:59,703 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-03-14 01:35:59,705 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:00,059 INFO L124 PetriNetUnfolderBase]: 560/2351 cut-off events. [2025-03-14 01:36:00,059 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:00,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3573 conditions, 2351 events. 560/2351 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14895 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3350. Up to 1198 conditions per place. [2025-03-14 01:36:00,072 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/298 dead transitions. [2025-03-14 01:36:00,072 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 298 transitions, 793 flow [2025-03-14 01:36:00,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:00,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-03-14 01:36:00,088 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-14 01:36:00,090 INFO L175 Difference]: Start difference. First operand has 306 places, 302 transitions, 607 flow. Second operand 6 states and 1313 transitions. [2025-03-14 01:36:00,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 298 transitions, 793 flow [2025-03-14 01:36:00,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 306 places, 298 transitions, 792 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:00,101 INFO L231 Difference]: Finished difference. Result has 306 places, 298 transitions, 638 flow [2025-03-14 01:36:00,103 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=598, PETRI_DIFFERENCE_MINUEND_PLACES=301, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=298, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=638, PETRI_PLACES=306, PETRI_TRANSITIONS=298} [2025-03-14 01:36:00,105 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 0 predicate places. [2025-03-14 01:36:00,107 INFO L471 AbstractCegarLoop]: Abstraction has has 306 places, 298 transitions, 638 flow [2025-03-14 01:36:00,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-14 01:36:00,108 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:00,108 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] [2025-03-14 01:36:00,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-14 01:36:00,108 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:00,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:00,109 INFO L85 PathProgramCache]: Analyzing trace with hash 332419785, now seen corresponding path program 1 times [2025-03-14 01:36:00,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:00,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132218774] [2025-03-14 01:36:00,109 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:00,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-14 01:36:00,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-14 01:36:00,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:00,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:00,397 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-14 01:36:00,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:00,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132218774] [2025-03-14 01:36:00,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132218774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:00,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:00,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:00,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209050447] [2025-03-14 01:36:00,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:00,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:00,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:00,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:00,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:00,857 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 303 [2025-03-14 01:36:00,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 306 places, 298 transitions, 638 flow. Second operand has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-14 01:36:00,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:00,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 303 [2025-03-14 01:36:00,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:01,207 INFO L124 PetriNetUnfolderBase]: 560/2347 cut-off events. [2025-03-14 01:36:01,207 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:01,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3589 conditions, 2347 events. 560/2347 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 14936 event pairs, 560 based on Foata normal form. 0/2140 useless extension candidates. Maximal degree in co-relation 3391. Up to 1198 conditions per place. [2025-03-14 01:36:01,215 INFO L140 encePairwiseOnDemand]: 279/303 looper letters, 77 selfloop transitions, 20 changer transitions 0/294 dead transitions. [2025-03-14 01:36:01,215 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 294 transitions, 824 flow [2025-03-14 01:36:01,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:01,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:01,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1313 transitions. [2025-03-14 01:36:01,222 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2025-03-14 01:36:01,222 INFO L175 Difference]: Start difference. First operand has 306 places, 298 transitions, 638 flow. Second operand 6 states and 1313 transitions. [2025-03-14 01:36:01,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 294 transitions, 824 flow [2025-03-14 01:36:01,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 302 places, 294 transitions, 784 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:01,233 INFO L231 Difference]: Finished difference. Result has 302 places, 294 transitions, 630 flow [2025-03-14 01:36:01,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=590, PETRI_DIFFERENCE_MINUEND_PLACES=297, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=630, PETRI_PLACES=302, PETRI_TRANSITIONS=294} [2025-03-14 01:36:01,240 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -4 predicate places. [2025-03-14 01:36:01,240 INFO L471 AbstractCegarLoop]: Abstraction has has 302 places, 294 transitions, 630 flow [2025-03-14 01:36:01,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 203.33333333333334) internal successors, (1220), 6 states have internal predecessors, (1220), 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-14 01:36:01,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:01,241 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] [2025-03-14 01:36:01,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-14 01:36:01,241 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:01,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1004942018, now seen corresponding path program 1 times [2025-03-14 01:36:01,242 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:01,242 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63871952] [2025-03-14 01:36:01,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:01,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-14 01:36:01,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-14 01:36:01,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:01,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:01,339 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-14 01:36:01,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:01,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63871952] [2025-03-14 01:36:01,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63871952] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:01,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:01,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:01,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089342428] [2025-03-14 01:36:01,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:01,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:01,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:01,341 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:01,341 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:01,365 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-03-14 01:36:01,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 302 places, 294 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-14 01:36:01,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:01,367 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-03-14 01:36:01,367 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:01,449 INFO L124 PetriNetUnfolderBase]: 30/743 cut-off events. [2025-03-14 01:36:01,449 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:01,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 847 conditions, 743 events. 30/743 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 2665 event pairs, 30 based on Foata normal form. 0/668 useless extension candidates. Maximal degree in co-relation 671. Up to 78 conditions per place. [2025-03-14 01:36:01,452 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/293 dead transitions. [2025-03-14 01:36:01,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 303 places, 293 transitions, 666 flow [2025-03-14 01:36:01,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:01,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-03-14 01:36:01,455 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-03-14 01:36:01,455 INFO L175 Difference]: Start difference. First operand has 302 places, 294 transitions, 630 flow. Second operand 3 states and 869 transitions. [2025-03-14 01:36:01,455 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 303 places, 293 transitions, 666 flow [2025-03-14 01:36:01,457 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 298 places, 293 transitions, 626 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:01,460 INFO L231 Difference]: Finished difference. Result has 298 places, 293 transitions, 592 flow [2025-03-14 01:36:01,460 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=588, PETRI_DIFFERENCE_MINUEND_PLACES=296, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=293, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=592, PETRI_PLACES=298, PETRI_TRANSITIONS=293} [2025-03-14 01:36:01,461 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -8 predicate places. [2025-03-14 01:36:01,461 INFO L471 AbstractCegarLoop]: Abstraction has has 298 places, 293 transitions, 592 flow [2025-03-14 01:36:01,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-14 01:36:01,462 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:01,462 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] [2025-03-14 01:36:01,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-14 01:36:01,462 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr18ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:01,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:01,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1550695425, now seen corresponding path program 1 times [2025-03-14 01:36:01,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:01,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885490746] [2025-03-14 01:36:01,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:01,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:01,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-14 01:36:01,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-14 01:36:01,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:01,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:01,501 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-14 01:36:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885490746] [2025-03-14 01:36:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885490746] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623034311] [2025-03-14 01:36:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:01,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:01,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:01,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:01,515 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-03-14 01:36:01,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 298 places, 293 transitions, 592 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-14 01:36:01,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:01,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-03-14 01:36:01,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:01,604 INFO L124 PetriNetUnfolderBase]: 36/775 cut-off events. [2025-03-14 01:36:01,604 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:01,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 775 events. 36/775 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 3011 event pairs, 36 based on Foata normal form. 0/706 useless extension candidates. Maximal degree in co-relation 813. Up to 89 conditions per place. [2025-03-14 01:36:01,607 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/289 dead transitions. [2025-03-14 01:36:01,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 289 transitions, 620 flow [2025-03-14 01:36:01,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:01,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:01,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-03-14 01:36:01,610 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-03-14 01:36:01,610 INFO L175 Difference]: Start difference. First operand has 298 places, 293 transitions, 592 flow. Second operand 3 states and 865 transitions. [2025-03-14 01:36:01,610 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 289 transitions, 620 flow [2025-03-14 01:36:01,612 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 294 places, 289 transitions, 616 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:01,615 INFO L231 Difference]: Finished difference. Result has 294 places, 289 transitions, 582 flow [2025-03-14 01:36:01,615 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=580, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=289, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=288, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=582, PETRI_PLACES=294, PETRI_TRANSITIONS=289} [2025-03-14 01:36:01,616 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -12 predicate places. [2025-03-14 01:36:01,616 INFO L471 AbstractCegarLoop]: Abstraction has has 294 places, 289 transitions, 582 flow [2025-03-14 01:36:01,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-14 01:36:01,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:01,617 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] [2025-03-14 01:36:01,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-14 01:36:01,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:01,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:01,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1910287666, now seen corresponding path program 1 times [2025-03-14 01:36:01,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:01,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588042956] [2025-03-14 01:36:01,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:01,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:01,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-14 01:36:01,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-14 01:36:01,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:01,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:01,990 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-14 01:36:01,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:01,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588042956] [2025-03-14 01:36:01,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588042956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:01,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:01,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:01,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239230613] [2025-03-14 01:36:01,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:01,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:01,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:01,992 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:01,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:02,314 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-03-14 01:36:02,316 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 294 places, 289 transitions, 582 flow. Second operand has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-14 01:36:02,316 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:02,316 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-03-14 01:36:02,316 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:02,634 INFO L124 PetriNetUnfolderBase]: 638/2544 cut-off events. [2025-03-14 01:36:02,635 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:02,638 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3924 conditions, 2544 events. 638/2544 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 16291 event pairs, 638 based on Foata normal form. 0/2342 useless extension candidates. Maximal degree in co-relation 3855. Up to 1370 conditions per place. [2025-03-14 01:36:02,645 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/288 dead transitions. [2025-03-14 01:36:02,645 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 288 transitions, 776 flow [2025-03-14 01:36:02,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-03-14 01:36:02,649 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-03-14 01:36:02,649 INFO L175 Difference]: Start difference. First operand has 294 places, 289 transitions, 582 flow. Second operand 6 states and 1323 transitions. [2025-03-14 01:36:02,649 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 288 transitions, 776 flow [2025-03-14 01:36:02,652 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 297 places, 288 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:02,656 INFO L231 Difference]: Finished difference. Result has 297 places, 288 transitions, 589 flow [2025-03-14 01:36:02,656 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=579, PETRI_DIFFERENCE_MINUEND_PLACES=292, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=288, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=283, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=589, PETRI_PLACES=297, PETRI_TRANSITIONS=288} [2025-03-14 01:36:02,658 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -9 predicate places. [2025-03-14 01:36:02,658 INFO L471 AbstractCegarLoop]: Abstraction has has 297 places, 288 transitions, 589 flow [2025-03-14 01:36:02,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 208.16666666666666) internal successors, (1249), 6 states have internal predecessors, (1249), 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-14 01:36:02,659 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:02,659 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] [2025-03-14 01:36:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-14 01:36:02,661 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:02,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:02,662 INFO L85 PathProgramCache]: Analyzing trace with hash 899781155, now seen corresponding path program 1 times [2025-03-14 01:36:02,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:02,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577734456] [2025-03-14 01:36:02,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:02,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:02,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-14 01:36:02,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-14 01:36:02,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:02,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:02,736 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-14 01:36:02,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:02,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577734456] [2025-03-14 01:36:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577734456] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:02,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:02,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736903336] [2025-03-14 01:36:02,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:02,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:02,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:02,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:02,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:02,757 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 283 out of 303 [2025-03-14 01:36:02,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 297 places, 288 transitions, 589 flow. Second operand has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-14 01:36:02,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:02,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 283 of 303 [2025-03-14 01:36:02,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:02,832 INFO L124 PetriNetUnfolderBase]: 30/731 cut-off events. [2025-03-14 01:36:02,832 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:02,833 INFO L83 FinitePrefix]: Finished finitePrefix Result has 821 conditions, 731 events. 30/731 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 2737 event pairs, 30 based on Foata normal form. 0/670 useless extension candidates. Maximal degree in co-relation 762. Up to 78 conditions per place. [2025-03-14 01:36:02,834 INFO L140 encePairwiseOnDemand]: 300/303 looper letters, 17 selfloop transitions, 2 changer transitions 0/287 dead transitions. [2025-03-14 01:36:02,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 298 places, 287 transitions, 625 flow [2025-03-14 01:36:02,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:02,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:02,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 869 transitions. [2025-03-14 01:36:02,836 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9559955995599559 [2025-03-14 01:36:02,836 INFO L175 Difference]: Start difference. First operand has 297 places, 288 transitions, 589 flow. Second operand 3 states and 869 transitions. [2025-03-14 01:36:02,836 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 298 places, 287 transitions, 625 flow [2025-03-14 01:36:02,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 293 places, 287 transitions, 615 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:02,839 INFO L231 Difference]: Finished difference. Result has 293 places, 287 transitions, 581 flow [2025-03-14 01:36:02,840 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=577, PETRI_DIFFERENCE_MINUEND_PLACES=291, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=287, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=285, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=581, PETRI_PLACES=293, PETRI_TRANSITIONS=287} [2025-03-14 01:36:02,840 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -13 predicate places. [2025-03-14 01:36:02,840 INFO L471 AbstractCegarLoop]: Abstraction has has 293 places, 287 transitions, 581 flow [2025-03-14 01:36:02,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 284.3333333333333) internal successors, (853), 3 states have internal predecessors, (853), 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-14 01:36:02,841 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:02,841 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] [2025-03-14 01:36:02,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-14 01:36:02,841 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:02,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:02,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1991775005, now seen corresponding path program 1 times [2025-03-14 01:36:02,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:02,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [588656178] [2025-03-14 01:36:02,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:02,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:02,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-14 01:36:02,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-14 01:36:02,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:02,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:02,892 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-14 01:36:02,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [588656178] [2025-03-14 01:36:02,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [588656178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:02,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:02,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-14 01:36:02,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691443206] [2025-03-14 01:36:02,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:02,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:02,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:02,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:02,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:02,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 281 out of 303 [2025-03-14 01:36:02,905 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 293 places, 287 transitions, 581 flow. Second operand has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-14 01:36:02,905 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:02,905 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 281 of 303 [2025-03-14 01:36:02,906 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:02,965 INFO L124 PetriNetUnfolderBase]: 36/759 cut-off events. [2025-03-14 01:36:02,965 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:02,966 INFO L83 FinitePrefix]: Finished finitePrefix Result has 857 conditions, 759 events. 36/759 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 2915 event pairs, 36 based on Foata normal form. 0/703 useless extension candidates. Maximal degree in co-relation 799. Up to 89 conditions per place. [2025-03-14 01:36:02,968 INFO L140 encePairwiseOnDemand]: 298/303 looper letters, 17 selfloop transitions, 1 changer transitions 0/283 dead transitions. [2025-03-14 01:36:02,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 291 places, 283 transitions, 609 flow [2025-03-14 01:36:02,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:02,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:02,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 865 transitions. [2025-03-14 01:36:02,970 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9515951595159516 [2025-03-14 01:36:02,970 INFO L175 Difference]: Start difference. First operand has 293 places, 287 transitions, 581 flow. Second operand 3 states and 865 transitions. [2025-03-14 01:36:02,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 291 places, 283 transitions, 609 flow [2025-03-14 01:36:02,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 289 places, 283 transitions, 605 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-14 01:36:02,973 INFO L231 Difference]: Finished difference. Result has 289 places, 283 transitions, 571 flow [2025-03-14 01:36:02,973 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=569, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=283, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=571, PETRI_PLACES=289, PETRI_TRANSITIONS=283} [2025-03-14 01:36:02,974 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -17 predicate places. [2025-03-14 01:36:02,974 INFO L471 AbstractCegarLoop]: Abstraction has has 289 places, 283 transitions, 571 flow [2025-03-14 01:36:02,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 282.0) internal successors, (846), 3 states have internal predecessors, (846), 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-14 01:36:02,974 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:02,975 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:02,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-14 01:36:02,975 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:02,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:02,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1908061501, now seen corresponding path program 1 times [2025-03-14 01:36:02,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:02,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558036626] [2025-03-14 01:36:02,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:02,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:02,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-03-14 01:36:03,009 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-03-14 01:36:03,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:03,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:03,552 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:03,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:03,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558036626] [2025-03-14 01:36:03,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558036626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:03,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:03,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:03,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3715052] [2025-03-14 01:36:03,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:03,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:03,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:03,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:03,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:03,847 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 303 [2025-03-14 01:36:03,848 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 283 transitions, 571 flow. Second operand has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-14 01:36:03,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:03,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 303 [2025-03-14 01:36:03,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:04,225 INFO L124 PetriNetUnfolderBase]: 638/2453 cut-off events. [2025-03-14 01:36:04,225 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-14 01:36:04,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3834 conditions, 2453 events. 638/2453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 15373 event pairs, 638 based on Foata normal form. 0/2306 useless extension candidates. Maximal degree in co-relation 3766. Up to 1370 conditions per place. [2025-03-14 01:36:04,235 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 93 selfloop transitions, 5 changer transitions 0/282 dead transitions. [2025-03-14 01:36:04,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 293 places, 282 transitions, 765 flow [2025-03-14 01:36:04,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1323 transitions. [2025-03-14 01:36:04,239 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7277227722772277 [2025-03-14 01:36:04,239 INFO L175 Difference]: Start difference. First operand has 289 places, 283 transitions, 571 flow. Second operand 6 states and 1323 transitions. [2025-03-14 01:36:04,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 293 places, 282 transitions, 765 flow [2025-03-14 01:36:04,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 292 places, 282 transitions, 764 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:04,243 INFO L231 Difference]: Finished difference. Result has 292 places, 282 transitions, 578 flow [2025-03-14 01:36:04,243 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=568, PETRI_DIFFERENCE_MINUEND_PLACES=287, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=282, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=578, PETRI_PLACES=292, PETRI_TRANSITIONS=282} [2025-03-14 01:36:04,244 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -14 predicate places. [2025-03-14 01:36:04,244 INFO L471 AbstractCegarLoop]: Abstraction has has 292 places, 282 transitions, 578 flow [2025-03-14 01:36:04,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 211.5) internal successors, (1269), 6 states have internal predecessors, (1269), 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-14 01:36:04,245 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:04,245 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:04,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-14 01:36:04,245 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:04,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash -833202783, now seen corresponding path program 1 times [2025-03-14 01:36:04,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:04,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753507676] [2025-03-14 01:36:04,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:04,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:04,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-14 01:36:04,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-14 01:36:04,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:04,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:04,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:04,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:04,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [753507676] [2025-03-14 01:36:04,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [753507676] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:04,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:04,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:04,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797796466] [2025-03-14 01:36:04,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:04,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:04,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:04,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:05,332 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-03-14 01:36:05,334 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 292 places, 282 transitions, 578 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-14 01:36:05,334 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:05,334 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-03-14 01:36:05,334 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:05,661 INFO L124 PetriNetUnfolderBase]: 232/1812 cut-off events. [2025-03-14 01:36:05,661 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-14 01:36:05,664 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2378 conditions, 1812 events. 232/1812 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 11450 event pairs, 20 based on Foata normal form. 0/1688 useless extension candidates. Maximal degree in co-relation 2310. Up to 313 conditions per place. [2025-03-14 01:36:05,667 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 108 selfloop transitions, 38 changer transitions 0/356 dead transitions. [2025-03-14 01:36:05,667 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 296 places, 356 transitions, 1018 flow [2025-03-14 01:36:05,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:05,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:05,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1534 transitions. [2025-03-14 01:36:05,670 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8437843784378438 [2025-03-14 01:36:05,671 INFO L175 Difference]: Start difference. First operand has 292 places, 282 transitions, 578 flow. Second operand 6 states and 1534 transitions. [2025-03-14 01:36:05,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 296 places, 356 transitions, 1018 flow [2025-03-14 01:36:05,672 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 291 places, 356 transitions, 1008 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:05,680 INFO L231 Difference]: Finished difference. Result has 296 places, 318 transitions, 826 flow [2025-03-14 01:36:05,680 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=286, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=264, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=826, PETRI_PLACES=296, PETRI_TRANSITIONS=318} [2025-03-14 01:36:05,681 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -10 predicate places. [2025-03-14 01:36:05,682 INFO L471 AbstractCegarLoop]: Abstraction has has 296 places, 318 transitions, 826 flow [2025-03-14 01:36:05,682 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 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-14 01:36:05,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:05,683 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:05,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-14 01:36:05,683 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:05,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:05,684 INFO L85 PathProgramCache]: Analyzing trace with hash 832417124, now seen corresponding path program 1 times [2025-03-14 01:36:05,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:05,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884563693] [2025-03-14 01:36:05,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:05,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:05,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-03-14 01:36:05,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-03-14 01:36:05,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:05,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-14 01:36:06,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:06,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884563693] [2025-03-14 01:36:06,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884563693] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:06,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:06,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:06,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [433761101] [2025-03-14 01:36:06,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:06,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:06,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:06,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:06,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:06,612 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-03-14 01:36:06,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 296 places, 318 transitions, 826 flow. Second operand has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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-14 01:36:06,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:06,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-03-14 01:36:06,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:06,823 INFO L124 PetriNetUnfolderBase]: 185/1616 cut-off events. [2025-03-14 01:36:06,823 INFO L125 PetriNetUnfolderBase]: For 202/207 co-relation queries the response was YES. [2025-03-14 01:36:06,826 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2396 conditions, 1616 events. 185/1616 cut-off events. For 202/207 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 10000 event pairs, 75 based on Foata normal form. 0/1496 useless extension candidates. Maximal degree in co-relation 2326. Up to 362 conditions per place. [2025-03-14 01:36:06,830 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 104 selfloop transitions, 5 changer transitions 0/333 dead transitions. [2025-03-14 01:36:06,830 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 300 places, 333 transitions, 1074 flow [2025-03-14 01:36:06,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:06,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-03-14 01:36:06,833 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-03-14 01:36:06,833 INFO L175 Difference]: Start difference. First operand has 296 places, 318 transitions, 826 flow. Second operand 6 states and 1504 transitions. [2025-03-14 01:36:06,833 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 300 places, 333 transitions, 1074 flow [2025-03-14 01:36:06,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 333 transitions, 1074 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:06,840 INFO L231 Difference]: Finished difference. Result has 300 places, 317 transitions, 834 flow [2025-03-14 01:36:06,841 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=312, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=834, PETRI_PLACES=300, PETRI_TRANSITIONS=317} [2025-03-14 01:36:06,842 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -6 predicate places. [2025-03-14 01:36:06,842 INFO L471 AbstractCegarLoop]: Abstraction has has 300 places, 317 transitions, 834 flow [2025-03-14 01:36:06,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 245.0) internal successors, (1470), 6 states have internal predecessors, (1470), 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-14 01:36:06,843 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:06,843 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:06,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-14 01:36:06,843 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:06,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:06,844 INFO L85 PathProgramCache]: Analyzing trace with hash 231270175, now seen corresponding path program 1 times [2025-03-14 01:36:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625567432] [2025-03-14 01:36:06,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:06,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:06,867 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-14 01:36:06,888 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-14 01:36:06,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:06,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:07,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:07,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625567432] [2025-03-14 01:36:07,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625567432] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:07,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:07,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:07,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316915967] [2025-03-14 01:36:07,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:07,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:07,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:07,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:07,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:07,752 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 303 [2025-03-14 01:36:07,754 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 300 places, 317 transitions, 834 flow. Second operand has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:07,754 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:07,754 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 303 [2025-03-14 01:36:07,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:08,032 INFO L124 PetriNetUnfolderBase]: 583/2973 cut-off events. [2025-03-14 01:36:08,032 INFO L125 PetriNetUnfolderBase]: For 700/707 co-relation queries the response was YES. [2025-03-14 01:36:08,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5060 conditions, 2973 events. 583/2973 cut-off events. For 700/707 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 21856 event pairs, 69 based on Foata normal form. 0/2786 useless extension candidates. Maximal degree in co-relation 4987. Up to 804 conditions per place. [2025-03-14 01:36:08,042 INFO L140 encePairwiseOnDemand]: 281/303 looper letters, 120 selfloop transitions, 72 changer transitions 0/406 dead transitions. [2025-03-14 01:36:08,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 305 places, 406 transitions, 1588 flow [2025-03-14 01:36:08,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:08,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1506 transitions. [2025-03-14 01:36:08,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8283828382838284 [2025-03-14 01:36:08,046 INFO L175 Difference]: Start difference. First operand has 300 places, 317 transitions, 834 flow. Second operand 6 states and 1506 transitions. [2025-03-14 01:36:08,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 305 places, 406 transitions, 1588 flow [2025-03-14 01:36:08,049 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 300 places, 406 transitions, 1570 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:08,052 INFO L231 Difference]: Finished difference. Result has 305 places, 387 transitions, 1490 flow [2025-03-14 01:36:08,052 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=824, PETRI_DIFFERENCE_MINUEND_PLACES=295, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=317, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=290, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1490, PETRI_PLACES=305, PETRI_TRANSITIONS=387} [2025-03-14 01:36:08,052 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, -1 predicate places. [2025-03-14 01:36:08,053 INFO L471 AbstractCegarLoop]: Abstraction has has 305 places, 387 transitions, 1490 flow [2025-03-14 01:36:08,053 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.5) internal successors, (1419), 6 states have internal predecessors, (1419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-14 01:36:08,053 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:08,053 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:08,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-14 01:36:08,054 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:08,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:08,054 INFO L85 PathProgramCache]: Analyzing trace with hash -187381016, now seen corresponding path program 1 times [2025-03-14 01:36:08,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:08,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873359370] [2025-03-14 01:36:08,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:08,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:08,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-14 01:36:08,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-14 01:36:08,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:08,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:08,643 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:08,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:08,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873359370] [2025-03-14 01:36:08,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1873359370] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:08,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:08,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:08,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148702726] [2025-03-14 01:36:08,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:08,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:08,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:08,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:08,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:08,898 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-03-14 01:36:08,899 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 305 places, 387 transitions, 1490 flow. Second operand has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-14 01:36:08,899 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:08,899 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-03-14 01:36:08,899 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:09,640 INFO L124 PetriNetUnfolderBase]: 1657/5720 cut-off events. [2025-03-14 01:36:09,640 INFO L125 PetriNetUnfolderBase]: For 3354/3414 co-relation queries the response was YES. [2025-03-14 01:36:09,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12817 conditions, 5720 events. 1657/5720 cut-off events. For 3354/3414 co-relation queries the response was YES. Maximal size of possible extension queue 116. Compared 46021 event pairs, 861 based on Foata normal form. 0/5391 useless extension candidates. Maximal degree in co-relation 12742. Up to 3155 conditions per place. [2025-03-14 01:36:09,665 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 209 selfloop transitions, 89 changer transitions 0/487 dead transitions. [2025-03-14 01:36:09,665 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 310 places, 487 transitions, 2490 flow [2025-03-14 01:36:09,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:09,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-03-14 01:36:09,668 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-03-14 01:36:09,668 INFO L175 Difference]: Start difference. First operand has 305 places, 387 transitions, 1490 flow. Second operand 6 states and 1424 transitions. [2025-03-14 01:36:09,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 310 places, 487 transitions, 2490 flow [2025-03-14 01:36:09,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 310 places, 487 transitions, 2490 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:09,682 INFO L231 Difference]: Finished difference. Result has 315 places, 471 transitions, 2292 flow [2025-03-14 01:36:09,682 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1490, PETRI_DIFFERENCE_MINUEND_PLACES=305, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=387, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=346, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2292, PETRI_PLACES=315, PETRI_TRANSITIONS=471} [2025-03-14 01:36:09,683 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 9 predicate places. [2025-03-14 01:36:09,683 INFO L471 AbstractCegarLoop]: Abstraction has has 315 places, 471 transitions, 2292 flow [2025-03-14 01:36:09,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 216.66666666666666) internal successors, (1300), 6 states have internal predecessors, (1300), 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-14 01:36:09,683 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:09,684 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:09,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-14 01:36:09,684 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:09,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:09,685 INFO L85 PathProgramCache]: Analyzing trace with hash 620931127, now seen corresponding path program 1 times [2025-03-14 01:36:09,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:09,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330805782] [2025-03-14 01:36:09,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:09,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:09,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-03-14 01:36:09,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-03-14 01:36:09,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:09,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:09,848 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:09,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:09,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330805782] [2025-03-14 01:36:09,848 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330805782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:09,848 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:09,848 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-14 01:36:09,848 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991172873] [2025-03-14 01:36:09,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:09,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-14 01:36:09,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:09,849 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-14 01:36:09,849 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-14 01:36:09,858 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 303 [2025-03-14 01:36:09,859 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 315 places, 471 transitions, 2292 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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-14 01:36:09,859 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:09,859 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 303 [2025-03-14 01:36:09,859 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:10,068 INFO L124 PetriNetUnfolderBase]: 315/1995 cut-off events. [2025-03-14 01:36:10,069 INFO L125 PetriNetUnfolderBase]: For 1183/1250 co-relation queries the response was YES. [2025-03-14 01:36:10,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4145 conditions, 1995 events. 315/1995 cut-off events. For 1183/1250 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 13443 event pairs, 31 based on Foata normal form. 4/1919 useless extension candidates. Maximal degree in co-relation 4072. Up to 312 conditions per place. [2025-03-14 01:36:10,078 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 10 selfloop transitions, 6 changer transitions 0/411 dead transitions. [2025-03-14 01:36:10,078 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 317 places, 411 transitions, 1760 flow [2025-03-14 01:36:10,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-14 01:36:10,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-14 01:36:10,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 897 transitions. [2025-03-14 01:36:10,080 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9867986798679867 [2025-03-14 01:36:10,081 INFO L175 Difference]: Start difference. First operand has 315 places, 471 transitions, 2292 flow. Second operand 3 states and 897 transitions. [2025-03-14 01:36:10,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 317 places, 411 transitions, 1760 flow [2025-03-14 01:36:10,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 317 places, 411 transitions, 1672 flow, removed 44 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:10,094 INFO L231 Difference]: Finished difference. Result has 318 places, 409 transitions, 1662 flow [2025-03-14 01:36:10,094 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1628, PETRI_DIFFERENCE_MINUEND_PLACES=315, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=405, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=399, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=1662, PETRI_PLACES=318, PETRI_TRANSITIONS=409} [2025-03-14 01:36:10,096 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 12 predicate places. [2025-03-14 01:36:10,096 INFO L471 AbstractCegarLoop]: Abstraction has has 318 places, 409 transitions, 1662 flow [2025-03-14 01:36:10,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 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-14 01:36:10,096 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:10,097 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:10,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-14 01:36:10,097 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:10,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:10,098 INFO L85 PathProgramCache]: Analyzing trace with hash 628300313, now seen corresponding path program 1 times [2025-03-14 01:36:10,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:10,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233111251] [2025-03-14 01:36:10,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:10,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:10,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-03-14 01:36:10,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-03-14 01:36:10,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:10,134 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:10,489 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:10,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:10,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233111251] [2025-03-14 01:36:10,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233111251] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:10,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:10,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:10,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869716711] [2025-03-14 01:36:10,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:10,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:10,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:10,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:10,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:10,869 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 303 [2025-03-14 01:36:10,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 318 places, 409 transitions, 1662 flow. Second operand has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-14 01:36:10,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:10,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 303 [2025-03-14 01:36:10,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:11,241 INFO L124 PetriNetUnfolderBase]: 690/3138 cut-off events. [2025-03-14 01:36:11,241 INFO L125 PetriNetUnfolderBase]: For 3017/3235 co-relation queries the response was YES. [2025-03-14 01:36:11,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7473 conditions, 3138 events. 690/3138 cut-off events. For 3017/3235 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 23938 event pairs, 54 based on Foata normal form. 20/3047 useless extension candidates. Maximal degree in co-relation 7390. Up to 742 conditions per place. [2025-03-14 01:36:11,254 INFO L140 encePairwiseOnDemand]: 284/303 looper letters, 192 selfloop transitions, 124 changer transitions 4/567 dead transitions. [2025-03-14 01:36:11,255 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 322 places, 567 transitions, 3269 flow [2025-03-14 01:36:11,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:11,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:11,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1552 transitions. [2025-03-14 01:36:11,259 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8536853685368537 [2025-03-14 01:36:11,259 INFO L175 Difference]: Start difference. First operand has 318 places, 409 transitions, 1662 flow. Second operand 6 states and 1552 transitions. [2025-03-14 01:36:11,259 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 322 places, 567 transitions, 3269 flow [2025-03-14 01:36:11,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 321 places, 567 transitions, 3246 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-14 01:36:11,273 INFO L231 Difference]: Finished difference. Result has 326 places, 511 transitions, 3038 flow [2025-03-14 01:36:11,275 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=1654, PETRI_DIFFERENCE_MINUEND_PLACES=316, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=408, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=326, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3038, PETRI_PLACES=326, PETRI_TRANSITIONS=511} [2025-03-14 01:36:11,275 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 20 predicate places. [2025-03-14 01:36:11,275 INFO L471 AbstractCegarLoop]: Abstraction has has 326 places, 511 transitions, 3038 flow [2025-03-14 01:36:11,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.66666666666666) internal successors, (1438), 6 states have internal predecessors, (1438), 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-14 01:36:11,276 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:11,276 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:11,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-14 01:36:11,277 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:11,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:11,278 INFO L85 PathProgramCache]: Analyzing trace with hash -734346093, now seen corresponding path program 1 times [2025-03-14 01:36:11,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:11,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789175327] [2025-03-14 01:36:11,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:11,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:11,304 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 204 statements into 1 equivalence classes. [2025-03-14 01:36:11,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 204 of 204 statements. [2025-03-14 01:36:11,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:11,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:11,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:11,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:11,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789175327] [2025-03-14 01:36:11,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789175327] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:11,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:11,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:11,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331594802] [2025-03-14 01:36:11,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:11,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:11,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:11,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:11,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:12,252 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 303 [2025-03-14 01:36:12,254 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 326 places, 511 transitions, 3038 flow. Second operand has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-14 01:36:12,254 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:12,254 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 303 [2025-03-14 01:36:12,254 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:12,548 INFO L124 PetriNetUnfolderBase]: 608/2941 cut-off events. [2025-03-14 01:36:12,548 INFO L125 PetriNetUnfolderBase]: For 5544/5717 co-relation queries the response was YES. [2025-03-14 01:36:12,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7925 conditions, 2941 events. 608/2941 cut-off events. For 5544/5717 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 22163 event pairs, 92 based on Foata normal form. 18/2903 useless extension candidates. Maximal degree in co-relation 7839. Up to 818 conditions per place. [2025-03-14 01:36:12,563 INFO L140 encePairwiseOnDemand]: 297/303 looper letters, 226 selfloop transitions, 17 changer transitions 0/526 dead transitions. [2025-03-14 01:36:12,563 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 330 places, 526 transitions, 3578 flow [2025-03-14 01:36:12,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:12,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1504 transitions. [2025-03-14 01:36:12,565 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8272827282728272 [2025-03-14 01:36:12,565 INFO L175 Difference]: Start difference. First operand has 326 places, 511 transitions, 3038 flow. Second operand 6 states and 1504 transitions. [2025-03-14 01:36:12,565 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 330 places, 526 transitions, 3578 flow [2025-03-14 01:36:12,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 526 transitions, 3560 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:12,584 INFO L231 Difference]: Finished difference. Result has 330 places, 510 transitions, 3052 flow [2025-03-14 01:36:12,586 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=493, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3052, PETRI_PLACES=330, PETRI_TRANSITIONS=510} [2025-03-14 01:36:12,586 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 24 predicate places. [2025-03-14 01:36:12,586 INFO L471 AbstractCegarLoop]: Abstraction has has 330 places, 510 transitions, 3052 flow [2025-03-14 01:36:12,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 246.0) internal successors, (1476), 6 states have internal predecessors, (1476), 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-14 01:36:12,587 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:12,587 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:12,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-14 01:36:12,588 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:12,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:12,589 INFO L85 PathProgramCache]: Analyzing trace with hash 392885271, now seen corresponding path program 1 times [2025-03-14 01:36:12,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:12,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769503400] [2025-03-14 01:36:12,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:12,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-14 01:36:12,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-14 01:36:12,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:12,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:12,959 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-14 01:36:12,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:12,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769503400] [2025-03-14 01:36:12,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769503400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-14 01:36:12,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-14 01:36:12,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-14 01:36:12,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638889099] [2025-03-14 01:36:12,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-14 01:36:12,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-14 01:36:12,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:12,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-14 01:36:12,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-14 01:36:13,164 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 207 out of 303 [2025-03-14 01:36:13,165 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 330 places, 510 transitions, 3052 flow. Second operand has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-14 01:36:13,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:13,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 207 of 303 [2025-03-14 01:36:13,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:13,768 INFO L124 PetriNetUnfolderBase]: 1547/5186 cut-off events. [2025-03-14 01:36:13,768 INFO L125 PetriNetUnfolderBase]: For 7490/7571 co-relation queries the response was YES. [2025-03-14 01:36:13,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15171 conditions, 5186 events. 1547/5186 cut-off events. For 7490/7571 co-relation queries the response was YES. Maximal size of possible extension queue 113. Compared 41369 event pairs, 582 based on Foata normal form. 1/5034 useless extension candidates. Maximal degree in co-relation 15084. Up to 2889 conditions per place. [2025-03-14 01:36:13,791 INFO L140 encePairwiseOnDemand]: 280/303 looper letters, 312 selfloop transitions, 103 changer transitions 8/616 dead transitions. [2025-03-14 01:36:13,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 616 transitions, 4508 flow [2025-03-14 01:36:13,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-14 01:36:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-14 01:36:13,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1424 transitions. [2025-03-14 01:36:13,793 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7832783278327833 [2025-03-14 01:36:13,793 INFO L175 Difference]: Start difference. First operand has 330 places, 510 transitions, 3052 flow. Second operand 6 states and 1424 transitions. [2025-03-14 01:36:13,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 616 transitions, 4508 flow [2025-03-14 01:36:13,815 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 330 places, 616 transitions, 4474 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-14 01:36:13,820 INFO L231 Difference]: Finished difference. Result has 335 places, 596 transitions, 4036 flow [2025-03-14 01:36:13,820 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3018, PETRI_DIFFERENCE_MINUEND_PLACES=325, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=510, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=455, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4036, PETRI_PLACES=335, PETRI_TRANSITIONS=596} [2025-03-14 01:36:13,821 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 29 predicate places. [2025-03-14 01:36:13,821 INFO L471 AbstractCegarLoop]: Abstraction has has 335 places, 596 transitions, 4036 flow [2025-03-14 01:36:13,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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-14 01:36:13,821 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:13,822 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:13,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-14 01:36:13,822 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:13,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:13,823 INFO L85 PathProgramCache]: Analyzing trace with hash -555370240, now seen corresponding path program 1 times [2025-03-14 01:36:13,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:13,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678317787] [2025-03-14 01:36:13,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:13,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:13,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-14 01:36:13,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:36:13,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:13,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:15,185 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:15,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:15,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1678317787] [2025-03-14 01:36:15,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1678317787] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:15,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [217009950] [2025-03-14 01:36:15,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:15,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:15,189 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-14 01:36:15,191 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-14 01:36:15,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-14 01:36:15,421 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:36:15,421 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:15,421 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:15,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 88 conjuncts are in the unsatisfiable core [2025-03-14 01:36:15,435 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:15,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:36:15,593 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:36:15,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:36:15,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:36:15,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:36:15,928 INFO L349 Elim1Store]: treesize reduction 60, result has 31.0 percent of original size [2025-03-14 01:36:15,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 41 [2025-03-14 01:36:16,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 01:36:16,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-14 01:36:16,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2025-03-14 01:36:16,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 01:36:16,560 INFO L349 Elim1Store]: treesize reduction 24, result has 41.5 percent of original size [2025-03-14 01:36:16,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 29 [2025-03-14 01:36:16,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 01:36:16,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-14 01:36:16,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-14 01:36:16,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-14 01:36:17,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2025-03-14 01:36:17,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-14 01:36:17,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2025-03-14 01:36:17,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2025-03-14 01:36:17,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:36:17,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2025-03-14 01:36:17,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2025-03-14 01:36:18,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 44 [2025-03-14 01:36:18,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2025-03-14 01:36:18,144 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:18,144 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:20,102 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:20,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-03-14 01:36:20,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:20,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-03-14 01:36:20,121 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:20,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-03-14 01:36:20,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:20,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2025-03-14 01:36:23,109 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 297 treesize of output 268 [2025-03-14 01:36:23,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 228 [2025-03-14 01:36:23,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 419 treesize of output 389 [2025-03-14 01:36:23,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 385 treesize of output 377 [2025-03-14 01:36:23,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 377 treesize of output 369 [2025-03-14 01:36:23,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 646 treesize of output 610 [2025-03-14 01:36:23,190 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 537 treesize of output 529 [2025-03-14 01:36:23,200 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 529 treesize of output 521 [2025-03-14 01:36:23,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 521 treesize of output 517 [2025-03-14 01:36:23,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 517 treesize of output 509 [2025-03-14 01:36:23,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 509 treesize of output 512 [2025-03-14 01:36:23,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 503 treesize of output 495 [2025-03-14 01:36:23,253 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,254 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 495 treesize of output 498 [2025-03-14 01:36:23,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 489 treesize of output 485 [2025-03-14 01:36:23,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 485 treesize of output 481 [2025-03-14 01:36:23,285 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 481 treesize of output 484 [2025-03-14 01:36:23,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 475 treesize of output 467 [2025-03-14 01:36:23,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 467 treesize of output 463 [2025-03-14 01:36:23,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 463 treesize of output 455 [2025-03-14 01:36:23,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:23,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 455 treesize of output 458 [2025-03-14 01:36:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:27,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [217009950] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:27,517 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:27,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 23] total 64 [2025-03-14 01:36:27,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749850389] [2025-03-14 01:36:27,517 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:27,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-03-14 01:36:27,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:27,519 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-03-14 01:36:27,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=374, Invalid=3730, Unknown=56, NotChecked=0, Total=4160 [2025-03-14 01:36:42,109 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 303 [2025-03-14 01:36:42,113 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 335 places, 596 transitions, 4036 flow. Second operand has 65 states, 65 states have (on average 116.16923076923077) internal successors, (7551), 65 states have internal predecessors, (7551), 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-14 01:36:42,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:42,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 303 [2025-03-14 01:36:42,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:36:51,351 INFO L124 PetriNetUnfolderBase]: 2682/7535 cut-off events. [2025-03-14 01:36:51,351 INFO L125 PetriNetUnfolderBase]: For 14378/14406 co-relation queries the response was YES. [2025-03-14 01:36:51,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25472 conditions, 7535 events. 2682/7535 cut-off events. For 14378/14406 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 61012 event pairs, 494 based on Foata normal form. 18/7484 useless extension candidates. Maximal degree in co-relation 25360. Up to 1706 conditions per place. [2025-03-14 01:36:51,390 INFO L140 encePairwiseOnDemand]: 264/303 looper letters, 755 selfloop transitions, 119 changer transitions 24/998 dead transitions. [2025-03-14 01:36:51,391 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 377 places, 998 transitions, 8624 flow [2025-03-14 01:36:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-14 01:36:51,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2025-03-14 01:36:51,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 5169 transitions. [2025-03-14 01:36:51,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.39673037071148975 [2025-03-14 01:36:51,397 INFO L175 Difference]: Start difference. First operand has 335 places, 596 transitions, 4036 flow. Second operand 43 states and 5169 transitions. [2025-03-14 01:36:51,397 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 377 places, 998 transitions, 8624 flow [2025-03-14 01:36:51,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 377 places, 998 transitions, 8402 flow, removed 111 selfloop flow, removed 0 redundant places. [2025-03-14 01:36:51,467 INFO L231 Difference]: Finished difference. Result has 383 places, 646 transitions, 4597 flow [2025-03-14 01:36:51,468 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=3888, PETRI_DIFFERENCE_MINUEND_PLACES=335, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=596, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=513, PETRI_DIFFERENCE_SUBTRAHEND_STATES=43, PETRI_FLOW=4597, PETRI_PLACES=383, PETRI_TRANSITIONS=646} [2025-03-14 01:36:51,468 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 77 predicate places. [2025-03-14 01:36:51,468 INFO L471 AbstractCegarLoop]: Abstraction has has 383 places, 646 transitions, 4597 flow [2025-03-14 01:36:51,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 116.16923076923077) internal successors, (7551), 65 states have internal predecessors, (7551), 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-14 01:36:51,470 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:36:51,471 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:36:51,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-14 01:36:51,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-14 01:36:51,671 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:36:51,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:36:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1775841806, now seen corresponding path program 1 times [2025-03-14 01:36:51,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:36:51,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861129095] [2025-03-14 01:36:51,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:36:51,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-14 01:36:51,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:36:51,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:51,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:52,911 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:52,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:36:52,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861129095] [2025-03-14 01:36:52,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861129095] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:36:52,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870364527] [2025-03-14 01:36:52,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-14 01:36:52,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:36:52,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:36:52,913 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-14 01:36:52,914 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-14 01:36:53,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-14 01:36:53,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:36:53,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-14 01:36:53,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:36:53,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 64 conjuncts are in the unsatisfiable core [2025-03-14 01:36:53,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:36:53,142 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:36:53,184 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-14 01:36:53,184 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-14 01:36:53,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2025-03-14 01:36:53,378 INFO L349 Elim1Store]: treesize reduction 54, result has 36.5 percent of original size [2025-03-14 01:36:53,379 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 28 treesize of output 45 [2025-03-14 01:36:53,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-03-14 01:36:53,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 31 [2025-03-14 01:36:53,739 INFO L349 Elim1Store]: treesize reduction 12, result has 61.3 percent of original size [2025-03-14 01:36:53,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2025-03-14 01:36:53,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-03-14 01:36:53,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2025-03-14 01:36:54,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2025-03-14 01:36:54,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-14 01:36:54,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2025-03-14 01:36:54,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:54,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-14 01:36:54,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:54,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-14 01:36:54,471 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 12 [2025-03-14 01:36:54,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,561 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 34 [2025-03-14 01:36:54,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:54,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:36:54,821 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 7 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= 0 (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 5 c_~B~0.offset)))) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store |c_#race| c_~A~0.base v_ArrVal_2793) |c_t_funThread1of1ForFork0_#t~mem33.base| v_ArrVal_2798) c_~B~0.base) (+ 6 c_~B~0.offset)) 0))) is different from false [2025-03-14 01:36:55,076 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ 6 c_~B~0.offset)) (.cse2 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (select |c_#race| c_~B~0.base) .cse3 0) .cse2 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 5 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0))))) is different from false [2025-03-14 01:36:55,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 5 c_~B~0.offset)) (.cse4 (+ 6 c_~B~0.offset)) (.cse3 (+ 7 c_~B~0.offset))) (let ((.cse0 (store |c_#race| c_~B~0.base (store (store (store (select |c_#race| c_~B~0.base) .cse2 0) .cse4 0) .cse3 0))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~A~0.base) (+ c_~A~0.offset 4)))) (and (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) (+ 4 c_~B~0.offset)) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse2) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse3) 0)) (forall ((v_ArrVal_2798 (Array Int Int)) (v_ArrVal_2793 (Array Int Int))) (= (select (select (store (store .cse0 c_~A~0.base v_ArrVal_2793) .cse1 v_ArrVal_2798) c_~B~0.base) .cse4) 0))))) is different from false [2025-03-14 01:36:55,099 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:55,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 62 [2025-03-14 01:36:55,104 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:55,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 206 treesize of output 170 [2025-03-14 01:36:55,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2025-03-14 01:36:55,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-14 01:36:55,118 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:55,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-14 01:36:55,124 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:55,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-14 01:36:55,131 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-14 01:36:55,131 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 1 [2025-03-14 01:36:56,008 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:36:56,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2025-03-14 01:36:56,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 131 [2025-03-14 01:36:56,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2025-03-14 01:36:56,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2025-03-14 01:36:56,679 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:36:56,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870364527] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-14 01:36:56,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-14 01:36:56,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22, 23] total 59 [2025-03-14 01:36:56,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305860240] [2025-03-14 01:36:56,680 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-14 01:36:56,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2025-03-14 01:36:56,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-14 01:36:56,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2025-03-14 01:36:56,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=2827, Unknown=103, NotChecked=336, Total=3540 [2025-03-14 01:36:57,291 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 303 [2025-03-14 01:36:57,295 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 383 places, 646 transitions, 4597 flow. Second operand has 60 states, 60 states have (on average 118.65) internal successors, (7119), 60 states have internal predecessors, (7119), 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-14 01:36:57,295 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-14 01:36:57,295 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 303 [2025-03-14 01:36:57,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-14 01:37:01,905 INFO L124 PetriNetUnfolderBase]: 3223/9036 cut-off events. [2025-03-14 01:37:01,905 INFO L125 PetriNetUnfolderBase]: For 18931/18954 co-relation queries the response was YES. [2025-03-14 01:37:01,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 31416 conditions, 9036 events. 3223/9036 cut-off events. For 18931/18954 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 77474 event pairs, 780 based on Foata normal form. 12/8935 useless extension candidates. Maximal degree in co-relation 31291. Up to 3331 conditions per place. [2025-03-14 01:37:01,943 INFO L140 encePairwiseOnDemand]: 262/303 looper letters, 733 selfloop transitions, 124 changer transitions 17/978 dead transitions. [2025-03-14 01:37:01,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 408 places, 978 transitions, 8684 flow [2025-03-14 01:37:01,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-14 01:37:01,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-03-14 01:37:01,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 3315 transitions. [2025-03-14 01:37:01,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4207920792079208 [2025-03-14 01:37:01,946 INFO L175 Difference]: Start difference. First operand has 383 places, 646 transitions, 4597 flow. Second operand 26 states and 3315 transitions. [2025-03-14 01:37:01,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 408 places, 978 transitions, 8684 flow [2025-03-14 01:37:02,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 389 places, 978 transitions, 8528 flow, removed 57 selfloop flow, removed 19 redundant places. [2025-03-14 01:37:02,012 INFO L231 Difference]: Finished difference. Result has 398 places, 705 transitions, 5664 flow [2025-03-14 01:37:02,012 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=303, PETRI_DIFFERENCE_MINUEND_FLOW=4481, PETRI_DIFFERENCE_MINUEND_PLACES=364, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=646, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=527, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5664, PETRI_PLACES=398, PETRI_TRANSITIONS=705} [2025-03-14 01:37:02,013 INFO L279 CegarLoopForPetriNet]: 306 programPoint places, 92 predicate places. [2025-03-14 01:37:02,013 INFO L471 AbstractCegarLoop]: Abstraction has has 398 places, 705 transitions, 5664 flow [2025-03-14 01:37:02,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 118.65) internal successors, (7119), 60 states have internal predecessors, (7119), 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-14 01:37:02,015 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-14 01:37:02,015 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-14 01:37:02,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-14 01:37:02,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-14 01:37:02,216 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr21ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr20ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr19ASSERT_VIOLATIONDATA_RACE (and 36 more)] === [2025-03-14 01:37:02,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-14 01:37:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1285665190, now seen corresponding path program 2 times [2025-03-14 01:37:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-14 01:37:02,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596735225] [2025-03-14 01:37:02,217 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-14 01:37:02,240 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-14 01:37:02,281 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:37:02,281 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:02,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:37:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-14 01:37:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596735225] [2025-03-14 01:37:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596735225] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-14 01:37:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013492088] [2025-03-14 01:37:03,932 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-14 01:37:03,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-14 01:37:03,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-14 01:37:03,934 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-14 01:37:03,935 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-14 01:37:04,100 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 213 statements into 2 equivalence classes. [2025-03-14 01:37:05,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 213 of 213 statements. [2025-03-14 01:37:05,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-14 01:37:05,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-14 01:37:05,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 107 conjuncts are in the unsatisfiable core [2025-03-14 01:37:05,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-14 01:37:05,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-14 01:37:05,533 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-14 01:37:05,533 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-14 01:37:05,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-14 01:37:05,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:37:05,818 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2025-03-14 01:37:05,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2025-03-14 01:37:06,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-14 01:37:06,036 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 01:37:06,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2025-03-14 01:37:06,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-14 01:37:06,363 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-14 01:37:06,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-14 01:37:06,378 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-14 01:37:06,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 16 [2025-03-14 01:37:06,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-14 01:37:06,545 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-14 01:37:06,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 27 [2025-03-14 01:37:06,556 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-14 01:37:06,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 26 [2025-03-14 01:37:06,764 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2025-03-14 01:37:06,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 28 [2025-03-14 01:37:06,776 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2025-03-14 01:37:06,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2025-03-14 01:37:07,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-14 01:37:07,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-14 01:37:07,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-14 01:37:07,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-14 01:37:07,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2025-03-14 01:37:07,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 38 [2025-03-14 01:37:07,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 8 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 41 [2025-03-14 01:37:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-14 01:37:07,642 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-14 01:37:09,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,538 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-14 01:37:09,543 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-14 01:37:09,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,555 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-14 01:37:09,560 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-14 01:37:09,573 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-14 01:37:09,577 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-14 01:37:09,590 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2025-03-14 01:37:09,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-14 01:37:09,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25