./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 8fc3dc66 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_05-ptra_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 11:04:58,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 11:04:58,375 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-17 11:04:58,378 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 11:04:58,379 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 11:04:58,400 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 11:04:58,401 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 11:04:58,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 11:04:58,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 11:04:58,402 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 11:04:58,402 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 11:04:58,402 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 11:04:58,403 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 11:04:58,403 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 11:04:58,404 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 11:04:58,405 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:04:58,405 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 11:04:58,405 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 11:04:58,405 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 -> b00ba58edbbf9092a3bbde4865c9e14ef534546a29b4ba514bb7ebaf27fc72c0 [2025-03-17 11:04:58,650 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 11:04:58,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 11:04:58,660 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 11:04:58,662 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 11:04:58,662 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 11:04:58,663 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-03-17 11:04:59,800 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47607579d/fd8329eb63bc45908a22456fccc35baa/FLAGc6bcb2653 [2025-03-17 11:05:00,171 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 11:05:00,171 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_05-ptra_rc.i [2025-03-17 11:05:00,184 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47607579d/fd8329eb63bc45908a22456fccc35baa/FLAGc6bcb2653 [2025-03-17 11:05:00,387 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/47607579d/fd8329eb63bc45908a22456fccc35baa [2025-03-17 11:05:00,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 11:05:00,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 11:05:00,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:00,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 11:05:00,395 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 11:05:00,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4349749f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00, skipping insertion in model container [2025-03-17 11:05:00,398 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,430 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 11:05:00,774 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:00,790 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 11:05:00,821 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 11:05:00,879 INFO L204 MainTranslator]: Completed translation [2025-03-17 11:05:00,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00 WrapperNode [2025-03-17 11:05:00,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 11:05:00,881 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:00,881 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 11:05:00,881 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 11:05:00,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,901 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,928 INFO L138 Inliner]: procedures = 368, calls = 35, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 207 [2025-03-17 11:05:00,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 11:05:00,929 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 11:05:00,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 11:05:00,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 11:05:00,935 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,935 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,938 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,939 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,948 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,950 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,953 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 11:05:00,954 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 11:05:00,954 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 11:05:00,954 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 11:05:00,954 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (1/1) ... [2025-03-17 11:05:00,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 11:05:00,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:00,995 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-17 11:05:01,000 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-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-17 11:05:01,013 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-17 11:05:01,013 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 11:05:01,013 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 11:05:01,015 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-17 11:05:01,121 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 11:05:01,122 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 11:05:01,470 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-17 11:05:01,470 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 11:05:01,492 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 11:05:01,494 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 11:05:01,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:01 BoogieIcfgContainer [2025-03-17 11:05:01,495 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 11:05:01,496 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 11:05:01,497 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 11:05:01,500 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 11:05:01,500 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 11:05:00" (1/3) ... [2025-03-17 11:05:01,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173793cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:01, skipping insertion in model container [2025-03-17 11:05:01,501 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 11:05:00" (2/3) ... [2025-03-17 11:05:01,501 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@173793cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 11:05:01, skipping insertion in model container [2025-03-17 11:05:01,502 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 11:05:01" (3/3) ... [2025-03-17 11:05:01,503 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_05-ptra_rc.i [2025-03-17 11:05:01,513 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 11:05:01,514 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_05-ptra_rc.i that has 2 procedures, 241 locations, 1 initial locations, 0 loop locations, and 22 error locations. [2025-03-17 11:05:01,517 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-17 11:05:01,593 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-17 11:05:01,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 244 places, 240 transitions, 484 flow [2025-03-17 11:05:01,694 INFO L124 PetriNetUnfolderBase]: 0/239 cut-off events. [2025-03-17 11:05:01,696 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:01,699 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 239 events. 0/239 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 115 event pairs, 0 based on Foata normal form. 0/217 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2025-03-17 11:05:01,699 INFO L82 GeneralOperation]: Start removeDead. Operand has 244 places, 240 transitions, 484 flow [2025-03-17 11:05:01,703 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 243 places, 239 transitions, 481 flow [2025-03-17 11:05:01,711 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 11:05:01,721 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;@4bafad3e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 11:05:01,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2025-03-17 11:05:01,730 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-17 11:05:01,731 INFO L124 PetriNetUnfolderBase]: 0/37 cut-off events. [2025-03-17 11:05:01,731 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:01,731 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:01,732 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] [2025-03-17 11:05:01,732 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:01,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:01,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1139656318, now seen corresponding path program 1 times [2025-03-17 11:05:01,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:01,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230188194] [2025-03-17 11:05:01,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:01,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:01,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-17 11:05:01,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-17 11:05:01,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:01,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:02,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-17 11:05:02,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:02,397 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230188194] [2025-03-17 11:05:02,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230188194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:02,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:02,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507514977] [2025-03-17 11:05:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:02,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:02,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:02,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:02,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:02,904 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-03-17 11:05:02,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 243 places, 239 transitions, 481 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-17 11:05:02,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:02,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-03-17 11:05:02,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:03,081 INFO L124 PetriNetUnfolderBase]: 220/1062 cut-off events. [2025-03-17 11:05:03,082 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1574 conditions, 1062 events. 220/1062 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5484 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1401. Up to 493 conditions per place. [2025-03-17 11:05:03,088 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/236 dead transitions. [2025-03-17 11:05:03,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 245 places, 236 transitions, 609 flow [2025-03-17 11:05:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:03,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:03,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-03-17 11:05:03,099 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-03-17 11:05:03,100 INFO L175 Difference]: Start difference. First operand has 243 places, 239 transitions, 481 flow. Second operand 6 states and 1090 transitions. [2025-03-17 11:05:03,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 245 places, 236 transitions, 609 flow [2025-03-17 11:05:03,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 244 places, 236 transitions, 608 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:03,111 INFO L231 Difference]: Finished difference. Result has 244 places, 236 transitions, 504 flow [2025-03-17 11:05:03,113 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=474, PETRI_DIFFERENCE_MINUEND_PLACES=239, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=504, PETRI_PLACES=244, PETRI_TRANSITIONS=236} [2025-03-17 11:05:03,117 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 1 predicate places. [2025-03-17 11:05:03,118 INFO L471 AbstractCegarLoop]: Abstraction has has 244 places, 236 transitions, 504 flow [2025-03-17 11:05:03,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-17 11:05:03,118 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:03,118 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] [2025-03-17 11:05:03,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 11:05:03,119 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:03,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:03,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2092819132, now seen corresponding path program 1 times [2025-03-17 11:05:03,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:03,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011713144] [2025-03-17 11:05:03,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:03,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:03,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 11:05:03,147 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 11:05:03,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:03,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:03,437 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-17 11:05:03,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:03,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011713144] [2025-03-17 11:05:03,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1011713144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:03,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:03,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:03,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403250256] [2025-03-17 11:05:03,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:03,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:03,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:03,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:03,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:03,812 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 240 [2025-03-17 11:05:03,814 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 236 transitions, 504 flow. Second operand has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-17 11:05:03,814 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:03,814 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 240 [2025-03-17 11:05:03,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:03,936 INFO L124 PetriNetUnfolderBase]: 220/1059 cut-off events. [2025-03-17 11:05:03,937 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:03,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1586 conditions, 1059 events. 220/1059 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 5464 event pairs, 220 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 1426. Up to 493 conditions per place. [2025-03-17 11:05:03,942 INFO L140 encePairwiseOnDemand]: 222/240 looper letters, 52 selfloop transitions, 15 changer transitions 0/233 dead transitions. [2025-03-17 11:05:03,942 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 246 places, 233 transitions, 632 flow [2025-03-17 11:05:03,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:03,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:03,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1090 transitions. [2025-03-17 11:05:03,945 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7569444444444444 [2025-03-17 11:05:03,945 INFO L175 Difference]: Start difference. First operand has 244 places, 236 transitions, 504 flow. Second operand 6 states and 1090 transitions. [2025-03-17 11:05:03,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 246 places, 233 transitions, 632 flow [2025-03-17 11:05:03,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 233 transitions, 602 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:03,949 INFO L231 Difference]: Finished difference. Result has 241 places, 233 transitions, 498 flow [2025-03-17 11:05:03,949 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=468, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=218, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=498, PETRI_PLACES=241, PETRI_TRANSITIONS=233} [2025-03-17 11:05:03,949 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -2 predicate places. [2025-03-17 11:05:03,949 INFO L471 AbstractCegarLoop]: Abstraction has has 241 places, 233 transitions, 498 flow [2025-03-17 11:05:03,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 171.33333333333334) internal successors, (1028), 6 states have internal predecessors, (1028), 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-17 11:05:03,950 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:03,950 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] [2025-03-17 11:05:03,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 11:05:03,950 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:03,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:03,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1873202314, now seen corresponding path program 1 times [2025-03-17 11:05:03,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:03,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721335771] [2025-03-17 11:05:03,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:03,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:03,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-17 11:05:03,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-17 11:05:03,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:03,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:03,988 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-17 11:05:03,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:03,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721335771] [2025-03-17 11:05:03,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721335771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:03,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:03,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:03,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114744885] [2025-03-17 11:05:03,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:03,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:03,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:03,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:03,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:04,014 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 240 [2025-03-17 11:05:04,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 241 places, 233 transitions, 498 flow. Second operand has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-17 11:05:04,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:04,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 240 [2025-03-17 11:05:04,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:04,055 INFO L124 PetriNetUnfolderBase]: 16/368 cut-off events. [2025-03-17 11:05:04,055 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:04,056 INFO L83 FinitePrefix]: Finished finitePrefix Result has 436 conditions, 368 events. 16/368 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 791 event pairs, 16 based on Foata normal form. 0/334 useless extension candidates. Maximal degree in co-relation 288. Up to 47 conditions per place. [2025-03-17 11:05:04,057 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 14 selfloop transitions, 2 changer transitions 0/232 dead transitions. [2025-03-17 11:05:04,057 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 242 places, 232 transitions, 528 flow [2025-03-17 11:05:04,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:04,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:04,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 686 transitions. [2025-03-17 11:05:04,059 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9527777777777777 [2025-03-17 11:05:04,059 INFO L175 Difference]: Start difference. First operand has 241 places, 233 transitions, 498 flow. Second operand 3 states and 686 transitions. [2025-03-17 11:05:04,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 242 places, 232 transitions, 528 flow [2025-03-17 11:05:04,060 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 237 places, 232 transitions, 498 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:04,062 INFO L231 Difference]: Finished difference. Result has 237 places, 232 transitions, 470 flow [2025-03-17 11:05:04,063 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=466, PETRI_DIFFERENCE_MINUEND_PLACES=235, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=232, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=230, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=470, PETRI_PLACES=237, PETRI_TRANSITIONS=232} [2025-03-17 11:05:04,063 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -6 predicate places. [2025-03-17 11:05:04,063 INFO L471 AbstractCegarLoop]: Abstraction has has 237 places, 232 transitions, 470 flow [2025-03-17 11:05:04,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.33333333333334) internal successors, (673), 3 states have internal predecessors, (673), 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-17 11:05:04,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:04,064 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] [2025-03-17 11:05:04,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 11:05:04,064 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:04,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:04,065 INFO L85 PathProgramCache]: Analyzing trace with hash 1873701926, now seen corresponding path program 1 times [2025-03-17 11:05:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894199144] [2025-03-17 11:05:04,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:04,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-17 11:05:04,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-17 11:05:04,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:04,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:04,117 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-17 11:05:04,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:04,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894199144] [2025-03-17 11:05:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894199144] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:04,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:04,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:04,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470610859] [2025-03-17 11:05:04,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:04,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:04,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:04,120 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:04,120 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:04,135 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 219 out of 240 [2025-03-17 11:05:04,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 237 places, 232 transitions, 470 flow. Second operand has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-17 11:05:04,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:04,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 219 of 240 [2025-03-17 11:05:04,136 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:04,177 INFO L124 PetriNetUnfolderBase]: 24/445 cut-off events. [2025-03-17 11:05:04,177 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:04,178 INFO L83 FinitePrefix]: Finished finitePrefix Result has 516 conditions, 445 events. 24/445 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1226 event pairs, 24 based on Foata normal form. 0/412 useless extension candidates. Maximal degree in co-relation 455. Up to 63 conditions per place. [2025-03-17 11:05:04,179 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 15 selfloop transitions, 1 changer transitions 0/227 dead transitions. [2025-03-17 11:05:04,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 227 transitions, 492 flow [2025-03-17 11:05:04,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:04,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:04,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 678 transitions. [2025-03-17 11:05:04,181 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9416666666666667 [2025-03-17 11:05:04,181 INFO L175 Difference]: Start difference. First operand has 237 places, 232 transitions, 470 flow. Second operand 3 states and 678 transitions. [2025-03-17 11:05:04,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 227 transitions, 492 flow [2025-03-17 11:05:04,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 232 places, 227 transitions, 488 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:04,184 INFO L231 Difference]: Finished difference. Result has 232 places, 227 transitions, 458 flow [2025-03-17 11:05:04,185 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=456, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=227, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=226, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=458, PETRI_PLACES=232, PETRI_TRANSITIONS=227} [2025-03-17 11:05:04,186 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -11 predicate places. [2025-03-17 11:05:04,186 INFO L471 AbstractCegarLoop]: Abstraction has has 232 places, 227 transitions, 458 flow [2025-03-17 11:05:04,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.0) internal successors, (660), 3 states have internal predecessors, (660), 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-17 11:05:04,186 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:04,186 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] [2025-03-17 11:05:04,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 11:05:04,187 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:04,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:04,188 INFO L85 PathProgramCache]: Analyzing trace with hash 2033230036, now seen corresponding path program 1 times [2025-03-17 11:05:04,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:04,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031520401] [2025-03-17 11:05:04,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-17 11:05:04,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-17 11:05:04,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:04,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:04,535 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-17 11:05:04,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:04,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031520401] [2025-03-17 11:05:04,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031520401] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:04,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:04,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:04,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813623785] [2025-03-17 11:05:04,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:04,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:04,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:04,536 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:04,536 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:04,796 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 240 [2025-03-17 11:05:04,801 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 232 places, 227 transitions, 458 flow. Second operand has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-17 11:05:04,801 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:04,801 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 240 [2025-03-17 11:05:04,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:04,906 INFO L124 PetriNetUnfolderBase]: 288/1198 cut-off events. [2025-03-17 11:05:04,906 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:04,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1851 conditions, 1198 events. 288/1198 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6405 event pairs, 288 based on Foata normal form. 0/1137 useless extension candidates. Maximal degree in co-relation 1780. Up to 643 conditions per place. [2025-03-17 11:05:04,910 INFO L140 encePairwiseOnDemand]: 234/240 looper letters, 66 selfloop transitions, 5 changer transitions 0/226 dead transitions. [2025-03-17 11:05:04,910 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 226 transitions, 598 flow [2025-03-17 11:05:04,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:04,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:04,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1080 transitions. [2025-03-17 11:05:04,913 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.75 [2025-03-17 11:05:04,913 INFO L175 Difference]: Start difference. First operand has 232 places, 227 transitions, 458 flow. Second operand 6 states and 1080 transitions. [2025-03-17 11:05:04,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 226 transitions, 598 flow [2025-03-17 11:05:04,916 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 235 places, 226 transitions, 597 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:04,918 INFO L231 Difference]: Finished difference. Result has 235 places, 226 transitions, 465 flow [2025-03-17 11:05:04,919 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=455, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=226, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=221, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=465, PETRI_PLACES=235, PETRI_TRANSITIONS=226} [2025-03-17 11:05:04,919 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -8 predicate places. [2025-03-17 11:05:04,920 INFO L471 AbstractCegarLoop]: Abstraction has has 235 places, 226 transitions, 465 flow [2025-03-17 11:05:04,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 172.16666666666666) internal successors, (1033), 6 states have internal predecessors, (1033), 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-17 11:05:04,921 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:04,921 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] [2025-03-17 11:05:04,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 11:05:04,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:04,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:04,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1627023198, now seen corresponding path program 1 times [2025-03-17 11:05:04,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:04,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326364782] [2025-03-17 11:05:04,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:04,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:04,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-17 11:05:04,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-17 11:05:04,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:04,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:04,992 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-17 11:05:04,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:04,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326364782] [2025-03-17 11:05:04,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326364782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:04,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:04,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:04,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799165231] [2025-03-17 11:05:04,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:04,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:04,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:04,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:04,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:05,008 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 227 out of 240 [2025-03-17 11:05:05,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 235 places, 226 transitions, 465 flow. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-17 11:05:05,009 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:05,009 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 227 of 240 [2025-03-17 11:05:05,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:05,035 INFO L124 PetriNetUnfolderBase]: 6/289 cut-off events. [2025-03-17 11:05:05,035 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:05,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 289 events. 6/289 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 402 event pairs, 6 based on Foata normal form. 0/273 useless extension candidates. Maximal degree in co-relation 263. Up to 23 conditions per place. [2025-03-17 11:05:05,036 INFO L140 encePairwiseOnDemand]: 237/240 looper letters, 10 selfloop transitions, 2 changer transitions 0/225 dead transitions. [2025-03-17 11:05:05,036 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 236 places, 225 transitions, 487 flow [2025-03-17 11:05:05,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:05,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2025-03-17 11:05:05,038 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9638888888888889 [2025-03-17 11:05:05,038 INFO L175 Difference]: Start difference. First operand has 235 places, 226 transitions, 465 flow. Second operand 3 states and 694 transitions. [2025-03-17 11:05:05,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 236 places, 225 transitions, 487 flow [2025-03-17 11:05:05,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 231 places, 225 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:05,040 INFO L231 Difference]: Finished difference. Result has 231 places, 225 transitions, 457 flow [2025-03-17 11:05:05,041 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=453, PETRI_DIFFERENCE_MINUEND_PLACES=229, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=225, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=457, PETRI_PLACES=231, PETRI_TRANSITIONS=225} [2025-03-17 11:05:05,041 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -12 predicate places. [2025-03-17 11:05:05,041 INFO L471 AbstractCegarLoop]: Abstraction has has 231 places, 225 transitions, 457 flow [2025-03-17 11:05:05,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 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-17 11:05:05,042 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:05,042 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] [2025-03-17 11:05:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 11:05:05,042 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 88940205, now seen corresponding path program 1 times [2025-03-17 11:05:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087650747] [2025-03-17 11:05:05,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:05,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:05,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-17 11:05:05,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-17 11:05:05,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:05,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:05,097 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-17 11:05:05,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:05,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087650747] [2025-03-17 11:05:05,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087650747] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:05,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:05,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 11:05:05,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417782737] [2025-03-17 11:05:05,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:05,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 11:05:05,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:05,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 11:05:05,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 11:05:05,116 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 231 out of 240 [2025-03-17 11:05:05,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 231 places, 225 transitions, 457 flow. Second operand has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-17 11:05:05,118 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:05,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 231 of 240 [2025-03-17 11:05:05,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:05,143 INFO L124 PetriNetUnfolderBase]: 4/286 cut-off events. [2025-03-17 11:05:05,144 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-17 11:05:05,144 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 286 events. 4/286 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 263 event pairs, 4 based on Foata normal form. 0/271 useless extension candidates. Maximal degree in co-relation 250. Up to 15 conditions per place. [2025-03-17 11:05:05,145 INFO L140 encePairwiseOnDemand]: 238/240 looper letters, 7 selfloop transitions, 1 changer transitions 0/224 dead transitions. [2025-03-17 11:05:05,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 232 places, 224 transitions, 471 flow [2025-03-17 11:05:05,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 11:05:05,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-17 11:05:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 702 transitions. [2025-03-17 11:05:05,146 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.975 [2025-03-17 11:05:05,146 INFO L175 Difference]: Start difference. First operand has 231 places, 225 transitions, 457 flow. Second operand 3 states and 702 transitions. [2025-03-17 11:05:05,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 232 places, 224 transitions, 471 flow [2025-03-17 11:05:05,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 230 places, 224 transitions, 467 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-03-17 11:05:05,149 INFO L231 Difference]: Finished difference. Result has 230 places, 224 transitions, 453 flow [2025-03-17 11:05:05,149 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=224, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=223, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=453, PETRI_PLACES=230, PETRI_TRANSITIONS=224} [2025-03-17 11:05:05,150 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -13 predicate places. [2025-03-17 11:05:05,150 INFO L471 AbstractCegarLoop]: Abstraction has has 230 places, 224 transitions, 453 flow [2025-03-17 11:05:05,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 232.0) internal successors, (696), 3 states have internal predecessors, (696), 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-17 11:05:05,151 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:05,152 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] [2025-03-17 11:05:05,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 11:05:05,152 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:05,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:05,153 INFO L85 PathProgramCache]: Analyzing trace with hash 191346417, now seen corresponding path program 1 times [2025-03-17 11:05:05,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:05,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023280179] [2025-03-17 11:05:05,153 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:05,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:05,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-17 11:05:05,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-17 11:05:05,187 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:05,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:05,609 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-17 11:05:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023280179] [2025-03-17 11:05:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023280179] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:05,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:05,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:05,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820289498] [2025-03-17 11:05:05,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:05,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:05,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:05,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:05,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:05,878 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 240 [2025-03-17 11:05:05,879 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 230 places, 224 transitions, 453 flow. Second operand has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-17 11:05:05,879 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:05,879 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 240 [2025-03-17 11:05:05,879 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:06,229 INFO L124 PetriNetUnfolderBase]: 316/1522 cut-off events. [2025-03-17 11:05:06,230 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-17 11:05:06,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2262 conditions, 1522 events. 316/1522 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 9241 event pairs, 36 based on Foata normal form. 0/1432 useless extension candidates. Maximal degree in co-relation 2192. Up to 388 conditions per place. [2025-03-17 11:05:06,235 INFO L140 encePairwiseOnDemand]: 212/240 looper letters, 107 selfloop transitions, 70 changer transitions 0/336 dead transitions. [2025-03-17 11:05:06,235 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 234 places, 336 transitions, 1031 flow [2025-03-17 11:05:06,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:06,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:06,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1229 transitions. [2025-03-17 11:05:06,238 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8534722222222222 [2025-03-17 11:05:06,238 INFO L175 Difference]: Start difference. First operand has 230 places, 224 transitions, 453 flow. Second operand 6 states and 1229 transitions. [2025-03-17 11:05:06,238 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 234 places, 336 transitions, 1031 flow [2025-03-17 11:05:06,239 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 233 places, 336 transitions, 1030 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-17 11:05:06,244 INFO L231 Difference]: Finished difference. Result has 238 places, 294 transitions, 930 flow [2025-03-17 11:05:06,245 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=450, PETRI_DIFFERENCE_MINUEND_PLACES=228, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=223, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=197, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=930, PETRI_PLACES=238, PETRI_TRANSITIONS=294} [2025-03-17 11:05:06,245 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, -5 predicate places. [2025-03-17 11:05:06,245 INFO L471 AbstractCegarLoop]: Abstraction has has 238 places, 294 transitions, 930 flow [2025-03-17 11:05:06,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 181.33333333333334) internal successors, (1088), 6 states have internal predecessors, (1088), 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-17 11:05:06,246 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:06,246 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] [2025-03-17 11:05:06,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 11:05:06,246 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:06,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:06,247 INFO L85 PathProgramCache]: Analyzing trace with hash 233285000, now seen corresponding path program 1 times [2025-03-17 11:05:06,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:06,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089050562] [2025-03-17 11:05:06,247 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:06,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:06,265 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-17 11:05:06,274 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-17 11:05:06,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:06,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:06,625 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-17 11:05:06,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:06,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089050562] [2025-03-17 11:05:06,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089050562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:06,625 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:06,625 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:06,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297205187] [2025-03-17 11:05:06,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:06,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:06,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:06,626 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:06,626 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:06,908 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-03-17 11:05:06,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 294 transitions, 930 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-17 11:05:06,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:06,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-03-17 11:05:06,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:07,151 INFO L124 PetriNetUnfolderBase]: 588/2293 cut-off events. [2025-03-17 11:05:07,151 INFO L125 PetriNetUnfolderBase]: For 602/608 co-relation queries the response was YES. [2025-03-17 11:05:07,154 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2293 events. 588/2293 cut-off events. For 602/608 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 15211 event pairs, 222 based on Foata normal form. 0/2182 useless extension candidates. Maximal degree in co-relation 4619. Up to 1090 conditions per place. [2025-03-17 11:05:07,160 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 114 selfloop transitions, 48 changer transitions 0/345 dead transitions. [2025-03-17 11:05:07,160 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 345 transitions, 1426 flow [2025-03-17 11:05:07,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:07,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:07,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-03-17 11:05:07,163 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-17 11:05:07,163 INFO L175 Difference]: Start difference. First operand has 238 places, 294 transitions, 930 flow. Second operand 6 states and 1166 transitions. [2025-03-17 11:05:07,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 345 transitions, 1426 flow [2025-03-17 11:05:07,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 345 transitions, 1426 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:07,174 INFO L231 Difference]: Finished difference. Result has 248 places, 337 transitions, 1318 flow [2025-03-17 11:05:07,175 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=930, PETRI_DIFFERENCE_MINUEND_PLACES=238, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=294, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1318, PETRI_PLACES=248, PETRI_TRANSITIONS=337} [2025-03-17 11:05:07,175 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 5 predicate places. [2025-03-17 11:05:07,176 INFO L471 AbstractCegarLoop]: Abstraction has has 248 places, 337 transitions, 1318 flow [2025-03-17 11:05:07,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-17 11:05:07,176 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:07,176 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] [2025-03-17 11:05:07,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 11:05:07,177 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:07,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:07,177 INFO L85 PathProgramCache]: Analyzing trace with hash -833216995, now seen corresponding path program 1 times [2025-03-17 11:05:07,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:07,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302467109] [2025-03-17 11:05:07,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:07,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:07,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-17 11:05:07,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-17 11:05:07,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:07,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:07,486 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-17 11:05:07,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:07,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302467109] [2025-03-17 11:05:07,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302467109] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:07,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:07,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:07,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205165767] [2025-03-17 11:05:07,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:07,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:07,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:07,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:07,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:07,809 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 181 out of 240 [2025-03-17 11:05:07,810 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 248 places, 337 transitions, 1318 flow. Second operand has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-17 11:05:07,811 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:07,811 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 181 of 240 [2025-03-17 11:05:07,811 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:08,219 INFO L124 PetriNetUnfolderBase]: 754/2823 cut-off events. [2025-03-17 11:05:08,219 INFO L125 PetriNetUnfolderBase]: For 1640/1696 co-relation queries the response was YES. [2025-03-17 11:05:08,225 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6590 conditions, 2823 events. 754/2823 cut-off events. For 1640/1696 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 19770 event pairs, 86 based on Foata normal form. 0/2729 useless extension candidates. Maximal degree in co-relation 6511. Up to 1017 conditions per place. [2025-03-17 11:05:08,233 INFO L140 encePairwiseOnDemand]: 217/240 looper letters, 136 selfloop transitions, 136 changer transitions 4/477 dead transitions. [2025-03-17 11:05:08,234 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 253 places, 477 transitions, 2626 flow [2025-03-17 11:05:08,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:08,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:08,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1224 transitions. [2025-03-17 11:05:08,236 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.85 [2025-03-17 11:05:08,236 INFO L175 Difference]: Start difference. First operand has 248 places, 337 transitions, 1318 flow. Second operand 6 states and 1224 transitions. [2025-03-17 11:05:08,236 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 253 places, 477 transitions, 2626 flow [2025-03-17 11:05:08,244 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 253 places, 477 transitions, 2608 flow, removed 9 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:08,248 INFO L231 Difference]: Finished difference. Result has 258 places, 468 transitions, 2666 flow [2025-03-17 11:05:08,249 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=1300, PETRI_DIFFERENCE_MINUEND_PLACES=248, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=337, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=35, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=291, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2666, PETRI_PLACES=258, PETRI_TRANSITIONS=468} [2025-03-17 11:05:08,250 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 15 predicate places. [2025-03-17 11:05:08,251 INFO L471 AbstractCegarLoop]: Abstraction has has 258 places, 468 transitions, 2666 flow [2025-03-17 11:05:08,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 187.33333333333334) internal successors, (1124), 6 states have internal predecessors, (1124), 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-17 11:05:08,251 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:08,251 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] [2025-03-17 11:05:08,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 11:05:08,252 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:08,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:08,252 INFO L85 PathProgramCache]: Analyzing trace with hash -794409332, now seen corresponding path program 1 times [2025-03-17 11:05:08,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:08,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092608318] [2025-03-17 11:05:08,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:08,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:08,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-17 11:05:08,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-17 11:05:08,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:08,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:08,567 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-17 11:05:08,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:08,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092608318] [2025-03-17 11:05:08,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092608318] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:08,568 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:08,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 11:05:08,568 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985337352] [2025-03-17 11:05:08,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:08,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 11:05:08,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:08,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 11:05:08,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 11:05:08,836 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 176 out of 240 [2025-03-17 11:05:08,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 258 places, 468 transitions, 2666 flow. Second operand has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-17 11:05:08,837 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:08,837 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 176 of 240 [2025-03-17 11:05:08,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:09,205 INFO L124 PetriNetUnfolderBase]: 968/3386 cut-off events. [2025-03-17 11:05:09,206 INFO L125 PetriNetUnfolderBase]: For 3817/3888 co-relation queries the response was YES. [2025-03-17 11:05:09,215 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9627 conditions, 3386 events. 968/3386 cut-off events. For 3817/3888 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 24375 event pairs, 207 based on Foata normal form. 0/3298 useless extension candidates. Maximal degree in co-relation 9545. Up to 1565 conditions per place. [2025-03-17 11:05:09,228 INFO L140 encePairwiseOnDemand]: 225/240 looper letters, 239 selfloop transitions, 62 changer transitions 0/525 dead transitions. [2025-03-17 11:05:09,228 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 263 places, 525 transitions, 3610 flow [2025-03-17 11:05:09,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 11:05:09,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-17 11:05:09,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1166 transitions. [2025-03-17 11:05:09,231 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8097222222222222 [2025-03-17 11:05:09,231 INFO L175 Difference]: Start difference. First operand has 258 places, 468 transitions, 2666 flow. Second operand 6 states and 1166 transitions. [2025-03-17 11:05:09,231 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 263 places, 525 transitions, 3610 flow [2025-03-17 11:05:09,250 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 263 places, 525 transitions, 3574 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:09,256 INFO L231 Difference]: Finished difference. Result has 268 places, 517 transitions, 3256 flow [2025-03-17 11:05:09,256 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=2630, PETRI_DIFFERENCE_MINUEND_PLACES=258, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=468, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=430, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3256, PETRI_PLACES=268, PETRI_TRANSITIONS=517} [2025-03-17 11:05:09,257 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 25 predicate places. [2025-03-17 11:05:09,257 INFO L471 AbstractCegarLoop]: Abstraction has has 268 places, 517 transitions, 3256 flow [2025-03-17 11:05:09,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 182.16666666666666) internal successors, (1093), 6 states have internal predecessors, (1093), 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-17 11:05:09,258 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:09,258 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] [2025-03-17 11:05:09,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 11:05:09,258 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:09,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:09,259 INFO L85 PathProgramCache]: Analyzing trace with hash -910476167, now seen corresponding path program 1 times [2025-03-17 11:05:09,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:09,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842921089] [2025-03-17 11:05:09,259 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:09,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:09,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:05:09,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:09,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:09,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:09,913 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-17 11:05:09,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:09,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842921089] [2025-03-17 11:05:09,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842921089] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:09,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:09,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:09,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910955963] [2025-03-17 11:05:09,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:09,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:09,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:09,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:09,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:11,132 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-03-17 11:05:11,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 268 places, 517 transitions, 3256 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:11,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:11,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-03-17 11:05:11,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:12,208 INFO L124 PetriNetUnfolderBase]: 1524/5131 cut-off events. [2025-03-17 11:05:12,209 INFO L125 PetriNetUnfolderBase]: For 8753/8854 co-relation queries the response was YES. [2025-03-17 11:05:12,221 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16430 conditions, 5131 events. 1524/5131 cut-off events. For 8753/8854 co-relation queries the response was YES. Maximal size of possible extension queue 130. Compared 41517 event pairs, 111 based on Foata normal form. 47/5076 useless extension candidates. Maximal degree in co-relation 16338. Up to 1002 conditions per place. [2025-03-17 11:05:12,237 INFO L140 encePairwiseOnDemand]: 211/240 looper letters, 478 selfloop transitions, 172 changer transitions 0/843 dead transitions. [2025-03-17 11:05:12,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 843 transitions, 7206 flow [2025-03-17 11:05:12,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:12,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3314 transitions. [2025-03-17 11:05:12,243 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7267543859649123 [2025-03-17 11:05:12,243 INFO L175 Difference]: Start difference. First operand has 268 places, 517 transitions, 3256 flow. Second operand 19 states and 3314 transitions. [2025-03-17 11:05:12,243 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 843 transitions, 7206 flow [2025-03-17 11:05:12,280 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 286 places, 843 transitions, 7024 flow, removed 91 selfloop flow, removed 0 redundant places. [2025-03-17 11:05:12,288 INFO L231 Difference]: Finished difference. Result has 295 places, 640 transitions, 4992 flow [2025-03-17 11:05:12,289 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=3144, PETRI_DIFFERENCE_MINUEND_PLACES=268, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=517, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=65, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=372, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4992, PETRI_PLACES=295, PETRI_TRANSITIONS=640} [2025-03-17 11:05:12,290 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 52 predicate places. [2025-03-17 11:05:12,290 INFO L471 AbstractCegarLoop]: Abstraction has has 295 places, 640 transitions, 4992 flow [2025-03-17 11:05:12,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:12,291 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:12,291 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] [2025-03-17 11:05:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 11:05:12,291 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:12,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:12,292 INFO L85 PathProgramCache]: Analyzing trace with hash -966143385, now seen corresponding path program 2 times [2025-03-17 11:05:12,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378170957] [2025-03-17 11:05:12,292 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-17 11:05:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:12,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:12,330 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 149 of 151 statements. [2025-03-17 11:05:12,331 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-17 11:05:12,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:12,900 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-17 11:05:12,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:12,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378170957] [2025-03-17 11:05:12,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378170957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:12,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:12,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:12,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163912293] [2025-03-17 11:05:12,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:12,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:12,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:12,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:12,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:13,648 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-03-17 11:05:13,650 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 295 places, 640 transitions, 4992 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:13,650 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:13,650 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-03-17 11:05:13,650 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:14,892 INFO L124 PetriNetUnfolderBase]: 2138/7193 cut-off events. [2025-03-17 11:05:14,892 INFO L125 PetriNetUnfolderBase]: For 17219/17439 co-relation queries the response was YES. [2025-03-17 11:05:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24652 conditions, 7193 events. 2138/7193 cut-off events. For 17219/17439 co-relation queries the response was YES. Maximal size of possible extension queue 208. Compared 65516 event pairs, 198 based on Foata normal form. 57/7126 useless extension candidates. Maximal degree in co-relation 24547. Up to 2162 conditions per place. [2025-03-17 11:05:14,933 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 458 selfloop transitions, 189 changer transitions 1/841 dead transitions. [2025-03-17 11:05:14,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 309 places, 841 transitions, 8174 flow [2025-03-17 11:05:14,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:05:14,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:05:14,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2614 transitions. [2025-03-17 11:05:14,939 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7261111111111112 [2025-03-17 11:05:14,939 INFO L175 Difference]: Start difference. First operand has 295 places, 640 transitions, 4992 flow. Second operand 15 states and 2614 transitions. [2025-03-17 11:05:14,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 309 places, 841 transitions, 8174 flow [2025-03-17 11:05:15,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 304 places, 841 transitions, 8119 flow, removed 14 selfloop flow, removed 5 redundant places. [2025-03-17 11:05:15,017 INFO L231 Difference]: Finished difference. Result has 314 places, 736 transitions, 7002 flow [2025-03-17 11:05:15,018 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=4951, PETRI_DIFFERENCE_MINUEND_PLACES=290, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=640, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=93, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=462, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=7002, PETRI_PLACES=314, PETRI_TRANSITIONS=736} [2025-03-17 11:05:15,018 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 71 predicate places. [2025-03-17 11:05:15,018 INFO L471 AbstractCegarLoop]: Abstraction has has 314 places, 736 transitions, 7002 flow [2025-03-17 11:05:15,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:15,019 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:15,019 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] [2025-03-17 11:05:15,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 11:05:15,020 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:15,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:15,020 INFO L85 PathProgramCache]: Analyzing trace with hash 602291321, now seen corresponding path program 3 times [2025-03-17 11:05:15,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:15,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670548739] [2025-03-17 11:05:15,021 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-17 11:05:15,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:15,041 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:15,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 149 of 151 statements. [2025-03-17 11:05:15,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-17 11:05:15,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:15,591 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-17 11:05:15,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:15,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670548739] [2025-03-17 11:05:15,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [670548739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 11:05:15,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 11:05:15,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 11:05:15,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881979023] [2025-03-17 11:05:15,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 11:05:15,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-17 11:05:15,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:15,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-17 11:05:15,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2025-03-17 11:05:16,629 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 163 out of 240 [2025-03-17 11:05:16,631 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 314 places, 736 transitions, 7002 flow. Second operand has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:16,631 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:16,631 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 163 of 240 [2025-03-17 11:05:16,631 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:18,790 INFO L124 PetriNetUnfolderBase]: 3213/10760 cut-off events. [2025-03-17 11:05:18,790 INFO L125 PetriNetUnfolderBase]: For 35245/35596 co-relation queries the response was YES. [2025-03-17 11:05:18,824 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38860 conditions, 10760 events. 3213/10760 cut-off events. For 35245/35596 co-relation queries the response was YES. Maximal size of possible extension queue 333. Compared 108762 event pairs, 300 based on Foata normal form. 116/10689 useless extension candidates. Maximal degree in co-relation 38744. Up to 2268 conditions per place. [2025-03-17 11:05:18,856 INFO L140 encePairwiseOnDemand]: 205/240 looper letters, 525 selfloop transitions, 374 changer transitions 2/1094 dead transitions. [2025-03-17 11:05:18,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 332 places, 1094 transitions, 12605 flow [2025-03-17 11:05:18,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:18,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3353 transitions. [2025-03-17 11:05:18,861 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7353070175438596 [2025-03-17 11:05:18,861 INFO L175 Difference]: Start difference. First operand has 314 places, 736 transitions, 7002 flow. Second operand 19 states and 3353 transitions. [2025-03-17 11:05:18,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 332 places, 1094 transitions, 12605 flow [2025-03-17 11:05:19,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 329 places, 1094 transitions, 12570 flow, removed 15 selfloop flow, removed 3 redundant places. [2025-03-17 11:05:19,019 INFO L231 Difference]: Finished difference. Result has 344 places, 884 transitions, 10755 flow [2025-03-17 11:05:19,020 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=6971, PETRI_DIFFERENCE_MINUEND_PLACES=311, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=736, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=237, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=389, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=10755, PETRI_PLACES=344, PETRI_TRANSITIONS=884} [2025-03-17 11:05:19,020 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 101 predicate places. [2025-03-17 11:05:19,020 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 884 transitions, 10755 flow [2025-03-17 11:05:19,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 166.69230769230768) internal successors, (2167), 13 states have internal predecessors, (2167), 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-17 11:05:19,021 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:19,021 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] [2025-03-17 11:05:19,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 11:05:19,022 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:19,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:19,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1769915901, now seen corresponding path program 4 times [2025-03-17 11:05:19,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:19,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616711419] [2025-03-17 11:05:19,022 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:19,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:19,044 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:19,057 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-03-17 11:05:19,057 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:05:19,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:19,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:19,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:19,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616711419] [2025-03-17 11:05:19,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616711419] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:19,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447040001] [2025-03-17 11:05:19,683 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-17 11:05:19,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:19,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:19,685 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-17 11:05:19,687 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-17 11:05:19,797 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:19,841 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 145 of 151 statements. [2025-03-17 11:05:19,841 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-17 11:05:19,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:19,845 INFO L256 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:05:19,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:19,877 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-17 11:05:19,941 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:05:19,942 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-17 11:05:19,998 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:05:19,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:05:20,014 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 13 treesize of output 9 [2025-03-17 11:05:20,021 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 23 treesize of output 22 [2025-03-17 11:05:20,031 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:20,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 11:05:20,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:20,046 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 11:05:20,086 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-17 11:05:20,094 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:20,094 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:21,961 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-17 11:05:21,982 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 6)) (.cse2 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1454 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1454) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-17 11:05:23,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:23,773 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 37 treesize of output 53 [2025-03-17 11:05:23,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:23,778 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 66 treesize of output 36 [2025-03-17 11:05:23,785 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:23,789 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:23,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:23,795 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:23,795 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:23,943 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:23,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447040001] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:23,943 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:23,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 18 [2025-03-17 11:05:23,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526625335] [2025-03-17 11:05:23,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:23,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-17 11:05:23,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:23,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-17 11:05:23,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=205, Unknown=22, NotChecked=62, Total=342 [2025-03-17 11:05:24,115 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-03-17 11:05:24,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 884 transitions, 10755 flow. Second operand has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-17 11:05:24,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:24,116 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-03-17 11:05:24,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:27,947 INFO L124 PetriNetUnfolderBase]: 5368/15024 cut-off events. [2025-03-17 11:05:27,947 INFO L125 PetriNetUnfolderBase]: For 65728/66200 co-relation queries the response was YES. [2025-03-17 11:05:28,000 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60290 conditions, 15024 events. 5368/15024 cut-off events. For 65728/66200 co-relation queries the response was YES. Maximal size of possible extension queue 400. Compared 146899 event pairs, 1097 based on Foata normal form. 42/14777 useless extension candidates. Maximal degree in co-relation 60152. Up to 5220 conditions per place. [2025-03-17 11:05:28,040 INFO L140 encePairwiseOnDemand]: 219/240 looper letters, 834 selfloop transitions, 215 changer transitions 0/1166 dead transitions. [2025-03-17 11:05:28,041 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 362 places, 1166 transitions, 15293 flow [2025-03-17 11:05:28,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-17 11:05:28,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-03-17 11:05:28,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 2648 transitions. [2025-03-17 11:05:28,043 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5807017543859649 [2025-03-17 11:05:28,043 INFO L175 Difference]: Start difference. First operand has 344 places, 884 transitions, 10755 flow. Second operand 19 states and 2648 transitions. [2025-03-17 11:05:28,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 362 places, 1166 transitions, 15293 flow [2025-03-17 11:05:28,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 359 places, 1166 transitions, 15202 flow, removed 43 selfloop flow, removed 3 redundant places. [2025-03-17 11:05:28,339 INFO L231 Difference]: Finished difference. Result has 368 places, 945 transitions, 12283 flow [2025-03-17 11:05:28,339 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=10664, PETRI_DIFFERENCE_MINUEND_PLACES=341, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=884, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=154, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=688, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=12283, PETRI_PLACES=368, PETRI_TRANSITIONS=945} [2025-03-17 11:05:28,340 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 125 predicate places. [2025-03-17 11:05:28,340 INFO L471 AbstractCegarLoop]: Abstraction has has 368 places, 945 transitions, 12283 flow [2025-03-17 11:05:28,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 129.42105263157896) internal successors, (2459), 19 states have internal predecessors, (2459), 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-17 11:05:28,341 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:28,341 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] [2025-03-17 11:05:28,348 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-17 11:05:28,541 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,SelfDestructingSolverStorable14 [2025-03-17 11:05:28,541 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:28,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:28,542 INFO L85 PathProgramCache]: Analyzing trace with hash -1402149683, now seen corresponding path program 1 times [2025-03-17 11:05:28,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:28,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172416944] [2025-03-17 11:05:28,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:28,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:28,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:05:28,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:28,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:28,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:29,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172416944] [2025-03-17 11:05:29,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172416944] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:29,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400637519] [2025-03-17 11:05:29,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 11:05:29,308 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:29,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:29,310 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-17 11:05:29,311 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-17 11:05:29,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:05:29,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:29,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:05:29,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:29,490 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-17 11:05:29,496 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:29,502 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-17 11:05:29,572 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:05:29,572 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-17 11:05:29,643 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:05:29,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:05:29,689 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-17 11:05:29,707 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 21 treesize of output 20 [2025-03-17 11:05:29,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:29,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2025-03-17 11:05:29,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:29,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-17 11:05:29,803 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 43 treesize of output 32 [2025-03-17 11:05:29,812 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:29,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:29,830 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store |c_#race| c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|)))) is different from false [2025-03-17 11:05:29,843 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 3))) (let ((.cse0 (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| (store (select |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1 |c_t_funThread1of1ForFork0_init_#t~nondet30#1|)))) (and (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 1)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) |c_t_funThread1of1ForFork0_init_~p#1.offset|))) (forall ((v_ArrVal_1713 (Array Int Int))) (= |c_t_funThread1of1ForFork0_init_#t~nondet30#1| (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) (+ |c_t_funThread1of1ForFork0_init_~p#1.offset| 2)))) (forall ((v_ArrVal_1713 (Array Int Int))) (= (select (select (store .cse0 c_~A~0.base v_ArrVal_1713) |c_t_funThread1of1ForFork0_init_~p#1.base|) .cse1) |c_t_funThread1of1ForFork0_init_#t~nondet30#1|))))) is different from false [2025-03-17 11:05:33,657 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:33,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400637519] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:33,657 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:33,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 27 [2025-03-17 11:05:33,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624542276] [2025-03-17 11:05:33,658 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:33,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-17 11:05:33,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:33,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-17 11:05:33,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=556, Unknown=19, NotChecked=98, Total=756 [2025-03-17 11:05:33,890 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 240 [2025-03-17 11:05:33,892 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 945 transitions, 12283 flow. Second operand has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-17 11:05:33,892 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:33,892 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 240 [2025-03-17 11:05:33,892 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:38,273 INFO L124 PetriNetUnfolderBase]: 5546/15179 cut-off events. [2025-03-17 11:05:38,274 INFO L125 PetriNetUnfolderBase]: For 82511/82869 co-relation queries the response was YES. [2025-03-17 11:05:38,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 64016 conditions, 15179 events. 5546/15179 cut-off events. For 82511/82869 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 147695 event pairs, 1243 based on Foata normal form. 115/15026 useless extension candidates. Maximal degree in co-relation 63868. Up to 5456 conditions per place. [2025-03-17 11:05:38,372 INFO L140 encePairwiseOnDemand]: 218/240 looper letters, 853 selfloop transitions, 195 changer transitions 0/1162 dead transitions. [2025-03-17 11:05:38,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 382 places, 1162 transitions, 17111 flow [2025-03-17 11:05:38,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 11:05:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2025-03-17 11:05:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 2084 transitions. [2025-03-17 11:05:38,374 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5788888888888889 [2025-03-17 11:05:38,374 INFO L175 Difference]: Start difference. First operand has 368 places, 945 transitions, 12283 flow. Second operand 15 states and 2084 transitions. [2025-03-17 11:05:38,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 382 places, 1162 transitions, 17111 flow [2025-03-17 11:05:38,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 373 places, 1162 transitions, 16820 flow, removed 124 selfloop flow, removed 9 redundant places. [2025-03-17 11:05:38,689 INFO L231 Difference]: Finished difference. Result has 378 places, 963 transitions, 13063 flow [2025-03-17 11:05:38,689 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12108, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=945, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=177, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=753, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=13063, PETRI_PLACES=378, PETRI_TRANSITIONS=963} [2025-03-17 11:05:38,690 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 135 predicate places. [2025-03-17 11:05:38,690 INFO L471 AbstractCegarLoop]: Abstraction has has 378 places, 963 transitions, 13063 flow [2025-03-17 11:05:38,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 127.35714285714286) internal successors, (3566), 28 states have internal predecessors, (3566), 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-17 11:05:38,691 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:38,691 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 11:05:38,697 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-17 11:05:38,891 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,SelfDestructingSolverStorable15 [2025-03-17 11:05:38,891 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:38,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:38,892 INFO L85 PathProgramCache]: Analyzing trace with hash 984533089, now seen corresponding path program 5 times [2025-03-17 11:05:38,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:38,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005420219] [2025-03-17 11:05:38,892 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:38,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:38,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:38,926 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:38,926 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:05:38,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005420219] [2025-03-17 11:05:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005420219] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431384775] [2025-03-17 11:05:39,399 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-17 11:05:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:39,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:39,401 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-17 11:05:39,403 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-17 11:05:39,521 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:39,610 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:39,611 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-17 11:05:39,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:39,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:05:39,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:39,619 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-17 11:05:39,663 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:05:39,663 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-17 11:05:39,710 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:05:39,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:05:39,718 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 13 treesize of output 9 [2025-03-17 11:05:39,725 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 23 treesize of output 22 [2025-03-17 11:05:39,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:39,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 11:05:39,749 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:39,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 11:05:39,802 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-17 11:05:39,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:39,808 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:39,824 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0))) is different from false [2025-03-17 11:05:41,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= 0 (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1))) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-17 11:05:41,674 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 6)) (.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse2) 0))))) is different from false [2025-03-17 11:05:41,685 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset 5)) (.cse1 (+ c_~A~0.offset 6)) (.cse3 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (store (select |c_#race| c_~A~0.base) .cse2 0) .cse1 0) .cse3 0)))) (and (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_1969 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_1969) c_~A~0.base) .cse3) 0))))) is different from false [2025-03-17 11:05:41,695 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:41,695 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 37 treesize of output 53 [2025-03-17 11:05:41,698 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:41,698 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 66 treesize of output 36 [2025-03-17 11:05:41,706 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:41,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:41,711 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:41,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:41,715 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:05:41,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:05:41,815 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:41,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431384775] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:41,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:41,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-17 11:05:41,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609458526] [2025-03-17 11:05:41,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:41,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:05:41,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:41,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:05:41,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=207, Unknown=25, NotChecked=132, Total=420 [2025-03-17 11:05:42,034 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-03-17 11:05:42,036 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 378 places, 963 transitions, 13063 flow. Second operand has 21 states, 21 states have (on average 129.0952380952381) internal successors, (2711), 21 states have internal predecessors, (2711), 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-17 11:05:42,036 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:05:42,036 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-03-17 11:05:42,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:05:47,285 INFO L124 PetriNetUnfolderBase]: 7221/19965 cut-off events. [2025-03-17 11:05:47,286 INFO L125 PetriNetUnfolderBase]: For 117894/118475 co-relation queries the response was YES. [2025-03-17 11:05:47,374 INFO L83 FinitePrefix]: Finished finitePrefix Result has 87549 conditions, 19965 events. 7221/19965 cut-off events. For 117894/118475 co-relation queries the response was YES. Maximal size of possible extension queue 588. Compared 207628 event pairs, 1404 based on Foata normal form. 141/19748 useless extension candidates. Maximal degree in co-relation 87395. Up to 6113 conditions per place. [2025-03-17 11:05:47,428 INFO L140 encePairwiseOnDemand]: 207/240 looper letters, 909 selfloop transitions, 422 changer transitions 6/1455 dead transitions. [2025-03-17 11:05:47,428 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 397 places, 1455 transitions, 21295 flow [2025-03-17 11:05:47,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-17 11:05:47,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-03-17 11:05:47,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 2885 transitions. [2025-03-17 11:05:47,430 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6010416666666667 [2025-03-17 11:05:47,430 INFO L175 Difference]: Start difference. First operand has 378 places, 963 transitions, 13063 flow. Second operand 20 states and 2885 transitions. [2025-03-17 11:05:47,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 397 places, 1455 transitions, 21295 flow [2025-03-17 11:05:47,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 1455 transitions, 21114 flow, removed 0 selfloop flow, removed 9 redundant places. [2025-03-17 11:05:47,912 INFO L231 Difference]: Finished difference. Result has 399 places, 1078 transitions, 17159 flow [2025-03-17 11:05:47,913 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=12940, PETRI_DIFFERENCE_MINUEND_PLACES=369, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=963, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=307, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=545, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=17159, PETRI_PLACES=399, PETRI_TRANSITIONS=1078} [2025-03-17 11:05:47,913 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 156 predicate places. [2025-03-17 11:05:47,913 INFO L471 AbstractCegarLoop]: Abstraction has has 399 places, 1078 transitions, 17159 flow [2025-03-17 11:05:47,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 129.0952380952381) internal successors, (2711), 21 states have internal predecessors, (2711), 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-17 11:05:47,914 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:05:47,914 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] [2025-03-17 11:05:47,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-17 11:05:48,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:48,118 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:05:48,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:05:48,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1725520067, now seen corresponding path program 6 times [2025-03-17 11:05:48,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:05:48,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864912717] [2025-03-17 11:05:48,119 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:05:48,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:05:48,133 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:48,147 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:48,148 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 11:05:48,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:48,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:05:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864912717] [2025-03-17 11:05:48,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864912717] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:05:48,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731364544] [2025-03-17 11:05:48,930 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-17 11:05:48,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:05:48,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:05:48,932 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:05:48,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 11:05:49,061 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 151 statements into 2 equivalence classes. [2025-03-17 11:05:49,435 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:05:49,435 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-03-17 11:05:49,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:05:49,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-17 11:05:49,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:05:49,619 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-17 11:05:49,640 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 19 treesize of output 18 [2025-03-17 11:05:49,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:49,702 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 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-17 11:05:49,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:49,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-17 11:05:49,776 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:49,777 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:49,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:49,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 11:05:49,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:05:49,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 44 treesize of output 41 [2025-03-17 11:05:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:49,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:05:54,623 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:05:54,628 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:05:54,630 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 11:05:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:05:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731364544] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:05:54,950 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:05:54,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 15, 12] total 34 [2025-03-17 11:05:54,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555121429] [2025-03-17 11:05:54,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:05:54,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-17 11:05:54,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:05:54,956 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-17 11:05:54,956 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1020, Unknown=1, NotChecked=0, Total=1190 [2025-03-17 11:06:06,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.53s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-17 11:06:11,582 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 240 [2025-03-17 11:06:11,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 399 places, 1078 transitions, 17159 flow. Second operand has 35 states, 35 states have (on average 156.4) internal successors, (5474), 35 states have internal predecessors, (5474), 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-17 11:06:11,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:11,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 240 [2025-03-17 11:06:11,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-17 11:06:17,325 INFO L124 PetriNetUnfolderBase]: 4603/15178 cut-off events. [2025-03-17 11:06:17,325 INFO L125 PetriNetUnfolderBase]: For 121320/122160 co-relation queries the response was YES. [2025-03-17 11:06:17,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67761 conditions, 15178 events. 4603/15178 cut-off events. For 121320/122160 co-relation queries the response was YES. Maximal size of possible extension queue 506. Compared 165393 event pairs, 298 based on Foata normal form. 310/15229 useless extension candidates. Maximal degree in co-relation 67600. Up to 3151 conditions per place. [2025-03-17 11:06:17,435 INFO L140 encePairwiseOnDemand]: 201/240 looper letters, 534 selfloop transitions, 529 changer transitions 1/1253 dead transitions. [2025-03-17 11:06:17,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 419 places, 1253 transitions, 22019 flow [2025-03-17 11:06:17,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 11:06:17,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-17 11:06:17,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 3425 transitions. [2025-03-17 11:06:17,438 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6795634920634921 [2025-03-17 11:06:17,438 INFO L175 Difference]: Start difference. First operand has 399 places, 1078 transitions, 17159 flow. Second operand 21 states and 3425 transitions. [2025-03-17 11:06:17,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 419 places, 1253 transitions, 22019 flow [2025-03-17 11:06:17,940 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1253 transitions, 21938 flow, removed 29 selfloop flow, removed 7 redundant places. [2025-03-17 11:06:17,954 INFO L231 Difference]: Finished difference. Result has 419 places, 1144 transitions, 20196 flow [2025-03-17 11:06:17,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=240, PETRI_DIFFERENCE_MINUEND_FLOW=17114, PETRI_DIFFERENCE_MINUEND_PLACES=392, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1078, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=465, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=563, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=20196, PETRI_PLACES=419, PETRI_TRANSITIONS=1144} [2025-03-17 11:06:17,955 INFO L279 CegarLoopForPetriNet]: 243 programPoint places, 176 predicate places. [2025-03-17 11:06:17,955 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 1144 transitions, 20196 flow [2025-03-17 11:06:17,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 156.4) internal successors, (5474), 35 states have internal predecessors, (5474), 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-17 11:06:17,957 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-17 11:06:17,957 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] [2025-03-17 11:06:17,967 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-17 11:06:18,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-17 11:06:18,158 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr14ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr13ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr12ASSERT_VIOLATIONDATA_RACE (and 27 more)] === [2025-03-17 11:06:18,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 11:06:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1778755507, now seen corresponding path program 7 times [2025-03-17 11:06:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 11:06:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464640379] [2025-03-17 11:06:18,159 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:06:18,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 11:06:18,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:06:18,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:06:18,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:18,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:18,629 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:18,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 11:06:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464640379] [2025-03-17 11:06:18,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464640379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 11:06:18,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884050186] [2025-03-17 11:06:18,630 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-17 11:06:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 11:06:18,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 11:06:18,632 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 11:06:18,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 11:06:18,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-17 11:06:18,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-17 11:06:18,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 11:06:18,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 11:06:18,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-17 11:06:18,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 11:06:18,809 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-17 11:06:18,857 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 11:06:18,857 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-17 11:06:18,902 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 11:06:18,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 11:06:18,911 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 13 treesize of output 9 [2025-03-17 11:06:18,917 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 23 treesize of output 22 [2025-03-17 11:06:18,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:18,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2025-03-17 11:06:18,949 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:18,949 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 3 case distinctions, treesize of input 41 treesize of output 46 [2025-03-17 11:06:18,978 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-17 11:06:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:18,984 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 11:06:19,000 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 7)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store |c_#race| |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 6)) 0))) is different from false [2025-03-17 11:06:19,033 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-17 11:06:19,044 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 6)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_init_#in~p#1.base| v_ArrVal_2480) c_~A~0.base) .cse1) 0))))) is different from false [2025-03-17 11:06:19,063 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (select |c_#race| c_~A~0.base) .cse1 0)))) (and (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 4)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 6)) 0))))) is different from false [2025-03-17 11:06:19,075 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset 6)) (.cse2 (+ c_~A~0.offset 7))) (let ((.cse0 (store |c_#race| c_~A~0.base (store (store (select |c_#race| c_~A~0.base) .cse1 0) .cse2 0)))) (and (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) .cse1) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 5)) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) .cse2) 0)) (forall ((v_ArrVal_2480 (Array Int Int))) (= (select (select (store .cse0 |c_t_funThread1of1ForFork0_~p~0#1.base| v_ArrVal_2480) c_~A~0.base) (+ c_~A~0.offset 4)) 0))))) is different from false [2025-03-17 11:06:21,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:21,103 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 37 treesize of output 53 [2025-03-17 11:06:21,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 11:06:21,111 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 66 treesize of output 36 [2025-03-17 11:06:21,116 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:06:21,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:06:21,124 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:06:21,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:06:21,130 INFO L349 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2025-03-17 11:06:21,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 1 [2025-03-17 11:06:21,268 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 11:06:21,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884050186] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 11:06:21,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 11:06:21,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 20 [2025-03-17 11:06:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74302776] [2025-03-17 11:06:21,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 11:06:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-17 11:06:21,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 11:06:21,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-17 11:06:21,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=195, Unknown=13, NotChecked=160, Total=420 [2025-03-17 11:06:21,435 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 124 out of 240 [2025-03-17 11:06:21,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 1144 transitions, 20196 flow. Second operand has 21 states, 21 states have (on average 129.04761904761904) internal successors, (2710), 21 states have internal predecessors, (2710), 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-17 11:06:21,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-17 11:06:21,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 124 of 240 [2025-03-17 11:06:21,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand