./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 06:46:58,860 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 06:46:58,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2025-03-04 06:46:58,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 06:46:58,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 06:46:58,943 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 06:46:58,943 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 06:46:58,944 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 06:46:58,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 06:46:58,944 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 06:46:58,944 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 06:46:58,944 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 06:46:58,944 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 06:46:58,945 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 06:46:58,945 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 06:46:58,946 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:46:58,946 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 06:46:58,946 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 06:46:58,947 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 06:46:58,948 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 -> b29c7049a333b10d890b8afae901738020ed1f084c2a7d471b316f0abdba3430 [2025-03-04 06:46:59,176 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 06:46:59,181 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 06:46:59,186 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 06:46:59,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 06:46:59,187 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 06:46:59,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 06:47:00,285 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0654b0882/a482c25b0d5b468eb07dd1cc9112d7bf/FLAG64113cb17 [2025-03-04 06:47:00,632 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 06:47:00,633 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_17-arrayloop_nr.i [2025-03-04 06:47:00,653 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0654b0882/a482c25b0d5b468eb07dd1cc9112d7bf/FLAG64113cb17 [2025-03-04 06:47:00,671 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0654b0882/a482c25b0d5b468eb07dd1cc9112d7bf [2025-03-04 06:47:00,673 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 06:47:00,675 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 06:47:00,676 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:00,677 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 06:47:00,680 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 06:47:00,680 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:00" (1/1) ... [2025-03-04 06:47:00,681 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28828d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:00, skipping insertion in model container [2025-03-04 06:47:00,681 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 06:47:00" (1/1) ... [2025-03-04 06:47:00,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 06:47:01,038 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:01,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 06:47:01,111 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 06:47:01,166 INFO L204 MainTranslator]: Completed translation [2025-03-04 06:47:01,167 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01 WrapperNode [2025-03-04 06:47:01,167 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 06:47:01,168 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:01,168 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 06:47:01,169 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 06:47:01,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,196 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,231 INFO L138 Inliner]: procedures = 370, calls = 86, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 283 [2025-03-04 06:47:01,232 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 06:47:01,232 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 06:47:01,232 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 06:47:01,232 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 06:47:01,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,264 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,274 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,275 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,282 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 06:47:01,283 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 06:47:01,283 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 06:47:01,283 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 06:47:01,284 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (1/1) ... [2025-03-04 06:47:01,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 06:47:01,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:01,317 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 06:47:01,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 06:47:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2025-03-04 06:47:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2025-03-04 06:47:01,339 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-03-04 06:47:01,340 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2025-03-04 06:47:01,340 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2025-03-04 06:47:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-03-04 06:47:01,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 06:47:01,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 06:47:01,342 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-03-04 06:47:01,471 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 06:47:01,472 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 06:47:01,887 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-03-04 06:47:01,887 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 06:47:01,910 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 06:47:01,910 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 06:47:01,911 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:01 BoogieIcfgContainer [2025-03-04 06:47:01,911 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 06:47:01,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 06:47:01,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 06:47:01,930 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 06:47:01,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 06:47:00" (1/3) ... [2025-03-04 06:47:01,930 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f6c845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:01, skipping insertion in model container [2025-03-04 06:47:01,930 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 06:47:01" (2/3) ... [2025-03-04 06:47:01,931 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66f6c845 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 06:47:01, skipping insertion in model container [2025-03-04 06:47:01,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 06:47:01" (3/3) ... [2025-03-04 06:47:01,931 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_17-arrayloop_nr.i [2025-03-04 06:47:01,941 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 06:47:01,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_17-arrayloop_nr.i that has 2 procedures, 319 locations, 1 initial locations, 3 loop locations, and 18 error locations. [2025-03-04 06:47:01,942 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-03-04 06:47:02,001 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2025-03-04 06:47:02,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 322 places, 321 transitions, 646 flow [2025-03-04 06:47:02,121 INFO L124 PetriNetUnfolderBase]: 3/320 cut-off events. [2025-03-04 06:47:02,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:02,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 324 conditions, 320 events. 3/320 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 432 event pairs, 0 based on Foata normal form. 0/299 useless extension candidates. Maximal degree in co-relation 199. Up to 2 conditions per place. [2025-03-04 06:47:02,134 INFO L82 GeneralOperation]: Start removeDead. Operand has 322 places, 321 transitions, 646 flow [2025-03-04 06:47:02,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 321 places, 320 transitions, 643 flow [2025-03-04 06:47:02,149 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 06:47:02,158 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;@22535602, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 06:47:02,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2025-03-04 06:47:02,180 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-03-04 06:47:02,180 INFO L124 PetriNetUnfolderBase]: 0/121 cut-off events. [2025-03-04 06:47:02,180 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-03-04 06:47:02,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:02,181 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-04 06:47:02,182 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:02,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:02,186 INFO L85 PathProgramCache]: Analyzing trace with hash 34199624, now seen corresponding path program 1 times [2025-03-04 06:47:02,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:02,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205483989] [2025-03-04 06:47:02,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:02,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:02,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 88 statements into 1 equivalence classes. [2025-03-04 06:47:02,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 88 of 88 statements. [2025-03-04 06:47:02,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:02,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:03,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:03,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:03,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205483989] [2025-03-04 06:47:03,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205483989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:03,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:03,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:03,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318767703] [2025-03-04 06:47:03,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:03,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:03,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:03,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:03,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:03,482 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-03-04 06:47:03,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 321 places, 320 transitions, 643 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:03,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:03,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-03-04 06:47:03,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:04,380 INFO L124 PetriNetUnfolderBase]: 1265/4916 cut-off events. [2025-03-04 06:47:04,381 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-03-04 06:47:04,391 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7460 conditions, 4916 events. 1265/4916 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 36271 event pairs, 912 based on Foata normal form. 0/4506 useless extension candidates. Maximal degree in co-relation 7320. Up to 2359 conditions per place. [2025-03-04 06:47:04,410 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 84 selfloop transitions, 107 changer transitions 0/428 dead transitions. [2025-03-04 06:47:04,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 325 places, 428 transitions, 1241 flow [2025-03-04 06:47:04,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:04,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-03-04 06:47:04,431 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-03-04 06:47:04,432 INFO L175 Difference]: Start difference. First operand has 321 places, 320 transitions, 643 flow. Second operand 6 states and 1621 transitions. [2025-03-04 06:47:04,433 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 325 places, 428 transitions, 1241 flow [2025-03-04 06:47:04,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 324 places, 428 transitions, 1240 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:04,451 INFO L231 Difference]: Finished difference. Result has 329 places, 420 transitions, 1330 flow [2025-03-04 06:47:04,454 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=640, PETRI_DIFFERENCE_MINUEND_PLACES=319, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=319, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=284, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1330, PETRI_PLACES=329, PETRI_TRANSITIONS=420} [2025-03-04 06:47:04,456 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 8 predicate places. [2025-03-04 06:47:04,456 INFO L471 AbstractCegarLoop]: Abstraction has has 329 places, 420 transitions, 1330 flow [2025-03-04 06:47:04,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:04,457 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:04,459 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:04,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 06:47:04,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:04,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:04,460 INFO L85 PathProgramCache]: Analyzing trace with hash -623977462, now seen corresponding path program 1 times [2025-03-04 06:47:04,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:04,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641420348] [2025-03-04 06:47:04,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:04,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:04,479 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-03-04 06:47:04,488 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-03-04 06:47:04,488 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:04,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641420348] [2025-03-04 06:47:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641420348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555304521] [2025-03-04 06:47:04,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:04,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:04,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:05,281 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 238 out of 321 [2025-03-04 06:47:05,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 329 places, 420 transitions, 1330 flow. Second operand has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:05,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:05,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 238 of 321 [2025-03-04 06:47:05,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:05,977 INFO L124 PetriNetUnfolderBase]: 1531/5800 cut-off events. [2025-03-04 06:47:05,977 INFO L125 PetriNetUnfolderBase]: For 1217/1220 co-relation queries the response was YES. [2025-03-04 06:47:05,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10592 conditions, 5800 events. 1531/5800 cut-off events. For 1217/1220 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 44152 event pairs, 936 based on Foata normal form. 0/5357 useless extension candidates. Maximal degree in co-relation 10439. Up to 2637 conditions per place. [2025-03-04 06:47:05,999 INFO L140 encePairwiseOnDemand]: 284/321 looper letters, 180 selfloop transitions, 107 changer transitions 0/528 dead transitions. [2025-03-04 06:47:06,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 333 places, 528 transitions, 2312 flow [2025-03-04 06:47:06,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:06,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:06,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1621 transitions. [2025-03-04 06:47:06,003 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8416407061266874 [2025-03-04 06:47:06,003 INFO L175 Difference]: Start difference. First operand has 329 places, 420 transitions, 1330 flow. Second operand 6 states and 1621 transitions. [2025-03-04 06:47:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 333 places, 528 transitions, 2312 flow [2025-03-04 06:47:06,011 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 333 places, 528 transitions, 2312 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:06,016 INFO L231 Difference]: Finished difference. Result has 338 places, 520 transitions, 2210 flow [2025-03-04 06:47:06,016 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=1328, PETRI_DIFFERENCE_MINUEND_PLACES=328, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=419, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=384, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2210, PETRI_PLACES=338, PETRI_TRANSITIONS=520} [2025-03-04 06:47:06,017 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 17 predicate places. [2025-03-04 06:47:06,017 INFO L471 AbstractCegarLoop]: Abstraction has has 338 places, 520 transitions, 2210 flow [2025-03-04 06:47:06,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 239.33333333333334) internal successors, (1436), 6 states have internal predecessors, (1436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:06,018 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:06,018 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] [2025-03-04 06:47:06,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 06:47:06,018 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:06,019 INFO L85 PathProgramCache]: Analyzing trace with hash -707668766, now seen corresponding path program 1 times [2025-03-04 06:47:06,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621995301] [2025-03-04 06:47:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:06,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-04 06:47:06,034 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-04 06:47:06,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:06,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:06,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:06,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:06,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621995301] [2025-03-04 06:47:06,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621995301] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:06,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:06,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 06:47:06,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109425007] [2025-03-04 06:47:06,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:06,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 06:47:06,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:06,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 06:47:06,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 06:47:06,133 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 307 out of 321 [2025-03-04 06:47:06,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 338 places, 520 transitions, 2210 flow. Second operand has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:06,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:06,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 307 of 321 [2025-03-04 06:47:06,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:06,670 INFO L124 PetriNetUnfolderBase]: 1081/4426 cut-off events. [2025-03-04 06:47:06,671 INFO L125 PetriNetUnfolderBase]: For 1106/1112 co-relation queries the response was YES. [2025-03-04 06:47:06,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8836 conditions, 4426 events. 1081/4426 cut-off events. For 1106/1112 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 28499 event pairs, 108 based on Foata normal form. 4/4184 useless extension candidates. Maximal degree in co-relation 8615. Up to 1137 conditions per place. [2025-03-04 06:47:06,698 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 16 selfloop transitions, 4 changer transitions 0/526 dead transitions. [2025-03-04 06:47:06,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 340 places, 526 transitions, 2262 flow [2025-03-04 06:47:06,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 06:47:06,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-03-04 06:47:06,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 943 transitions. [2025-03-04 06:47:06,703 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9792315680166147 [2025-03-04 06:47:06,703 INFO L175 Difference]: Start difference. First operand has 338 places, 520 transitions, 2210 flow. Second operand 3 states and 943 transitions. [2025-03-04 06:47:06,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 340 places, 526 transitions, 2262 flow [2025-03-04 06:47:06,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 340 places, 526 transitions, 2070 flow, removed 96 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:06,724 INFO L231 Difference]: Finished difference. Result has 341 places, 522 transitions, 2042 flow [2025-03-04 06:47:06,724 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2018, PETRI_DIFFERENCE_MINUEND_PLACES=338, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=520, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=2042, PETRI_PLACES=341, PETRI_TRANSITIONS=522} [2025-03-04 06:47:06,725 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 20 predicate places. [2025-03-04 06:47:06,725 INFO L471 AbstractCegarLoop]: Abstraction has has 341 places, 522 transitions, 2042 flow [2025-03-04 06:47:06,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 309.0) internal successors, (927), 3 states have internal predecessors, (927), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:06,726 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:06,726 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] [2025-03-04 06:47:06,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 06:47:06,727 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:06,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:06,728 INFO L85 PathProgramCache]: Analyzing trace with hash -175300369, now seen corresponding path program 1 times [2025-03-04 06:47:06,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:06,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033412362] [2025-03-04 06:47:06,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:06,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:06,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-04 06:47:06,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-04 06:47:06,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:06,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:07,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:07,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:07,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033412362] [2025-03-04 06:47:07,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033412362] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:07,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:07,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:07,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526180820] [2025-03-04 06:47:07,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:07,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:07,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:07,591 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 230 out of 321 [2025-03-04 06:47:07,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 341 places, 522 transitions, 2042 flow. Second operand has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:07,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:07,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 230 of 321 [2025-03-04 06:47:07,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:08,839 INFO L124 PetriNetUnfolderBase]: 2970/10686 cut-off events. [2025-03-04 06:47:08,840 INFO L125 PetriNetUnfolderBase]: For 6020/6123 co-relation queries the response was YES. [2025-03-04 06:47:08,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23742 conditions, 10686 events. 2970/10686 cut-off events. For 6020/6123 co-relation queries the response was YES. Maximal size of possible extension queue 77. Compared 84582 event pairs, 1872 based on Foata normal form. 0/10145 useless extension candidates. Maximal degree in co-relation 23486. Up to 5591 conditions per place. [2025-03-04 06:47:08,891 INFO L140 encePairwiseOnDemand]: 315/321 looper letters, 285 selfloop transitions, 5 changer transitions 0/521 dead transitions. [2025-03-04 06:47:08,891 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 345 places, 521 transitions, 2620 flow [2025-03-04 06:47:08,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:08,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:08,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1471 transitions. [2025-03-04 06:47:08,894 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7637590861889927 [2025-03-04 06:47:08,894 INFO L175 Difference]: Start difference. First operand has 341 places, 522 transitions, 2042 flow. Second operand 6 states and 1471 transitions. [2025-03-04 06:47:08,894 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 345 places, 521 transitions, 2620 flow [2025-03-04 06:47:08,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 344 places, 521 transitions, 2616 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:08,908 INFO L231 Difference]: Finished difference. Result has 344 places, 521 transitions, 2046 flow [2025-03-04 06:47:08,908 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=516, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2046, PETRI_PLACES=344, PETRI_TRANSITIONS=521} [2025-03-04 06:47:08,909 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 23 predicate places. [2025-03-04 06:47:08,909 INFO L471 AbstractCegarLoop]: Abstraction has has 344 places, 521 transitions, 2046 flow [2025-03-04 06:47:08,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 233.0) internal successors, (1398), 6 states have internal predecessors, (1398), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:08,910 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:08,910 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-04 06:47:08,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-04 06:47:08,910 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:08,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:08,911 INFO L85 PathProgramCache]: Analyzing trace with hash 145570978, now seen corresponding path program 1 times [2025-03-04 06:47:08,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:08,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989415423] [2025-03-04 06:47:08,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:08,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:08,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:47:08,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:47:08,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:08,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:09,059 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:09,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:09,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989415423] [2025-03-04 06:47:09,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989415423] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:09,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1394019728] [2025-03-04 06:47:09,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:09,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:09,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:09,062 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:09,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 06:47:09,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-04 06:47:09,176 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-04 06:47:09,176 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:09,176 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:09,179 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 06:47:09,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:09,345 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:09,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1394019728] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:09,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:09,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-03-04 06:47:09,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302882360] [2025-03-04 06:47:09,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:09,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 06:47:09,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:09,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 06:47:09,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-03-04 06:47:09,614 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:09,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 344 places, 521 transitions, 2046 flow. Second operand has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:09,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:09,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:09,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:10,186 INFO L124 PetriNetUnfolderBase]: 1095/4581 cut-off events. [2025-03-04 06:47:10,187 INFO L125 PetriNetUnfolderBase]: For 683/689 co-relation queries the response was YES. [2025-03-04 06:47:10,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8884 conditions, 4581 events. 1095/4581 cut-off events. For 683/689 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 29283 event pairs, 106 based on Foata normal form. 2/4327 useless extension candidates. Maximal degree in co-relation 8588. Up to 922 conditions per place. [2025-03-04 06:47:10,204 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 22 selfloop transitions, 13 changer transitions 0/536 dead transitions. [2025-03-04 06:47:10,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 352 places, 536 transitions, 2148 flow [2025-03-04 06:47:10,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 06:47:10,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-03-04 06:47:10,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 2764 transitions. [2025-03-04 06:47:10,209 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9567324333679473 [2025-03-04 06:47:10,209 INFO L175 Difference]: Start difference. First operand has 344 places, 521 transitions, 2046 flow. Second operand 9 states and 2764 transitions. [2025-03-04 06:47:10,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 352 places, 536 transitions, 2148 flow [2025-03-04 06:47:10,217 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 536 transitions, 2138 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-03-04 06:47:10,222 INFO L231 Difference]: Finished difference. Result has 350 places, 528 transitions, 2104 flow [2025-03-04 06:47:10,222 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2036, PETRI_DIFFERENCE_MINUEND_PLACES=339, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=2104, PETRI_PLACES=350, PETRI_TRANSITIONS=528} [2025-03-04 06:47:10,225 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 29 predicate places. [2025-03-04 06:47:10,225 INFO L471 AbstractCegarLoop]: Abstraction has has 350 places, 528 transitions, 2104 flow [2025-03-04 06:47:10,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 305.0) internal successors, (3050), 10 states have internal predecessors, (3050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:10,227 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:10,228 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:10,235 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 06:47:10,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:10,439 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:10,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:10,440 INFO L85 PathProgramCache]: Analyzing trace with hash 940868770, now seen corresponding path program 2 times [2025-03-04 06:47:10,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:10,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94655773] [2025-03-04 06:47:10,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:10,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:10,488 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-04 06:47:10,494 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 97 of 220 statements. [2025-03-04 06:47:10,494 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:10,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:10,717 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2025-03-04 06:47:10,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:10,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94655773] [2025-03-04 06:47:10,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94655773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:10,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:10,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:10,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20557620] [2025-03-04 06:47:10,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:10,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:10,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:10,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:11,041 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-03-04 06:47:11,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 350 places, 528 transitions, 2104 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:11,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:11,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-03-04 06:47:11,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:13,409 INFO L124 PetriNetUnfolderBase]: 3572/12304 cut-off events. [2025-03-04 06:47:13,409 INFO L125 PetriNetUnfolderBase]: For 5280/5362 co-relation queries the response was YES. [2025-03-04 06:47:13,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26818 conditions, 12304 events. 3572/12304 cut-off events. For 5280/5362 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 98000 event pairs, 1616 based on Foata normal form. 0/11548 useless extension candidates. Maximal degree in co-relation 26484. Up to 6064 conditions per place. [2025-03-04 06:47:13,455 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 245 selfloop transitions, 170 changer transitions 0/697 dead transitions. [2025-03-04 06:47:13,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 355 places, 697 transitions, 3412 flow [2025-03-04 06:47:13,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:13,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-03-04 06:47:13,459 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-03-04 06:47:13,459 INFO L175 Difference]: Start difference. First operand has 350 places, 528 transitions, 2104 flow. Second operand 6 states and 1684 transitions. [2025-03-04 06:47:13,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 355 places, 697 transitions, 3412 flow [2025-03-04 06:47:13,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 354 places, 697 transitions, 3402 flow, removed 3 selfloop flow, removed 1 redundant places. [2025-03-04 06:47:13,475 INFO L231 Difference]: Finished difference. Result has 359 places, 689 transitions, 3344 flow [2025-03-04 06:47:13,476 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=2094, PETRI_DIFFERENCE_MINUEND_PLACES=349, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=528, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=466, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=3344, PETRI_PLACES=359, PETRI_TRANSITIONS=689} [2025-03-04 06:47:13,476 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 38 predicate places. [2025-03-04 06:47:13,477 INFO L471 AbstractCegarLoop]: Abstraction has has 359 places, 689 transitions, 3344 flow [2025-03-04 06:47:13,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:13,477 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:13,478 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:13,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 06:47:13,478 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:13,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:13,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1069253030, now seen corresponding path program 1 times [2025-03-04 06:47:13,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:13,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600163768] [2025-03-04 06:47:13,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:13,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:13,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:47:13,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:47:13,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:13,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:13,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600163768] [2025-03-04 06:47:13,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600163768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:13,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1916601646] [2025-03-04 06:47:13,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:13,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:13,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:13,721 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:13,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 06:47:13,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-04 06:47:13,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-04 06:47:13,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:13,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:13,897 INFO L256 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-04 06:47:13,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:14,056 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:14,057 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:14,233 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:14,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1916601646] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:14,233 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:14,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 18 [2025-03-04 06:47:14,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314167258] [2025-03-04 06:47:14,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:14,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-04 06:47:14,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:14,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-04 06:47:14,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-04 06:47:14,531 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:14,536 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 359 places, 689 transitions, 3344 flow. Second operand has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:14,536 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:14,536 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:14,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:15,730 INFO L124 PetriNetUnfolderBase]: 1777/6922 cut-off events. [2025-03-04 06:47:15,731 INFO L125 PetriNetUnfolderBase]: For 3172/3271 co-relation queries the response was YES. [2025-03-04 06:47:15,754 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16027 conditions, 6922 events. 1777/6922 cut-off events. For 3172/3271 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 48034 event pairs, 163 based on Foata normal form. 4/6621 useless extension candidates. Maximal degree in co-relation 15426. Up to 1392 conditions per place. [2025-03-04 06:47:15,773 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 26 selfloop transitions, 25 changer transitions 0/713 dead transitions. [2025-03-04 06:47:15,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 379 places, 713 transitions, 3546 flow [2025-03-04 06:47:15,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-04 06:47:15,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-03-04 06:47:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 6418 transitions. [2025-03-04 06:47:15,783 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.9520842604954755 [2025-03-04 06:47:15,784 INFO L175 Difference]: Start difference. First operand has 359 places, 689 transitions, 3344 flow. Second operand 21 states and 6418 transitions. [2025-03-04 06:47:15,785 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 379 places, 713 transitions, 3546 flow [2025-03-04 06:47:15,813 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 379 places, 713 transitions, 3510 flow, removed 18 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:15,818 INFO L231 Difference]: Finished difference. Result has 384 places, 702 transitions, 3452 flow [2025-03-04 06:47:15,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3308, PETRI_DIFFERENCE_MINUEND_PLACES=359, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=689, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=674, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=3452, PETRI_PLACES=384, PETRI_TRANSITIONS=702} [2025-03-04 06:47:15,820 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 63 predicate places. [2025-03-04 06:47:15,820 INFO L471 AbstractCegarLoop]: Abstraction has has 384 places, 702 transitions, 3452 flow [2025-03-04 06:47:15,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 305.0) internal successors, (5490), 18 states have internal predecessors, (5490), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:15,822 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:15,824 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:15,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 06:47:16,024 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,SelfDestructingSolverStorable6 [2025-03-04 06:47:16,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:16,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:16,030 INFO L85 PathProgramCache]: Analyzing trace with hash -705424986, now seen corresponding path program 2 times [2025-03-04 06:47:16,030 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:16,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-03-04 06:47:16,030 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:16,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:16,076 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 392 statements into 2 equivalence classes. [2025-03-04 06:47:16,081 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 105 of 392 statements. [2025-03-04 06:47:16,081 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:16,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 868 trivial. 0 not checked. [2025-03-04 06:47:16,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:16,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348454040] [2025-03-04 06:47:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348454040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:16,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:16,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 06:47:16,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918245586] [2025-03-04 06:47:16,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 06:47:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:16,287 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 06:47:16,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-04 06:47:16,557 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 321 [2025-03-04 06:47:16,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 384 places, 702 transitions, 3452 flow. Second operand has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:16,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:16,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 321 [2025-03-04 06:47:16,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:19,826 INFO L124 PetriNetUnfolderBase]: 4263/14675 cut-off events. [2025-03-04 06:47:19,826 INFO L125 PetriNetUnfolderBase]: For 10453/10598 co-relation queries the response was YES. [2025-03-04 06:47:19,861 INFO L83 FinitePrefix]: Finished finitePrefix Result has 37006 conditions, 14675 events. 4263/14675 cut-off events. For 10453/10598 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 119037 event pairs, 1677 based on Foata normal form. 0/13875 useless extension candidates. Maximal degree in co-relation 36312. Up to 6897 conditions per place. [2025-03-04 06:47:19,890 INFO L140 encePairwiseOnDemand]: 278/321 looper letters, 395 selfloop transitions, 170 changer transitions 0/871 dead transitions. [2025-03-04 06:47:19,890 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 389 places, 871 transitions, 5360 flow [2025-03-04 06:47:19,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 06:47:19,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-03-04 06:47:19,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1684 transitions. [2025-03-04 06:47:19,893 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8743509865005192 [2025-03-04 06:47:19,893 INFO L175 Difference]: Start difference. First operand has 384 places, 702 transitions, 3452 flow. Second operand 6 states and 1684 transitions. [2025-03-04 06:47:19,893 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 389 places, 871 transitions, 5360 flow [2025-03-04 06:47:19,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 383 places, 871 transitions, 5334 flow, removed 6 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:19,931 INFO L231 Difference]: Finished difference. Result has 388 places, 863 transitions, 4976 flow [2025-03-04 06:47:19,932 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=3426, PETRI_DIFFERENCE_MINUEND_PLACES=378, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=702, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=45, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=640, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=4976, PETRI_PLACES=388, PETRI_TRANSITIONS=863} [2025-03-04 06:47:19,934 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 67 predicate places. [2025-03-04 06:47:19,934 INFO L471 AbstractCegarLoop]: Abstraction has has 388 places, 863 transitions, 4976 flow [2025-03-04 06:47:19,936 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 244.66666666666666) internal successors, (1468), 6 states have internal predecessors, (1468), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:19,936 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:19,936 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:19,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 06:47:19,936 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:19,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:19,937 INFO L85 PathProgramCache]: Analyzing trace with hash 369410306, now seen corresponding path program 1 times [2025-03-04 06:47:19,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:19,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622321335] [2025-03-04 06:47:19,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:19,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:19,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-04 06:47:20,012 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-04 06:47:20,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:20,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:20,498 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:20,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622321335] [2025-03-04 06:47:20,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622321335] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:20,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384269773] [2025-03-04 06:47:20,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 06:47:20,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:20,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:20,501 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:20,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 06:47:20,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 400 statements into 1 equivalence classes. [2025-03-04 06:47:20,782 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 400 of 400 statements. [2025-03-04 06:47:20,782 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 06:47:20,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:20,786 INFO L256 TraceCheckSpWp]: Trace formula consists of 1413 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-03-04 06:47:20,791 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 06:47:21,055 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:21,055 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 06:47:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 868 backedges. 0 proven. 868 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 06:47:21,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384269773] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 06:47:21,488 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 06:47:21,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-03-04 06:47:21,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1389126993] [2025-03-04 06:47:21,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 06:47:21,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-04 06:47:21,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:21,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-04 06:47:21,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2025-03-04 06:47:21,781 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 303 out of 321 [2025-03-04 06:47:21,785 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 863 transitions, 4976 flow. Second operand has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:21,786 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:21,786 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 303 of 321 [2025-03-04 06:47:21,786 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:23,879 INFO L124 PetriNetUnfolderBase]: 2478/9371 cut-off events. [2025-03-04 06:47:23,879 INFO L125 PetriNetUnfolderBase]: For 7419/7565 co-relation queries the response was YES. [2025-03-04 06:47:23,909 INFO L83 FinitePrefix]: Finished finitePrefix Result has 24560 conditions, 9371 events. 2478/9371 cut-off events. For 7419/7565 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 68668 event pairs, 229 based on Foata normal form. 3/9000 useless extension candidates. Maximal degree in co-relation 23696. Up to 2110 conditions per place. [2025-03-04 06:47:23,928 INFO L140 encePairwiseOnDemand]: 312/321 looper letters, 29 selfloop transitions, 34 changer transitions 0/886 dead transitions. [2025-03-04 06:47:23,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 417 places, 886 transitions, 5236 flow [2025-03-04 06:47:23,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-04 06:47:23,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2025-03-04 06:47:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 9156 transitions. [2025-03-04 06:47:23,938 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.950778816199377 [2025-03-04 06:47:23,938 INFO L175 Difference]: Start difference. First operand has 388 places, 863 transitions, 4976 flow. Second operand 30 states and 9156 transitions. [2025-03-04 06:47:23,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 417 places, 886 transitions, 5236 flow [2025-03-04 06:47:23,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 417 places, 886 transitions, 4900 flow, removed 168 selfloop flow, removed 0 redundant places. [2025-03-04 06:47:23,989 INFO L231 Difference]: Finished difference. Result has 421 places, 873 transitions, 4806 flow [2025-03-04 06:47:23,989 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4640, PETRI_DIFFERENCE_MINUEND_PLACES=388, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=863, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=836, PETRI_DIFFERENCE_SUBTRAHEND_STATES=30, PETRI_FLOW=4806, PETRI_PLACES=421, PETRI_TRANSITIONS=873} [2025-03-04 06:47:23,990 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 100 predicate places. [2025-03-04 06:47:23,990 INFO L471 AbstractCegarLoop]: Abstraction has has 421 places, 873 transitions, 4806 flow [2025-03-04 06:47:23,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 305.2173913043478) internal successors, (7020), 23 states have internal predecessors, (7020), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:23,992 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:23,992 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:24,000 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 06:47:24,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:24,193 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:24,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:24,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1826966770, now seen corresponding path program 2 times [2025-03-04 06:47:24,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:24,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332544824] [2025-03-04 06:47:24,196 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 06:47:24,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:24,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 523 statements into 2 equivalence classes. [2025-03-04 06:47:24,254 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-03-04 06:47:24,254 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 06:47:24,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:24,576 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:24,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:24,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332544824] [2025-03-04 06:47:24,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332544824] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:24,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:24,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:24,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638858129] [2025-03-04 06:47:24,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:24,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:24,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:24,577 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:24,577 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:25,364 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:25,366 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 421 places, 873 transitions, 4806 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:25,366 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:25,366 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:25,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:30,291 INFO L124 PetriNetUnfolderBase]: 4877/16068 cut-off events. [2025-03-04 06:47:30,291 INFO L125 PetriNetUnfolderBase]: For 17214/17649 co-relation queries the response was YES. [2025-03-04 06:47:30,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46677 conditions, 16068 events. 4877/16068 cut-off events. For 17214/17649 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 129288 event pairs, 1704 based on Foata normal form. 20/15366 useless extension candidates. Maximal degree in co-relation 45651. Up to 5419 conditions per place. [2025-03-04 06:47:30,384 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 591 selfloop transitions, 145 changer transitions 0/1041 dead transitions. [2025-03-04 06:47:30,385 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 432 places, 1041 transitions, 7260 flow [2025-03-04 06:47:30,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 06:47:30,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2025-03-04 06:47:30,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 3080 transitions. [2025-03-04 06:47:30,389 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7995846313603323 [2025-03-04 06:47:30,389 INFO L175 Difference]: Start difference. First operand has 421 places, 873 transitions, 4806 flow. Second operand 12 states and 3080 transitions. [2025-03-04 06:47:30,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 432 places, 1041 transitions, 7260 flow [2025-03-04 06:47:30,448 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 414 places, 1041 transitions, 7212 flow, removed 5 selfloop flow, removed 18 redundant places. [2025-03-04 06:47:30,457 INFO L231 Difference]: Finished difference. Result has 419 places, 892 transitions, 5384 flow [2025-03-04 06:47:30,457 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=4758, PETRI_DIFFERENCE_MINUEND_PLACES=403, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=873, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=127, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=732, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=5384, PETRI_PLACES=419, PETRI_TRANSITIONS=892} [2025-03-04 06:47:30,458 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 98 predicate places. [2025-03-04 06:47:30,458 INFO L471 AbstractCegarLoop]: Abstraction has has 419 places, 892 transitions, 5384 flow [2025-03-04 06:47:30,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:30,459 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:30,459 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:30,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 06:47:30,459 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:30,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:30,461 INFO L85 PathProgramCache]: Analyzing trace with hash 583886118, now seen corresponding path program 3 times [2025-03-04 06:47:30,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:30,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705059760] [2025-03-04 06:47:30,461 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-04 06:47:30,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:30,520 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 523 statements into 11 equivalence classes. [2025-03-04 06:47:30,527 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 113 of 523 statements. [2025-03-04 06:47:30,527 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-03-04 06:47:30,527 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:31,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:31,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:31,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705059760] [2025-03-04 06:47:31,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705059760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:31,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:31,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:31,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960598017] [2025-03-04 06:47:31,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:31,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:31,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:31,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:31,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:31,734 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:31,735 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 419 places, 892 transitions, 5384 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:31,735 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:31,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:31,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:37,038 INFO L124 PetriNetUnfolderBase]: 5770/18258 cut-off events. [2025-03-04 06:47:37,038 INFO L125 PetriNetUnfolderBase]: For 24548/24746 co-relation queries the response was YES. [2025-03-04 06:47:37,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57797 conditions, 18258 events. 5770/18258 cut-off events. For 24548/24746 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 148398 event pairs, 1608 based on Foata normal form. 82/17663 useless extension candidates. Maximal degree in co-relation 56668. Up to 4534 conditions per place. [2025-03-04 06:47:37,164 INFO L140 encePairwiseOnDemand]: 280/321 looper letters, 868 selfloop transitions, 148 changer transitions 0/1321 dead transitions. [2025-03-04 06:47:37,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 441 places, 1321 transitions, 10834 flow [2025-03-04 06:47:37,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-04 06:47:37,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2025-03-04 06:47:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 5615 transitions. [2025-03-04 06:47:37,169 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7605309494785317 [2025-03-04 06:47:37,169 INFO L175 Difference]: Start difference. First operand has 419 places, 892 transitions, 5384 flow. Second operand 23 states and 5615 transitions. [2025-03-04 06:47:37,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 441 places, 1321 transitions, 10834 flow [2025-03-04 06:47:37,260 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 435 places, 1321 transitions, 10620 flow, removed 1 selfloop flow, removed 6 redundant places. [2025-03-04 06:47:37,271 INFO L231 Difference]: Finished difference. Result has 452 places, 1021 transitions, 7048 flow [2025-03-04 06:47:37,272 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=5268, PETRI_DIFFERENCE_MINUEND_PLACES=413, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=892, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=24, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=786, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=7048, PETRI_PLACES=452, PETRI_TRANSITIONS=1021} [2025-03-04 06:47:37,272 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 131 predicate places. [2025-03-04 06:47:37,272 INFO L471 AbstractCegarLoop]: Abstraction has has 452 places, 1021 transitions, 7048 flow [2025-03-04 06:47:37,273 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:37,273 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:37,273 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:37,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 06:47:37,274 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:37,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:37,275 INFO L85 PathProgramCache]: Analyzing trace with hash -976836340, now seen corresponding path program 4 times [2025-03-04 06:47:37,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:37,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097133558] [2025-03-04 06:47:37,275 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-04 06:47:37,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:37,524 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 523 statements into 2 equivalence classes. [2025-03-04 06:47:37,592 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 455 of 523 statements. [2025-03-04 06:47:37,592 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-04 06:47:37,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:38,920 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1855 trivial. 0 not checked. [2025-03-04 06:47:38,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:38,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097133558] [2025-03-04 06:47:38,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097133558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 06:47:38,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 06:47:38,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 06:47:38,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935881758] [2025-03-04 06:47:38,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 06:47:38,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 06:47:38,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 06:47:38,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 06:47:38,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2025-03-04 06:47:39,626 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 321 [2025-03-04 06:47:39,628 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 452 places, 1021 transitions, 7048 flow. Second operand has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:39,628 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-03-04 06:47:39,628 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 321 [2025-03-04 06:47:39,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-03-04 06:47:45,942 INFO L124 PetriNetUnfolderBase]: 5852/18503 cut-off events. [2025-03-04 06:47:45,942 INFO L125 PetriNetUnfolderBase]: For 34129/34575 co-relation queries the response was YES. [2025-03-04 06:47:46,063 INFO L83 FinitePrefix]: Finished finitePrefix Result has 62796 conditions, 18503 events. 5852/18503 cut-off events. For 34129/34575 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 150536 event pairs, 1708 based on Foata normal form. 50/17821 useless extension candidates. Maximal degree in co-relation 61680. Up to 5461 conditions per place. [2025-03-04 06:47:46,112 INFO L140 encePairwiseOnDemand]: 273/321 looper letters, 661 selfloop transitions, 237 changer transitions 0/1203 dead transitions. [2025-03-04 06:47:46,112 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 464 places, 1203 transitions, 10245 flow [2025-03-04 06:47:46,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 06:47:46,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-03-04 06:47:46,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 3313 transitions. [2025-03-04 06:47:46,115 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7939132518571771 [2025-03-04 06:47:46,115 INFO L175 Difference]: Start difference. First operand has 452 places, 1021 transitions, 7048 flow. Second operand 13 states and 3313 transitions. [2025-03-04 06:47:46,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 464 places, 1203 transitions, 10245 flow [2025-03-04 06:47:46,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 462 places, 1203 transitions, 10133 flow, removed 26 selfloop flow, removed 2 redundant places. [2025-03-04 06:47:46,314 INFO L231 Difference]: Finished difference. Result has 469 places, 1050 transitions, 8209 flow [2025-03-04 06:47:46,315 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=321, PETRI_DIFFERENCE_MINUEND_FLOW=6982, PETRI_DIFFERENCE_MINUEND_PLACES=450, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1021, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=793, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=8209, PETRI_PLACES=469, PETRI_TRANSITIONS=1050} [2025-03-04 06:47:46,316 INFO L279 CegarLoopForPetriNet]: 321 programPoint places, 148 predicate places. [2025-03-04 06:47:46,316 INFO L471 AbstractCegarLoop]: Abstraction has has 469 places, 1050 transitions, 8209 flow [2025-03-04 06:47:46,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 232.0909090909091) internal successors, (2553), 11 states have internal predecessors, (2553), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 06:47:46,321 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-03-04 06:47:46,321 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 06:47:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 06:47:46,321 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (and 22 more)] === [2025-03-04 06:47:46,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 06:47:46,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1870333652, now seen corresponding path program 5 times [2025-03-04 06:47:46,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 06:47:46,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140058024] [2025-03-04 06:47:46,323 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:46,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 06:47:46,375 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 523 statements into 11 equivalence classes. [2025-03-04 06:47:46,676 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 523 of 523 statements. [2025-03-04 06:47:46,676 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-04 06:47:46,676 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 06:47:48,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 19 proven. 152 refuted. 0 times theorem prover too weak. 1684 trivial. 0 not checked. [2025-03-04 06:47:48,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 06:47:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140058024] [2025-03-04 06:47:48,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140058024] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 06:47:48,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288363582] [2025-03-04 06:47:48,490 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-04 06:47:48,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 06:47:48,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 06:47:48,492 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 06:47:48,494 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 06:47:48,761 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 523 statements into 11 equivalence classes.