./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.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 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 17:17:52,366 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 17:17:52,444 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-10-14 17:17:52,450 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 17:17:52,451 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 17:17:52,487 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 17:17:52,488 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 17:17:52,488 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 17:17:52,489 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 17:17:52,492 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 17:17:52,493 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 17:17:52,493 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 17:17:52,494 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 17:17:52,494 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 17:17:52,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 17:17:52,497 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 17:17:52,497 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 17:17:52,497 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 17:17:52,498 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 17:17:52,498 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 17:17:52,498 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 17:17:52,502 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 17:17:52,503 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-10-14 17:17:52,503 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 17:17:52,503 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-14 17:17:52,503 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 17:17:52,504 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 17:17:52,504 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 17:17:52,504 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 17:17:52,504 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 17:17:52,505 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 17:17:52,505 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:17:52,505 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 17:17:52,505 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 17:17:52,506 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 17:17:52,506 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 17:17:52,509 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 17:17:52,509 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 17:17:52,509 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 17:17:52,510 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 17:17:52,510 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 17:17:52,511 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> 6029e5a48177b265da8d69ef0b285080ea9366bff1fe25e3f3180b0cf8b63df5 [2024-10-14 17:17:52,752 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 17:17:52,780 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 17:17:52,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 17:17:52,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 17:17:52,786 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 17:17:52,787 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i [2024-10-14 17:17:54,279 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 17:17:54,556 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 17:17:54,557 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-race-challenges/per-thread-index-bitmask-race-3.i [2024-10-14 17:17:54,582 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c77371a/a7678c31b2f44927a2357d0834b3a983/FLAG40177546e [2024-10-14 17:17:54,600 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c7c77371a/a7678c31b2f44927a2357d0834b3a983 [2024-10-14 17:17:54,602 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 17:17:54,605 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 17:17:54,607 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 17:17:54,607 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 17:17:54,613 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 17:17:54,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:17:54" (1/1) ... [2024-10-14 17:17:54,619 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d2d83e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:54, skipping insertion in model container [2024-10-14 17:17:54,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 05:17:54" (1/1) ... [2024-10-14 17:17:54,709 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 17:17:55,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:17:55,176 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 17:17:55,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 17:17:55,287 INFO L204 MainTranslator]: Completed translation [2024-10-14 17:17:55,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55 WrapperNode [2024-10-14 17:17:55,288 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 17:17:55,289 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 17:17:55,289 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 17:17:55,290 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 17:17:55,297 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,323 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,359 INFO L138 Inliner]: procedures = 277, calls = 22, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 145 [2024-10-14 17:17:55,360 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 17:17:55,360 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 17:17:55,361 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 17:17:55,361 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 17:17:55,373 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,374 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,378 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,380 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,387 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,391 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,396 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,398 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,406 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 17:17:55,410 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 17:17:55,410 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 17:17:55,410 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 17:17:55,411 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (1/1) ... [2024-10-14 17:17:55,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 17:17:55,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 17:17:55,454 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) [2024-10-14 17:17:55,457 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 [2024-10-14 17:17:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 17:17:55,513 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-10-14 17:17:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-10-14 17:17:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-10-14 17:17:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-10-14 17:17:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 17:17:55,514 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 17:17:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-10-14 17:17:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure thread [2024-10-14 17:17:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure thread [2024-10-14 17:17:55,515 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 17:17:55,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 17:17:55,517 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-10-14 17:17:55,681 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 17:17:55,684 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 17:17:55,998 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-10-14 17:17:55,999 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 17:17:56,038 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 17:17:56,040 INFO L314 CfgBuilder]: Removed 2 assume(true) statements. [2024-10-14 17:17:56,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:17:56 BoogieIcfgContainer [2024-10-14 17:17:56,040 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 17:17:56,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 17:17:56,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 17:17:56,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 17:17:56,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 05:17:54" (1/3) ... [2024-10-14 17:17:56,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16067898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:17:56, skipping insertion in model container [2024-10-14 17:17:56,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 05:17:55" (2/3) ... [2024-10-14 17:17:56,051 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16067898 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 05:17:56, skipping insertion in model container [2024-10-14 17:17:56,051 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:17:56" (3/3) ... [2024-10-14 17:17:56,053 INFO L112 eAbstractionObserver]: Analyzing ICFG per-thread-index-bitmask-race-3.i [2024-10-14 17:17:56,077 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 17:17:56,077 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2024-10-14 17:17:56,077 INFO L484 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-10-14 17:17:56,174 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-10-14 17:17:56,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 187 places, 202 transitions, 411 flow [2024-10-14 17:17:56,360 INFO L124 PetriNetUnfolderBase]: 30/300 cut-off events. [2024-10-14 17:17:56,362 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-10-14 17:17:56,369 INFO L83 FinitePrefix]: Finished finitePrefix Result has 305 conditions, 300 events. 30/300 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 606 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 150. Up to 6 conditions per place. [2024-10-14 17:17:56,370 INFO L82 GeneralOperation]: Start removeDead. Operand has 187 places, 202 transitions, 411 flow [2024-10-14 17:17:56,377 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 187 places, 202 transitions, 411 flow [2024-10-14 17:17:56,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 17:17:56,394 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;@7edbb38, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 17:17:56,394 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-10-14 17:17:56,430 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-10-14 17:17:56,430 INFO L124 PetriNetUnfolderBase]: 2/40 cut-off events. [2024-10-14 17:17:56,430 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-10-14 17:17:56,430 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:56,431 INFO L204 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] [2024-10-14 17:17:56,432 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:56,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:56,438 INFO L85 PathProgramCache]: Analyzing trace with hash -431483185, now seen corresponding path program 1 times [2024-10-14 17:17:56,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:56,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626320576] [2024-10-14 17:17:56,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:56,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:56,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:56,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:56,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626320576] [2024-10-14 17:17:56,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626320576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:56,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:56,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:17:56,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595470782] [2024-10-14 17:17:56,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:56,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:17:56,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:56,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:17:56,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:17:56,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 202 [2024-10-14 17:17:56,832 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 202 transitions, 411 flow. Second operand has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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) [2024-10-14 17:17:56,832 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:56,832 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 202 [2024-10-14 17:17:56,833 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:57,005 INFO L124 PetriNetUnfolderBase]: 123/767 cut-off events. [2024-10-14 17:17:57,006 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:17:57,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 911 conditions, 767 events. 123/767 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3844 event pairs, 19 based on Foata normal form. 10/637 useless extension candidates. Maximal degree in co-relation 743. Up to 137 conditions per place. [2024-10-14 17:17:57,018 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 20 selfloop transitions, 2 changer transitions 2/197 dead transitions. [2024-10-14 17:17:57,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 197 transitions, 445 flow [2024-10-14 17:17:57,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:17:57,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:17:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2024-10-14 17:17:57,038 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9108910891089109 [2024-10-14 17:17:57,042 INFO L175 Difference]: Start difference. First operand has 187 places, 202 transitions, 411 flow. Second operand 3 states and 552 transitions. [2024-10-14 17:17:57,043 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 197 transitions, 445 flow [2024-10-14 17:17:57,046 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 197 transitions, 445 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:17:57,052 INFO L231 Difference]: Finished difference. Result has 188 places, 195 transitions, 401 flow [2024-10-14 17:17:57,054 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=186, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=197, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=195, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=401, PETRI_PLACES=188, PETRI_TRANSITIONS=195} [2024-10-14 17:17:57,060 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-14 17:17:57,061 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 195 transitions, 401 flow [2024-10-14 17:17:57,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.33333333333334) internal successors, (529), 3 states have internal predecessors, (529), 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) [2024-10-14 17:17:57,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:57,062 INFO L204 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] [2024-10-14 17:17:57,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 17:17:57,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:57,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:57,065 INFO L85 PathProgramCache]: Analyzing trace with hash -990268438, now seen corresponding path program 1 times [2024-10-14 17:17:57,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:57,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708042426] [2024-10-14 17:17:57,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:57,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:57,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:57,179 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:57,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:57,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708042426] [2024-10-14 17:17:57,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708042426] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:57,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:57,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:17:57,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258741799] [2024-10-14 17:17:57,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:57,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:17:57,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:17:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:17:57,206 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-14 17:17:57,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 195 transitions, 401 flow. Second operand has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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) [2024-10-14 17:17:57,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:57,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-14 17:17:57,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:57,451 INFO L124 PetriNetUnfolderBase]: 208/1002 cut-off events. [2024-10-14 17:17:57,452 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:17:57,455 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1277 conditions, 1002 events. 208/1002 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5568 event pairs, 22 based on Foata normal form. 0/832 useless extension candidates. Maximal degree in co-relation 1232. Up to 158 conditions per place. [2024-10-14 17:17:57,461 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 37 selfloop transitions, 8 changer transitions 0/215 dead transitions. [2024-10-14 17:17:57,462 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 215 transitions, 531 flow [2024-10-14 17:17:57,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:17:57,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:17:57,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-10-14 17:17:57,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-10-14 17:17:57,466 INFO L175 Difference]: Start difference. First operand has 188 places, 195 transitions, 401 flow. Second operand 3 states and 567 transitions. [2024-10-14 17:17:57,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 215 transitions, 531 flow [2024-10-14 17:17:57,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 215 transitions, 527 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:17:57,477 INFO L231 Difference]: Finished difference. Result has 188 places, 203 transitions, 467 flow [2024-10-14 17:17:57,477 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=397, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=195, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=187, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=467, PETRI_PLACES=188, PETRI_TRANSITIONS=203} [2024-10-14 17:17:57,478 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 1 predicate places. [2024-10-14 17:17:57,478 INFO L471 AbstractCegarLoop]: Abstraction has has 188 places, 203 transitions, 467 flow [2024-10-14 17:17:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.0) internal successors, (522), 3 states have internal predecessors, (522), 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) [2024-10-14 17:17:57,479 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:57,479 INFO L204 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] [2024-10-14 17:17:57,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 17:17:57,480 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:57,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:57,480 INFO L85 PathProgramCache]: Analyzing trace with hash 145485350, now seen corresponding path program 1 times [2024-10-14 17:17:57,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:57,481 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743604316] [2024-10-14 17:17:57,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:57,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:57,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:57,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:57,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743604316] [2024-10-14 17:17:57,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743604316] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:57,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:57,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 17:17:57,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285902939] [2024-10-14 17:17:57,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:57,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:17:57,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:57,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:17:57,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:17:57,602 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2024-10-14 17:17:57,603 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 188 places, 203 transitions, 467 flow. Second operand has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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) [2024-10-14 17:17:57,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:57,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2024-10-14 17:17:57,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:57,762 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][199], [185#L1050-18true, 200#(= |#race~datas~0| 0), Black: 193#true, 195#(= |#race~threads_mask~0| 0), 105#L1063-1true, 188#true]) [2024-10-14 17:17:57,763 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:17:57,764 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:57,764 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 17:17:57,764 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:57,791 INFO L124 PetriNetUnfolderBase]: 191/1098 cut-off events. [2024-10-14 17:17:57,791 INFO L125 PetriNetUnfolderBase]: For 37/37 co-relation queries the response was YES. [2024-10-14 17:17:57,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1432 conditions, 1098 events. 191/1098 cut-off events. For 37/37 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 6447 event pairs, 23 based on Foata normal form. 0/932 useless extension candidates. Maximal degree in co-relation 1249. Up to 164 conditions per place. [2024-10-14 17:17:57,802 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 27 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-14 17:17:57,802 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 188 places, 211 transitions, 541 flow [2024-10-14 17:17:57,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:17:57,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:17:57,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 562 transitions. [2024-10-14 17:17:57,805 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9273927392739274 [2024-10-14 17:17:57,805 INFO L175 Difference]: Start difference. First operand has 188 places, 203 transitions, 467 flow. Second operand 3 states and 562 transitions. [2024-10-14 17:17:57,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 188 places, 211 transitions, 541 flow [2024-10-14 17:17:57,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 186 places, 211 transitions, 525 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:17:57,814 INFO L231 Difference]: Finished difference. Result has 187 places, 203 transitions, 461 flow [2024-10-14 17:17:57,814 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=447, PETRI_DIFFERENCE_MINUEND_PLACES=184, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=201, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=461, PETRI_PLACES=187, PETRI_TRANSITIONS=203} [2024-10-14 17:17:57,815 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 0 predicate places. [2024-10-14 17:17:57,816 INFO L471 AbstractCegarLoop]: Abstraction has has 187 places, 203 transitions, 461 flow [2024-10-14 17:17:57,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 178.0) internal successors, (534), 3 states have internal predecessors, (534), 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) [2024-10-14 17:17:57,817 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:57,817 INFO L204 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] [2024-10-14 17:17:57,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 17:17:57,817 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:57,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:57,818 INFO L85 PathProgramCache]: Analyzing trace with hash -568519697, now seen corresponding path program 1 times [2024-10-14 17:17:57,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:57,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028665501] [2024-10-14 17:17:57,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:57,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:57,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:58,030 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:58,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:58,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028665501] [2024-10-14 17:17:58,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028665501] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:58,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:58,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:17:58,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774400872] [2024-10-14 17:17:58,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:58,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:17:58,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:58,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:17:58,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:17:58,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 202 [2024-10-14 17:17:58,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 203 transitions, 461 flow. Second operand has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 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) [2024-10-14 17:17:58,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:58,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 202 [2024-10-14 17:17:58,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:58,298 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][207], [200#(= |#race~datas~0| 0), 185#L1050-18true, Black: 193#true, Black: 198#true, 105#L1063-1true, 202#true, 188#true]) [2024-10-14 17:17:58,299 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-14 17:17:58,299 INFO L297 olderBase$Statistics]: existing Event has 125 ancestors and is cut-off event [2024-10-14 17:17:58,299 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:58,299 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:58,312 INFO L124 PetriNetUnfolderBase]: 187/1046 cut-off events. [2024-10-14 17:17:58,313 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-10-14 17:17:58,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1344 conditions, 1046 events. 187/1046 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 5955 event pairs, 34 based on Foata normal form. 1/863 useless extension candidates. Maximal degree in co-relation 1153. Up to 175 conditions per place. [2024-10-14 17:17:58,320 INFO L140 encePairwiseOnDemand]: 194/202 looper letters, 35 selfloop transitions, 2 changer transitions 5/220 dead transitions. [2024-10-14 17:17:58,320 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 192 places, 220 transitions, 579 flow [2024-10-14 17:17:58,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 17:17:58,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-10-14 17:17:58,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1081 transitions. [2024-10-14 17:17:58,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.891914191419142 [2024-10-14 17:17:58,324 INFO L175 Difference]: Start difference. First operand has 187 places, 203 transitions, 461 flow. Second operand 6 states and 1081 transitions. [2024-10-14 17:17:58,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 192 places, 220 transitions, 579 flow [2024-10-14 17:17:58,326 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 220 transitions, 579 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:17:58,330 INFO L231 Difference]: Finished difference. Result has 196 places, 203 transitions, 479 flow [2024-10-14 17:17:58,331 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=479, PETRI_PLACES=196, PETRI_TRANSITIONS=203} [2024-10-14 17:17:58,333 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-14 17:17:58,333 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 203 transitions, 479 flow [2024-10-14 17:17:58,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 174.4) internal successors, (872), 5 states have internal predecessors, (872), 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) [2024-10-14 17:17:58,334 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:58,334 INFO L204 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] [2024-10-14 17:17:58,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 17:17:58,335 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:58,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:58,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1623711536, now seen corresponding path program 1 times [2024-10-14 17:17:58,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:58,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695057804] [2024-10-14 17:17:58,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:58,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:58,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:58,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695057804] [2024-10-14 17:17:58,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [695057804] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:58,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:58,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:17:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562987385] [2024-10-14 17:17:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:58,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:17:58,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:17:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:17:58,485 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 180 out of 202 [2024-10-14 17:17:58,486 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 203 transitions, 479 flow. Second operand has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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) [2024-10-14 17:17:58,486 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:58,486 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 180 of 202 [2024-10-14 17:17:58,487 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:58,644 INFO L124 PetriNetUnfolderBase]: 169/909 cut-off events. [2024-10-14 17:17:58,644 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2024-10-14 17:17:58,647 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1174 conditions, 909 events. 169/909 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 4708 event pairs, 34 based on Foata normal form. 1/768 useless extension candidates. Maximal degree in co-relation 1102. Up to 157 conditions per place. [2024-10-14 17:17:58,649 INFO L140 encePairwiseOnDemand]: 199/202 looper letters, 24 selfloop transitions, 2 changer transitions 0/211 dead transitions. [2024-10-14 17:17:58,650 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 211 transitions, 547 flow [2024-10-14 17:17:58,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:17:58,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:17:58,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 567 transitions. [2024-10-14 17:17:58,653 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9356435643564357 [2024-10-14 17:17:58,653 INFO L175 Difference]: Start difference. First operand has 196 places, 203 transitions, 479 flow. Second operand 3 states and 567 transitions. [2024-10-14 17:17:58,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 211 transitions, 547 flow [2024-10-14 17:17:58,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 211 transitions, 533 flow, removed 5 selfloop flow, removed 5 redundant places. [2024-10-14 17:17:58,660 INFO L231 Difference]: Finished difference. Result has 191 places, 204 transitions, 477 flow [2024-10-14 17:17:58,660 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=188, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=203, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=201, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=477, PETRI_PLACES=191, PETRI_TRANSITIONS=204} [2024-10-14 17:17:58,661 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 4 predicate places. [2024-10-14 17:17:58,662 INFO L471 AbstractCegarLoop]: Abstraction has has 191 places, 204 transitions, 477 flow [2024-10-14 17:17:58,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 181.33333333333334) internal successors, (544), 3 states have internal predecessors, (544), 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) [2024-10-14 17:17:58,663 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:58,665 INFO L204 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] [2024-10-14 17:17:58,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 17:17:58,665 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:58,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:58,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1532141951, now seen corresponding path program 1 times [2024-10-14 17:17:58,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:58,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189974788] [2024-10-14 17:17:58,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:58,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:58,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:58,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:58,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189974788] [2024-10-14 17:17:58,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189974788] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:58,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:58,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:17:58,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335743487] [2024-10-14 17:17:58,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:58,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:17:58,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:58,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:17:58,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:17:58,847 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-14 17:17:58,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 191 places, 204 transitions, 477 flow. Second operand has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 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) [2024-10-14 17:17:58,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:58,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-14 17:17:58,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:58,972 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [136#L1062-14true, 200#(= |#race~datas~0| 0), Black: 193#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 213#true, Black: 198#true, 217#true, 188#true]) [2024-10-14 17:17:58,973 INFO L294 olderBase$Statistics]: this new event has 130 ancestors and is cut-off event [2024-10-14 17:17:58,973 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:17:58,973 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-14 17:17:58,973 INFO L297 olderBase$Statistics]: existing Event has 129 ancestors and is cut-off event [2024-10-14 17:17:58,991 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [200#(= |#race~datas~0| 0), Black: 193#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 104#L1062-19true, 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 213#true, Black: 198#true, 217#true, 188#true]) [2024-10-14 17:17:58,992 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:17:58,992 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:17:58,992 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:17:58,992 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:17:59,009 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [200#(= |#race~datas~0| 0), Black: 193#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, 138#L1062-25true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 213#true, Black: 198#true, 217#true, 188#true]) [2024-10-14 17:17:59,011 INFO L294 olderBase$Statistics]: this new event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,011 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-14 17:17:59,011 INFO L297 olderBase$Statistics]: existing Event has 134 ancestors and is cut-off event [2024-10-14 17:17:59,011 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,019 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][210], [8#L1062-28true, 200#(= |#race~datas~0| 0), Black: 193#true, Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 213#true, Black: 198#true, 217#true, 188#true]) [2024-10-14 17:17:59,019 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,019 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,020 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,020 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,102 INFO L124 PetriNetUnfolderBase]: 398/1653 cut-off events. [2024-10-14 17:17:59,103 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-10-14 17:17:59,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2357 conditions, 1653 events. 398/1653 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 11380 event pairs, 58 based on Foata normal form. 1/1452 useless extension candidates. Maximal degree in co-relation 2207. Up to 231 conditions per place. [2024-10-14 17:17:59,140 INFO L140 encePairwiseOnDemand]: 190/202 looper letters, 52 selfloop transitions, 12 changer transitions 0/239 dead transitions. [2024-10-14 17:17:59,140 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 239 transitions, 677 flow [2024-10-14 17:17:59,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:17:59,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 17:17:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 745 transitions. [2024-10-14 17:17:59,142 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9220297029702971 [2024-10-14 17:17:59,142 INFO L175 Difference]: Start difference. First operand has 191 places, 204 transitions, 477 flow. Second operand 4 states and 745 transitions. [2024-10-14 17:17:59,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 239 transitions, 677 flow [2024-10-14 17:17:59,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 239 transitions, 675 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:17:59,148 INFO L231 Difference]: Finished difference. Result has 196 places, 214 transitions, 567 flow [2024-10-14 17:17:59,148 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=475, PETRI_DIFFERENCE_MINUEND_PLACES=190, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=204, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=193, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=567, PETRI_PLACES=196, PETRI_TRANSITIONS=214} [2024-10-14 17:17:59,151 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 9 predicate places. [2024-10-14 17:17:59,151 INFO L471 AbstractCegarLoop]: Abstraction has has 196 places, 214 transitions, 567 flow [2024-10-14 17:17:59,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.25) internal successors, (689), 4 states have internal predecessors, (689), 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) [2024-10-14 17:17:59,152 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:59,152 INFO L204 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] [2024-10-14 17:17:59,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 17:17:59,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:59,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:59,153 INFO L85 PathProgramCache]: Analyzing trace with hash 658436917, now seen corresponding path program 1 times [2024-10-14 17:17:59,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:59,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085228320] [2024-10-14 17:17:59,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:59,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:59,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:59,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:59,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:59,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085228320] [2024-10-14 17:17:59,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085228320] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:59,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:59,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:17:59,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1150683013] [2024-10-14 17:17:59,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:59,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:17:59,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:59,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:17:59,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:17:59,309 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-14 17:17:59,310 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 214 transitions, 567 flow. Second operand has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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) [2024-10-14 17:17:59,310 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:59,310 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-14 17:17:59,311 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:59,491 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][188], [200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), Black: 193#true, 224#true, 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), Black: 198#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 217#true, Black: 219#(not (= ~threads_mask~0 0)), 188#true, 119#L1063-10true]) [2024-10-14 17:17:59,492 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-14 17:17:59,492 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-14 17:17:59,492 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:17:59,492 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:17:59,555 INFO L124 PetriNetUnfolderBase]: 408/1621 cut-off events. [2024-10-14 17:17:59,555 INFO L125 PetriNetUnfolderBase]: For 477/591 co-relation queries the response was YES. [2024-10-14 17:17:59,561 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2705 conditions, 1621 events. 408/1621 cut-off events. For 477/591 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 10997 event pairs, 55 based on Foata normal form. 23/1451 useless extension candidates. Maximal degree in co-relation 2500. Up to 245 conditions per place. [2024-10-14 17:17:59,569 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 52 selfloop transitions, 13 changer transitions 0/240 dead transitions. [2024-10-14 17:17:59,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 240 transitions, 763 flow [2024-10-14 17:17:59,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:17:59,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 17:17:59,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 743 transitions. [2024-10-14 17:17:59,571 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9195544554455446 [2024-10-14 17:17:59,572 INFO L175 Difference]: Start difference. First operand has 196 places, 214 transitions, 567 flow. Second operand 4 states and 743 transitions. [2024-10-14 17:17:59,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 240 transitions, 763 flow [2024-10-14 17:17:59,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 240 transitions, 763 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-10-14 17:17:59,579 INFO L231 Difference]: Finished difference. Result has 201 places, 217 transitions, 626 flow [2024-10-14 17:17:59,580 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=196, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=214, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=202, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=626, PETRI_PLACES=201, PETRI_TRANSITIONS=217} [2024-10-14 17:17:59,581 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 14 predicate places. [2024-10-14 17:17:59,581 INFO L471 AbstractCegarLoop]: Abstraction has has 201 places, 217 transitions, 626 flow [2024-10-14 17:17:59,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.5) internal successors, (690), 4 states have internal predecessors, (690), 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) [2024-10-14 17:17:59,582 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:17:59,582 INFO L204 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] [2024-10-14 17:17:59,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 17:17:59,582 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:17:59,583 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:17:59,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1764724741, now seen corresponding path program 1 times [2024-10-14 17:17:59,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:17:59,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233229787] [2024-10-14 17:17:59,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:17:59,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:17:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:17:59,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:17:59,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:17:59,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233229787] [2024-10-14 17:17:59,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233229787] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:17:59,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:17:59,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:17:59,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801025566] [2024-10-14 17:17:59,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:17:59,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:17:59,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:17:59,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:17:59,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:17:59,751 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 202 [2024-10-14 17:17:59,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 217 transitions, 626 flow. Second operand has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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) [2024-10-14 17:17:59,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:17:59,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 202 [2024-10-14 17:17:59,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:17:59,960 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][213], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 138#L1062-25true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:17:59,961 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,961 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,961 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,961 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,962 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][214], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 138#L1062-25true, 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:17:59,962 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,963 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,963 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,963 INFO L297 olderBase$Statistics]: existing Event has 135 ancestors and is cut-off event [2024-10-14 17:17:59,973 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][214], [8#L1062-28true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:17:59,974 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-14 17:17:59,974 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,974 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:17:59,975 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:17:59,977 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][213], [8#L1062-28true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-14 17:17:59,977 INFO L294 olderBase$Statistics]: this new event has 136 ancestors and is not cut-off event [2024-10-14 17:17:59,977 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is not cut-off event [2024-10-14 17:17:59,978 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:17:59,978 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is not cut-off event [2024-10-14 17:18:00,006 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 119#L1063-10true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-14 17:18:00,006 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is not cut-off event [2024-10-14 17:18:00,008 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:18:00,008 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:18:00,008 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is not cut-off event [2024-10-14 17:18:00,014 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][187], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 37#L1062-37true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,014 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,015 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,015 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:18:00,015 INFO L297 olderBase$Statistics]: existing Event has 141 ancestors and is cut-off event [2024-10-14 17:18:00,020 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][225], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, 37#L1062-37true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-14 17:18:00,021 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-14 17:18:00,021 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,021 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,021 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:18:00,036 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][225], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), 37#L1062-37true, Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), 224#true, Black: 198#true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), 188#true, Black: 219#(not (= ~threads_mask~0 0))]) [2024-10-14 17:18:00,037 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-10-14 17:18:00,037 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,037 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is cut-off event [2024-10-14 17:18:00,037 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:18:00,037 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-10-14 17:18:00,083 INFO L124 PetriNetUnfolderBase]: 502/1908 cut-off events. [2024-10-14 17:18:00,083 INFO L125 PetriNetUnfolderBase]: For 1151/1279 co-relation queries the response was YES. [2024-10-14 17:18:00,089 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3578 conditions, 1908 events. 502/1908 cut-off events. For 1151/1279 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 13915 event pairs, 61 based on Foata normal form. 34/1729 useless extension candidates. Maximal degree in co-relation 3329. Up to 352 conditions per place. [2024-10-14 17:18:00,097 INFO L140 encePairwiseOnDemand]: 191/202 looper letters, 49 selfloop transitions, 16 changer transitions 0/243 dead transitions. [2024-10-14 17:18:00,098 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 204 places, 243 transitions, 833 flow [2024-10-14 17:18:00,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:18:00,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 17:18:00,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 741 transitions. [2024-10-14 17:18:00,100 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9170792079207921 [2024-10-14 17:18:00,100 INFO L175 Difference]: Start difference. First operand has 201 places, 217 transitions, 626 flow. Second operand 4 states and 741 transitions. [2024-10-14 17:18:00,100 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 204 places, 243 transitions, 833 flow [2024-10-14 17:18:00,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 203 places, 243 transitions, 817 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-10-14 17:18:00,107 INFO L231 Difference]: Finished difference. Result has 205 places, 222 transitions, 697 flow [2024-10-14 17:18:00,108 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=613, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=217, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=204, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=697, PETRI_PLACES=205, PETRI_TRANSITIONS=222} [2024-10-14 17:18:00,109 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-14 17:18:00,109 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 222 transitions, 697 flow [2024-10-14 17:18:00,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 172.75) internal successors, (691), 4 states have internal predecessors, (691), 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) [2024-10-14 17:18:00,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:00,109 INFO L204 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] [2024-10-14 17:18:00,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 17:18:00,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:18:00,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:00,110 INFO L85 PathProgramCache]: Analyzing trace with hash 187662975, now seen corresponding path program 1 times [2024-10-14 17:18:00,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:00,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157614087] [2024-10-14 17:18:00,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:00,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:00,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:00,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157614087] [2024-10-14 17:18:00,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157614087] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:00,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:00,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 17:18:00,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154367756] [2024-10-14 17:18:00,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:00,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 17:18:00,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:00,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 17:18:00,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 17:18:00,187 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 177 out of 202 [2024-10-14 17:18:00,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 222 transitions, 697 flow. Second operand has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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) [2024-10-14 17:18:00,189 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:00,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 177 of 202 [2024-10-14 17:18:00,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:00,267 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][195], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 31#L1062-11true, 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,267 INFO L294 olderBase$Statistics]: this new event has 131 ancestors and is cut-off event [2024-10-14 17:18:00,267 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:18:00,267 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:18:00,268 INFO L297 olderBase$Statistics]: existing Event has 130 ancestors and is cut-off event [2024-10-14 17:18:00,268 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][195], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 136#L1062-14true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,268 INFO L294 olderBase$Statistics]: this new event has 132 ancestors and is cut-off event [2024-10-14 17:18:00,268 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:18:00,268 INFO L297 olderBase$Statistics]: existing Event has 132 ancestors and is cut-off event [2024-10-14 17:18:00,268 INFO L297 olderBase$Statistics]: existing Event has 131 ancestors and is cut-off event [2024-10-14 17:18:00,312 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][202], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, 138#L1062-25true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,312 INFO L294 olderBase$Statistics]: this new event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L297 olderBase$Statistics]: existing Event has 136 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][202], [8#L1062-28true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 238#(<= |ULTIMATE.start_main_#t~nondet15#1| 32), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,313 INFO L294 olderBase$Statistics]: this new event has 138 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-14 17:18:00,313 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,314 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,333 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][176], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 119#L1063-10true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,334 INFO L294 olderBase$Statistics]: this new event has 139 ancestors and is not cut-off event [2024-10-14 17:18:00,334 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2024-10-14 17:18:00,334 INFO L297 olderBase$Statistics]: existing Event has 140 ancestors and is not cut-off event [2024-10-14 17:18:00,334 INFO L297 olderBase$Statistics]: existing Event has 139 ancestors and is not cut-off event [2024-10-14 17:18:00,350 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([541] L1050-15-->L1050-16: Formula: (= |v_threadThread1of1ForFork0_#t~bitwise7_3| v_~threads_mask~0_27) InVars {threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} OutVars{~threads_mask~0=v_~threads_mask~0_27, threadThread1of1ForFork0_#t~bitwise7=|v_threadThread1of1ForFork0_#t~bitwise7_3|} AuxVars[] AssignedVars[~threads_mask~0][171], [Black: 193#true, Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 125#L1063-16true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 39#L1050-16true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,351 INFO L294 olderBase$Statistics]: this new event has 142 ancestors and is not cut-off event [2024-10-14 17:18:00,351 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-10-14 17:18:00,351 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-14 17:18:00,351 INFO L297 olderBase$Statistics]: existing Event has 142 ancestors and is not cut-off event [2024-10-14 17:18:00,354 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([551] L1051-->L1051-3: Formula: (and (= |v_threadThread1of1ForFork0_#t~ret9_1| 0) (= |v_#pthreadsMutex_29| (store |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21| (store (select |v_#pthreadsMutex_30| |v_~#threads_mask_mutex~0.base_21|) |v_~#threads_mask_mutex~0.offset_21| 0)))) InVars {#pthreadsMutex=|v_#pthreadsMutex_30|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|} OutVars{#pthreadsMutex=|v_#pthreadsMutex_29|, ~#threads_mask_mutex~0.base=|v_~#threads_mask_mutex~0.base_21|, ~#threads_mask_mutex~0.offset=|v_~#threads_mask_mutex~0.offset_21|, threadThread1of1ForFork0_#t~ret9=|v_threadThread1of1ForFork0_#t~ret9_1|} AuxVars[] AssignedVars[#pthreadsMutex, threadThread1of1ForFork0_#t~ret9][187], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 226#(not (= ~threads_mask~0 0)), Black: 195#(= |#race~threads_mask~0| 0), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 217#true, 147#L1051-3true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 236#true, 12#L1062-36true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,354 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-14 17:18:00,354 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-14 17:18:00,354 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,354 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,370 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([327] L1063-->L1063-1: Formula: (= |v_#race~threads_mask~0_4| 0) InVars {} OutVars{#race~threads_mask~0=|v_#race~threads_mask~0_4|} AuxVars[] AssignedVars[#race~threads_mask~0][203], [Black: 227#(and (not (= ~threads_mask~0 0)) (= |ULTIMATE.start_main_#t~bitwise16#1| 1)), Black: 193#true, Black: 226#(not (= ~threads_mask~0 0)), Black: 198#true, Black: 233#(and (not (= ~threads_mask~0 0)) (<= (+ 2 |ULTIMATE.start_main_#t~bitwise18#1|) 0)), Black: 232#(not (= ~threads_mask~0 0)), 105#L1063-1true, 217#true, 200#(= |#race~datas~0| 0), Black: 204#(= |ULTIMATE.start_main_~i~0#1| 0), 185#L1050-18true, 236#true, Black: 215#(<= (+ ~threads_mask~0 1) 0), 230#true, Black: 220#(and (<= 2 |ULTIMATE.start_main_#t~bitwise16#1|) (not (= ~threads_mask~0 0))), Black: 219#(not (= ~threads_mask~0 0)), 188#true]) [2024-10-14 17:18:00,371 INFO L294 olderBase$Statistics]: this new event has 149 ancestors and is cut-off event [2024-10-14 17:18:00,374 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,374 INFO L297 olderBase$Statistics]: existing Event has 137 ancestors and is cut-off event [2024-10-14 17:18:00,374 INFO L297 olderBase$Statistics]: existing Event has 138 ancestors and is cut-off event [2024-10-14 17:18:00,396 INFO L124 PetriNetUnfolderBase]: 347/1597 cut-off events. [2024-10-14 17:18:00,396 INFO L125 PetriNetUnfolderBase]: For 945/962 co-relation queries the response was YES. [2024-10-14 17:18:00,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2848 conditions, 1597 events. 347/1597 cut-off events. For 945/962 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 11233 event pairs, 47 based on Foata normal form. 27/1437 useless extension candidates. Maximal degree in co-relation 2639. Up to 164 conditions per place. [2024-10-14 17:18:00,407 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 23 selfloop transitions, 3 changer transitions 0/224 dead transitions. [2024-10-14 17:18:00,408 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 224 transitions, 753 flow [2024-10-14 17:18:00,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 17:18:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-10-14 17:18:00,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2024-10-14 17:18:00,410 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9174917491749175 [2024-10-14 17:18:00,410 INFO L175 Difference]: Start difference. First operand has 205 places, 222 transitions, 697 flow. Second operand 3 states and 556 transitions. [2024-10-14 17:18:00,410 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 224 transitions, 753 flow [2024-10-14 17:18:00,414 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 205 places, 224 transitions, 739 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-10-14 17:18:00,417 INFO L231 Difference]: Finished difference. Result has 205 places, 220 transitions, 685 flow [2024-10-14 17:18:00,417 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=685, PETRI_PLACES=205, PETRI_TRANSITIONS=220} [2024-10-14 17:18:00,419 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 18 predicate places. [2024-10-14 17:18:00,419 INFO L471 AbstractCegarLoop]: Abstraction has has 205 places, 220 transitions, 685 flow [2024-10-14 17:18:00,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.66666666666666) internal successors, (539), 3 states have internal predecessors, (539), 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) [2024-10-14 17:18:00,420 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:00,420 INFO L204 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] [2024-10-14 17:18:00,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 17:18:00,420 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:18:00,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:00,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1585036983, now seen corresponding path program 1 times [2024-10-14 17:18:00,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:00,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18297485] [2024-10-14 17:18:00,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:00,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:00,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:00,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:00,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18297485] [2024-10-14 17:18:00,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18297485] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:00,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:00,529 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 17:18:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93386024] [2024-10-14 17:18:00,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:00,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 17:18:00,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:00,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 17:18:00,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 17:18:00,590 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 174 out of 202 [2024-10-14 17:18:00,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 220 transitions, 685 flow. Second operand has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 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) [2024-10-14 17:18:00,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:00,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 174 of 202 [2024-10-14 17:18:00,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:00,867 INFO L124 PetriNetUnfolderBase]: 377/1682 cut-off events. [2024-10-14 17:18:00,867 INFO L125 PetriNetUnfolderBase]: For 1512/1560 co-relation queries the response was YES. [2024-10-14 17:18:00,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3170 conditions, 1682 events. 377/1682 cut-off events. For 1512/1560 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 12174 event pairs, 78 based on Foata normal form. 5/1516 useless extension candidates. Maximal degree in co-relation 2964. Up to 407 conditions per place. [2024-10-14 17:18:00,877 INFO L140 encePairwiseOnDemand]: 195/202 looper letters, 42 selfloop transitions, 9 changer transitions 0/237 dead transitions. [2024-10-14 17:18:00,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 208 places, 237 transitions, 859 flow [2024-10-14 17:18:00,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 17:18:00,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-10-14 17:18:00,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 735 transitions. [2024-10-14 17:18:00,880 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9096534653465347 [2024-10-14 17:18:00,880 INFO L175 Difference]: Start difference. First operand has 205 places, 220 transitions, 685 flow. Second operand 4 states and 735 transitions. [2024-10-14 17:18:00,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 208 places, 237 transitions, 859 flow [2024-10-14 17:18:00,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 237 transitions, 853 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-10-14 17:18:00,887 INFO L231 Difference]: Finished difference. Result has 208 places, 226 transitions, 766 flow [2024-10-14 17:18:00,887 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=679, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=220, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=211, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=766, PETRI_PLACES=208, PETRI_TRANSITIONS=226} [2024-10-14 17:18:00,888 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, 21 predicate places. [2024-10-14 17:18:00,888 INFO L471 AbstractCegarLoop]: Abstraction has has 208 places, 226 transitions, 766 flow [2024-10-14 17:18:00,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 176.5) internal successors, (706), 4 states have internal predecessors, (706), 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) [2024-10-14 17:18:00,889 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-10-14 17:18:00,889 INFO L204 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] [2024-10-14 17:18:00,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 17:18:00,889 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (and 13 more)] === [2024-10-14 17:18:00,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 17:18:00,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1358702458, now seen corresponding path program 1 times [2024-10-14 17:18:00,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 17:18:00,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391414911] [2024-10-14 17:18:00,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 17:18:00,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 17:18:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 17:18:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 17:18:00,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 17:18:00,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391414911] [2024-10-14 17:18:00,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391414911] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 17:18:00,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 17:18:00,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 17:18:00,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261145170] [2024-10-14 17:18:00,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 17:18:01,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 17:18:01,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 17:18:01,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 17:18:01,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-14 17:18:01,101 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 171 out of 202 [2024-10-14 17:18:01,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 208 places, 226 transitions, 766 flow. Second operand has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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) [2024-10-14 17:18:01,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-10-14 17:18:01,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 171 of 202 [2024-10-14 17:18:01,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-10-14 17:18:01,126 INFO L124 PetriNetUnfolderBase]: 2/73 cut-off events. [2024-10-14 17:18:01,127 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-10-14 17:18:01,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 125 conditions, 73 events. 2/73 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 32 event pairs, 0 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 108. Up to 6 conditions per place. [2024-10-14 17:18:01,127 INFO L140 encePairwiseOnDemand]: 198/202 looper letters, 0 selfloop transitions, 0 changer transitions 62/62 dead transitions. [2024-10-14 17:18:01,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 62 transitions, 178 flow [2024-10-14 17:18:01,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 17:18:01,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-10-14 17:18:01,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 863 transitions. [2024-10-14 17:18:01,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8544554455445544 [2024-10-14 17:18:01,129 INFO L175 Difference]: Start difference. First operand has 208 places, 226 transitions, 766 flow. Second operand 5 states and 863 transitions. [2024-10-14 17:18:01,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 62 transitions, 178 flow [2024-10-14 17:18:01,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 62 transitions, 143 flow, removed 4 selfloop flow, removed 19 redundant places. [2024-10-14 17:18:01,130 INFO L231 Difference]: Finished difference. Result has 72 places, 0 transitions, 0 flow [2024-10-14 17:18:01,131 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=202, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=0, PETRI_PLACES=72, PETRI_TRANSITIONS=0} [2024-10-14 17:18:01,131 INFO L277 CegarLoopForPetriNet]: 187 programPoint places, -115 predicate places. [2024-10-14 17:18:01,131 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 0 transitions, 0 flow [2024-10-14 17:18:01,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 173.2) internal successors, (866), 5 states have internal predecessors, (866), 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) [2024-10-14 17:18:01,134 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (15 of 16 remaining) [2024-10-14 17:18:01,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (14 of 16 remaining) [2024-10-14 17:18:01,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (13 of 16 remaining) [2024-10-14 17:18:01,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (12 of 16 remaining) [2024-10-14 17:18:01,135 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (11 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (10 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (9 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (8 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (7 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (6 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (5 of 16 remaining) [2024-10-14 17:18:01,136 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (4 of 16 remaining) [2024-10-14 17:18:01,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr0ASSERT_VIOLATIONDATA_RACE (3 of 16 remaining) [2024-10-14 17:18:01,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr1ASSERT_VIOLATIONDATA_RACE (2 of 16 remaining) [2024-10-14 17:18:01,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr2ASSERT_VIOLATIONDATA_RACE (1 of 16 remaining) [2024-10-14 17:18:01,137 INFO L782 garLoopResultBuilder]: Registering result SAFE for location threadErr3ASSERT_VIOLATIONDATA_RACE (0 of 16 remaining) [2024-10-14 17:18:01,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 17:18:01,138 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 17:18:01,143 INFO L234 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-10-14 17:18:01,143 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 17:18:01,148 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 05:18:01 BasicIcfg [2024-10-14 17:18:01,148 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 17:18:01,148 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 17:18:01,148 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 17:18:01,148 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 17:18:01,149 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 05:17:56" (3/4) ... [2024-10-14 17:18:01,150 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-14 17:18:01,153 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure thread [2024-10-14 17:18:01,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-10-14 17:18:01,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:18:01,159 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-14 17:18:01,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-14 17:18:01,248 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-14 17:18:01,248 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 17:18:01,249 INFO L158 Benchmark]: Toolchain (without parser) took 6643.79ms. Allocated memory was 161.5MB in the beginning and 281.0MB in the end (delta: 119.5MB). Free memory was 93.2MB in the beginning and 170.8MB in the end (delta: -77.6MB). Peak memory consumption was 44.7MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,249 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 17:18:01,249 INFO L158 Benchmark]: CACSL2BoogieTranslator took 681.75ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 106.0MB in the end (delta: -13.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,249 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.62ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,250 INFO L158 Benchmark]: Boogie Preprocessor took 48.60ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 101.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,250 INFO L158 Benchmark]: RCFGBuilder took 630.86ms. Allocated memory is still 161.5MB. Free memory was 101.0MB in the beginning and 75.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,250 INFO L158 Benchmark]: TraceAbstraction took 5104.01ms. Allocated memory was 161.5MB in the beginning and 281.0MB in the end (delta: 119.5MB). Free memory was 74.6MB in the beginning and 175.0MB in the end (delta: -100.4MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,250 INFO L158 Benchmark]: Witness Printer took 99.99ms. Allocated memory is still 281.0MB. Free memory was 175.0MB in the beginning and 170.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 17:18:01,251 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 161.5MB. Free memory is still 123.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 681.75ms. Allocated memory is still 161.5MB. Free memory was 92.9MB in the beginning and 106.0MB in the end (delta: -13.1MB). Peak memory consumption was 7.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.62ms. Allocated memory is still 161.5MB. Free memory was 106.0MB in the beginning and 103.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.60ms. Allocated memory is still 161.5MB. Free memory was 103.1MB in the beginning and 101.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 630.86ms. Allocated memory is still 161.5MB. Free memory was 101.0MB in the beginning and 75.3MB in the end (delta: 25.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 5104.01ms. Allocated memory was 161.5MB in the beginning and 281.0MB in the end (delta: 119.5MB). Free memory was 74.6MB in the beginning and 175.0MB in the end (delta: -100.4MB). Peak memory consumption was 20.9MB. Max. memory is 16.1GB. * Witness Printer took 99.99ms. Allocated memory is still 281.0MB. Free memory was 175.0MB in the beginning and 170.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1059]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1062]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1071]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1068]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1063]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1063]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1065]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1048]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1048]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1050]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 1050]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 228 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 4.9s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.2s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 430 mSDsluCounter, 219 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 103 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1095 IncrementalHoareTripleChecker+Invalid, 1138 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 116 mSDtfsCounter, 1095 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=766occurred in iteration=10, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 687 NumberOfCodeBlocks, 687 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 676 ConstructedInterpolants, 0 QuantifiedInterpolants, 1406 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 11 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-10-14 17:18:01,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE