./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 06:51:03,818 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 06:51:03,887 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-09 06:51:03,891 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 06:51:03,891 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 06:51:03,912 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 06:51:03,913 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 06:51:03,914 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 06:51:03,914 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 06:51:03,915 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 06:51:03,916 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 06:51:03,916 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 06:51:03,916 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 06:51:03,917 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 06:51:03,917 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 06:51:03,918 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 06:51:03,918 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 06:51:03,919 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 06:51:03,919 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 06:51:03,919 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 06:51:03,920 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 06:51:03,925 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 06:51:03,926 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-09 06:51:03,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 06:51:03,926 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 06:51:03,927 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 06:51:03,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 06:51:03,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 06:51:03,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 06:51:03,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 06:51:03,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 06:51:03,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:51:03,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 06:51:03,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 06:51:03,930 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 06:51:03,930 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 06:51:03,930 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 06:51:03,931 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 06:51:03,931 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 06:51:03,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 06:51:03,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 06:51:03,936 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 -> 91e4ed4bfe1f39ec65b13c41c6a7b6461aa954e8b5b654b0aa1c967848462a4b [2024-11-09 06:51:04,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 06:51:04,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 06:51:04,275 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 06:51:04,277 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 06:51:04,278 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 06:51:04,279 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2024-11-09 06:51:05,769 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 06:51:06,089 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 06:51:06,090 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/04-mutex_37-indirect_rc.i [2024-11-09 06:51:06,111 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2c33e51/92c10cee7d4b4c79886f3a695583c0c0/FLAGcbf324c75 [2024-11-09 06:51:06,128 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6b2c33e51/92c10cee7d4b4c79886f3a695583c0c0 [2024-11-09 06:51:06,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 06:51:06,134 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 06:51:06,136 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 06:51:06,137 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 06:51:06,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 06:51:06,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,146 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f8a0910 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06, skipping insertion in model container [2024-11-09 06:51:06,146 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,185 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 06:51:06,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:51:06,585 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 06:51:06,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 06:51:06,670 INFO L204 MainTranslator]: Completed translation [2024-11-09 06:51:06,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06 WrapperNode [2024-11-09 06:51:06,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 06:51:06,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 06:51:06,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 06:51:06,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 06:51:06,679 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,692 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,715 INFO L138 Inliner]: procedures = 162, calls = 17, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 58 [2024-11-09 06:51:06,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 06:51:06,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 06:51:06,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 06:51:06,717 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 06:51:06,724 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,728 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,728 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,743 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 06:51:06,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 06:51:06,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 06:51:06,752 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 06:51:06,753 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (1/1) ... [2024-11-09 06:51:06,759 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 06:51:06,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 06:51:06,796 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-11-09 06:51:06,803 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-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-09 06:51:06,839 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-09 06:51:06,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 06:51:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-09 06:51:06,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 06:51:06,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 06:51:06,841 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 06:51:07,020 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 06:51:07,023 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 06:51:07,239 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 06:51:07,239 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 06:51:07,268 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 06:51:07,269 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 06:51:07,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:51:07 BoogieIcfgContainer [2024-11-09 06:51:07,270 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 06:51:07,271 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 06:51:07,271 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 06:51:07,273 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 06:51:07,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 06:51:06" (1/3) ... [2024-11-09 06:51:07,274 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7d80c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:51:07, skipping insertion in model container [2024-11-09 06:51:07,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 06:51:06" (2/3) ... [2024-11-09 06:51:07,275 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d7d80c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 06:51:07, skipping insertion in model container [2024-11-09 06:51:07,275 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:51:07" (3/3) ... [2024-11-09 06:51:07,276 INFO L112 eAbstractionObserver]: Analyzing ICFG 04-mutex_37-indirect_rc.i [2024-11-09 06:51:07,288 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 06:51:07,289 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2024-11-09 06:51:07,289 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 06:51:07,363 INFO L143 ThreadInstanceAdder]: Constructed 1 joinOtherThreadTransitions. [2024-11-09 06:51:07,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 100 places, 96 transitions, 199 flow [2024-11-09 06:51:07,458 INFO L124 PetriNetUnfolderBase]: 0/95 cut-off events. [2024-11-09 06:51:07,459 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:51:07,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 100 conditions, 95 events. 0/95 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 63 event pairs, 0 based on Foata normal form. 0/86 useless extension candidates. Maximal degree in co-relation 0. Up to 2 conditions per place. [2024-11-09 06:51:07,463 INFO L82 GeneralOperation]: Start removeDead. Operand has 100 places, 96 transitions, 199 flow [2024-11-09 06:51:07,470 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 94 places, 90 transitions, 183 flow [2024-11-09 06:51:07,478 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 06:51:07,485 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;@4de2855f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 06:51:07,485 INFO L334 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2024-11-09 06:51:07,492 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 06:51:07,494 INFO L124 PetriNetUnfolderBase]: 0/21 cut-off events. [2024-11-09 06:51:07,494 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:51:07,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:07,495 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] [2024-11-09 06:51:07,496 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:07,503 INFO L85 PathProgramCache]: Analyzing trace with hash 458234348, now seen corresponding path program 1 times [2024-11-09 06:51:07,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:07,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920328985] [2024-11-09 06:51:07,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:07,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:07,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:07,737 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:07,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:07,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920328985] [2024-11-09 06:51:07,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920328985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:07,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:07,739 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:51:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261079913] [2024-11-09 06:51:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:07,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:51:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:07,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:51:07,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:51:07,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 96 [2024-11-09 06:51:07,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 90 transitions, 183 flow. Second operand has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-11-09 06:51:07,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:07,829 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 96 [2024-11-09 06:51:07,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:07,888 INFO L124 PetriNetUnfolderBase]: 2/119 cut-off events. [2024-11-09 06:51:07,889 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:51:07,890 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 119 events. 2/119 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 181 event pairs, 2 based on Foata normal form. 0/107 useless extension candidates. Maximal degree in co-relation 90. Up to 13 conditions per place. [2024-11-09 06:51:07,893 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 8 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2024-11-09 06:51:07,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 89 transitions, 201 flow [2024-11-09 06:51:07,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:51:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:51:07,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2024-11-09 06:51:07,904 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9027777777777778 [2024-11-09 06:51:07,906 INFO L175 Difference]: Start difference. First operand has 94 places, 90 transitions, 183 flow. Second operand 3 states and 260 transitions. [2024-11-09 06:51:07,906 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 89 transitions, 201 flow [2024-11-09 06:51:07,908 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 89 transitions, 200 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:51:07,912 INFO L231 Difference]: Finished difference. Result has 94 places, 89 transitions, 184 flow [2024-11-09 06:51:07,914 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=184, PETRI_PLACES=94, PETRI_TRANSITIONS=89} [2024-11-09 06:51:07,917 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 0 predicate places. [2024-11-09 06:51:07,918 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 89 transitions, 184 flow [2024-11-09 06:51:07,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.33333333333333) internal successors, (253), 3 states have internal predecessors, (253), 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-11-09 06:51:07,918 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:07,919 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] [2024-11-09 06:51:07,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 06:51:07,919 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:07,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:07,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2018417069, now seen corresponding path program 1 times [2024-11-09 06:51:07,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:07,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361953515] [2024-11-09 06:51:07,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:07,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:07,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-11-09 06:51:07,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:07,999 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361953515] [2024-11-09 06:51:07,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361953515] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:07,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:07,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:51:08,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885488747] [2024-11-09 06:51:08,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:08,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:51:08,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:08,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:51:08,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:51:08,020 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 96 [2024-11-09 06:51:08,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 89 transitions, 184 flow. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-11-09 06:51:08,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:08,022 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 96 [2024-11-09 06:51:08,022 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:08,077 INFO L124 PetriNetUnfolderBase]: 4/159 cut-off events. [2024-11-09 06:51:08,079 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 06:51:08,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 182 conditions, 159 events. 4/159 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 312 event pairs, 4 based on Foata normal form. 0/144 useless extension candidates. Maximal degree in co-relation 152. Up to 15 conditions per place. [2024-11-09 06:51:08,082 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 1 changer transitions 0/87 dead transitions. [2024-11-09 06:51:08,083 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 87 transitions, 196 flow [2024-11-09 06:51:08,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:51:08,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:51:08,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-09 06:51:08,088 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9201388888888888 [2024-11-09 06:51:08,089 INFO L175 Difference]: Start difference. First operand has 94 places, 89 transitions, 184 flow. Second operand 3 states and 265 transitions. [2024-11-09 06:51:08,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 87 transitions, 196 flow [2024-11-09 06:51:08,090 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 87 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:51:08,093 INFO L231 Difference]: Finished difference. Result has 92 places, 87 transitions, 178 flow [2024-11-09 06:51:08,094 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=178, PETRI_PLACES=92, PETRI_TRANSITIONS=87} [2024-11-09 06:51:08,095 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2024-11-09 06:51:08,098 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 87 transitions, 178 flow [2024-11-09 06:51:08,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-11-09 06:51:08,098 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:08,098 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] [2024-11-09 06:51:08,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 06:51:08,099 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:08,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:08,100 INFO L85 PathProgramCache]: Analyzing trace with hash -376810153, now seen corresponding path program 1 times [2024-11-09 06:51:08,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:08,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844953766] [2024-11-09 06:51:08,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:08,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:08,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:08,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:08,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844953766] [2024-11-09 06:51:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844953766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:51:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149058847] [2024-11-09 06:51:08,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:08,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:51:08,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:08,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:51:08,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:51:08,205 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 96 [2024-11-09 06:51:08,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 87 transitions, 178 flow. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-11-09 06:51:08,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:08,207 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 96 [2024-11-09 06:51:08,207 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:08,235 INFO L124 PetriNetUnfolderBase]: 0/86 cut-off events. [2024-11-09 06:51:08,236 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:51:08,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101 conditions, 86 events. 0/86 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 59 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 8 conditions per place. [2024-11-09 06:51:08,236 INFO L140 encePairwiseOnDemand]: 93/96 looper letters, 7 selfloop transitions, 2 changer transitions 0/86 dead transitions. [2024-11-09 06:51:08,237 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 86 transitions, 194 flow [2024-11-09 06:51:08,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:51:08,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:51:08,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 262 transitions. [2024-11-09 06:51:08,239 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9097222222222222 [2024-11-09 06:51:08,239 INFO L175 Difference]: Start difference. First operand has 92 places, 87 transitions, 178 flow. Second operand 3 states and 262 transitions. [2024-11-09 06:51:08,239 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 86 transitions, 194 flow [2024-11-09 06:51:08,240 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 86 transitions, 193 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:51:08,241 INFO L231 Difference]: Finished difference. Result has 92 places, 86 transitions, 179 flow [2024-11-09 06:51:08,241 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=179, PETRI_PLACES=92, PETRI_TRANSITIONS=86} [2024-11-09 06:51:08,242 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -2 predicate places. [2024-11-09 06:51:08,242 INFO L471 AbstractCegarLoop]: Abstraction has has 92 places, 86 transitions, 179 flow [2024-11-09 06:51:08,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 3 states have internal predecessors, (256), 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-11-09 06:51:08,243 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:08,243 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] [2024-11-09 06:51:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 06:51:08,243 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 541669795, now seen corresponding path program 1 times [2024-11-09 06:51:08,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:08,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070105709] [2024-11-09 06:51:08,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:08,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:08,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:08,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:08,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:08,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070105709] [2024-11-09 06:51:08,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070105709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:08,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:08,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 06:51:08,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934672340] [2024-11-09 06:51:08,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:08,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 06:51:08,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:08,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 06:51:08,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 06:51:08,336 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 96 [2024-11-09 06:51:08,337 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 86 transitions, 179 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-11-09 06:51:08,337 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:08,337 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 96 [2024-11-09 06:51:08,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:08,364 INFO L124 PetriNetUnfolderBase]: 0/85 cut-off events. [2024-11-09 06:51:08,364 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 06:51:08,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 85 events. 0/85 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 56 event pairs, 0 based on Foata normal form. 0/81 useless extension candidates. Maximal degree in co-relation 0. Up to 4 conditions per place. [2024-11-09 06:51:08,366 INFO L140 encePairwiseOnDemand]: 94/96 looper letters, 5 selfloop transitions, 1 changer transitions 0/85 dead transitions. [2024-11-09 06:51:08,366 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 85 transitions, 189 flow [2024-11-09 06:51:08,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 06:51:08,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 06:51:08,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 271 transitions. [2024-11-09 06:51:08,369 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9409722222222222 [2024-11-09 06:51:08,369 INFO L175 Difference]: Start difference. First operand has 92 places, 86 transitions, 179 flow. Second operand 3 states and 271 transitions. [2024-11-09 06:51:08,369 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 85 transitions, 189 flow [2024-11-09 06:51:08,370 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 85 transitions, 185 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 06:51:08,371 INFO L231 Difference]: Finished difference. Result has 91 places, 85 transitions, 175 flow [2024-11-09 06:51:08,372 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=175, PETRI_PLACES=91, PETRI_TRANSITIONS=85} [2024-11-09 06:51:08,374 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, -3 predicate places. [2024-11-09 06:51:08,374 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 85 transitions, 175 flow [2024-11-09 06:51:08,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 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-11-09 06:51:08,374 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:08,375 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] [2024-11-09 06:51:08,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 06:51:08,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:08,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:08,378 INFO L85 PathProgramCache]: Analyzing trace with hash -2018767922, now seen corresponding path program 1 times [2024-11-09 06:51:08,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:08,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199254695] [2024-11-09 06:51:08,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:08,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:08,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:08,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:08,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:08,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199254695] [2024-11-09 06:51:08,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199254695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:08,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:08,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:51:08,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721154617] [2024-11-09 06:51:08,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:08,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:51:08,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:08,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:51:08,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:51:09,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2024-11-09 06:51:09,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 85 transitions, 175 flow. Second operand has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-11-09 06:51:09,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:09,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2024-11-09 06:51:09,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:09,260 INFO L124 PetriNetUnfolderBase]: 84/383 cut-off events. [2024-11-09 06:51:09,260 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 06:51:09,262 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 383 events. 84/383 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1692 event pairs, 34 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 555. Up to 144 conditions per place. [2024-11-09 06:51:09,263 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 27 selfloop transitions, 22 changer transitions 0/114 dead transitions. [2024-11-09 06:51:09,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 114 transitions, 331 flow [2024-11-09 06:51:09,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:51:09,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:51:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 500 transitions. [2024-11-09 06:51:09,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8680555555555556 [2024-11-09 06:51:09,267 INFO L175 Difference]: Start difference. First operand has 91 places, 85 transitions, 175 flow. Second operand 6 states and 500 transitions. [2024-11-09 06:51:09,267 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 114 transitions, 331 flow [2024-11-09 06:51:09,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 114 transitions, 330 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 06:51:09,270 INFO L231 Difference]: Finished difference. Result has 100 places, 106 transitions, 324 flow [2024-11-09 06:51:09,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=324, PETRI_PLACES=100, PETRI_TRANSITIONS=106} [2024-11-09 06:51:09,271 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 6 predicate places. [2024-11-09 06:51:09,271 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 106 transitions, 324 flow [2024-11-09 06:51:09,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.33333333333333) internal successors, (458), 6 states have internal predecessors, (458), 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-11-09 06:51:09,272 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:09,272 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-11-09 06:51:09,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 06:51:09,272 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:09,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:09,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1752860697, now seen corresponding path program 1 times [2024-11-09 06:51:09,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:09,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2028439747] [2024-11-09 06:51:09,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:09,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:09,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:09,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:09,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2028439747] [2024-11-09 06:51:09,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2028439747] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:09,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:09,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:51:09,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467912855] [2024-11-09 06:51:09,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:09,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:51:09,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:09,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:51:09,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:51:09,721 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 96 [2024-11-09 06:51:09,722 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 106 transitions, 324 flow. Second operand has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-11-09 06:51:09,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:09,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 96 [2024-11-09 06:51:09,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:09,851 INFO L124 PetriNetUnfolderBase]: 94/424 cut-off events. [2024-11-09 06:51:09,851 INFO L125 PetriNetUnfolderBase]: For 114/124 co-relation queries the response was YES. [2024-11-09 06:51:09,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 815 conditions, 424 events. 94/424 cut-off events. For 114/124 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 2102 event pairs, 25 based on Foata normal form. 0/404 useless extension candidates. Maximal degree in co-relation 783. Up to 180 conditions per place. [2024-11-09 06:51:09,858 INFO L140 encePairwiseOnDemand]: 85/96 looper letters, 32 selfloop transitions, 26 changer transitions 0/127 dead transitions. [2024-11-09 06:51:09,858 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 127 transitions, 500 flow [2024-11-09 06:51:09,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:51:09,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:51:09,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 492 transitions. [2024-11-09 06:51:09,860 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8541666666666666 [2024-11-09 06:51:09,861 INFO L175 Difference]: Start difference. First operand has 100 places, 106 transitions, 324 flow. Second operand 6 states and 492 transitions. [2024-11-09 06:51:09,861 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 127 transitions, 500 flow [2024-11-09 06:51:09,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 127 transitions, 500 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:51:09,866 INFO L231 Difference]: Finished difference. Result has 110 places, 127 transitions, 508 flow [2024-11-09 06:51:09,867 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=324, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=508, PETRI_PLACES=110, PETRI_TRANSITIONS=127} [2024-11-09 06:51:09,867 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 16 predicate places. [2024-11-09 06:51:09,867 INFO L471 AbstractCegarLoop]: Abstraction has has 110 places, 127 transitions, 508 flow [2024-11-09 06:51:09,868 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 76.5) internal successors, (459), 6 states have internal predecessors, (459), 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-11-09 06:51:09,868 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:09,868 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] [2024-11-09 06:51:09,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 06:51:09,868 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:09,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:09,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1850069345, now seen corresponding path program 1 times [2024-11-09 06:51:09,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:09,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126654899] [2024-11-09 06:51:09,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:09,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:09,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:10,170 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:10,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:10,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126654899] [2024-11-09 06:51:10,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126654899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:10,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:10,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:51:10,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147170950] [2024-11-09 06:51:10,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:10,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:51:10,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:10,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:51:10,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:51:10,264 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 96 [2024-11-09 06:51:10,265 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 127 transitions, 508 flow. Second operand has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-11-09 06:51:10,265 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:10,265 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 96 [2024-11-09 06:51:10,265 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:10,451 INFO L124 PetriNetUnfolderBase]: 232/774 cut-off events. [2024-11-09 06:51:10,451 INFO L125 PetriNetUnfolderBase]: For 471/486 co-relation queries the response was YES. [2024-11-09 06:51:10,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1926 conditions, 774 events. 232/774 cut-off events. For 471/486 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 4445 event pairs, 51 based on Foata normal form. 1/734 useless extension candidates. Maximal degree in co-relation 1887. Up to 406 conditions per place. [2024-11-09 06:51:10,458 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 66 selfloop transitions, 53 changer transitions 4/182 dead transitions. [2024-11-09 06:51:10,458 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 182 transitions, 998 flow [2024-11-09 06:51:10,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:51:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:51:10,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 475 transitions. [2024-11-09 06:51:10,460 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8246527777777778 [2024-11-09 06:51:10,460 INFO L175 Difference]: Start difference. First operand has 110 places, 127 transitions, 508 flow. Second operand 6 states and 475 transitions. [2024-11-09 06:51:10,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 182 transitions, 998 flow [2024-11-09 06:51:10,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 182 transitions, 998 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-09 06:51:10,472 INFO L231 Difference]: Finished difference. Result has 120 places, 174 transitions, 990 flow [2024-11-09 06:51:10,472 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=990, PETRI_PLACES=120, PETRI_TRANSITIONS=174} [2024-11-09 06:51:10,473 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 26 predicate places. [2024-11-09 06:51:10,473 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 174 transitions, 990 flow [2024-11-09 06:51:10,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 69.5) internal successors, (417), 6 states have internal predecessors, (417), 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-11-09 06:51:10,474 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:10,474 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] [2024-11-09 06:51:10,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 06:51:10,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr2ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:10,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:10,475 INFO L85 PathProgramCache]: Analyzing trace with hash -1843486100, now seen corresponding path program 1 times [2024-11-09 06:51:10,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:10,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168443734] [2024-11-09 06:51:10,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:10,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:10,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 06:51:10,750 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 06:51:10,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 06:51:10,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168443734] [2024-11-09 06:51:10,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168443734] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 06:51:10,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 06:51:10,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 06:51:10,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147233520] [2024-11-09 06:51:10,751 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 06:51:10,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 06:51:10,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 06:51:10,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 06:51:10,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-09 06:51:10,873 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 96 [2024-11-09 06:51:10,874 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 174 transitions, 990 flow. Second operand has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-11-09 06:51:10,874 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 06:51:10,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 96 [2024-11-09 06:51:10,875 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 06:51:11,107 INFO L124 PetriNetUnfolderBase]: 315/1007 cut-off events. [2024-11-09 06:51:11,108 INFO L125 PetriNetUnfolderBase]: For 1383/1415 co-relation queries the response was YES. [2024-11-09 06:51:11,111 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1007 events. 315/1007 cut-off events. For 1383/1415 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 6202 event pairs, 57 based on Foata normal form. 3/978 useless extension candidates. Maximal degree in co-relation 3022. Up to 531 conditions per place. [2024-11-09 06:51:11,115 INFO L140 encePairwiseOnDemand]: 81/96 looper letters, 98 selfloop transitions, 61 changer transitions 6/227 dead transitions. [2024-11-09 06:51:11,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 227 transitions, 1650 flow [2024-11-09 06:51:11,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 06:51:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 06:51:11,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 478 transitions. [2024-11-09 06:51:11,118 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8298611111111112 [2024-11-09 06:51:11,118 INFO L175 Difference]: Start difference. First operand has 120 places, 174 transitions, 990 flow. Second operand 6 states and 478 transitions. [2024-11-09 06:51:11,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 227 transitions, 1650 flow [2024-11-09 06:51:11,128 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 227 transitions, 1586 flow, removed 32 selfloop flow, removed 0 redundant places. [2024-11-09 06:51:11,132 INFO L231 Difference]: Finished difference. Result has 130 places, 221 transitions, 1512 flow [2024-11-09 06:51:11,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=96, PETRI_DIFFERENCE_MINUEND_FLOW=932, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1512, PETRI_PLACES=130, PETRI_TRANSITIONS=221} [2024-11-09 06:51:11,133 INFO L277 CegarLoopForPetriNet]: 94 programPoint places, 36 predicate places. [2024-11-09 06:51:11,134 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 221 transitions, 1512 flow [2024-11-09 06:51:11,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.5) internal successors, (429), 6 states have internal predecessors, (429), 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-11-09 06:51:11,135 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 06:51:11,135 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] [2024-11-09 06:51:11,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 06:51:11,136 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr1ASSERT_VIOLATIONDATA_RACE === [ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE, ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (and 10 more)] === [2024-11-09 06:51:11,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 06:51:11,136 INFO L85 PathProgramCache]: Analyzing trace with hash -423558540, now seen corresponding path program 1 times [2024-11-09 06:51:11,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 06:51:11,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138650570] [2024-11-09 06:51:11,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 06:51:11,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 06:51:11,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:51:11,169 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 06:51:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 06:51:11,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 06:51:11,218 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 06:51:11,223 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr1ASSERT_VIOLATIONDATA_RACE (12 of 13 remaining) [2024-11-09 06:51:11,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (11 of 13 remaining) [2024-11-09 06:51:11,225 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (10 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (9 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (8 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (7 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (6 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (4 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1ASSERT_VIOLATIONDATA_RACE (3 of 13 remaining) [2024-11-09 06:51:11,226 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (2 of 13 remaining) [2024-11-09 06:51:11,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0ASSERT_VIOLATIONDATA_RACE (1 of 13 remaining) [2024-11-09 06:51:11,227 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2ASSERT_VIOLATIONDATA_RACE (0 of 13 remaining) [2024-11-09 06:51:11,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 06:51:11,227 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 06:51:11,300 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 06:51:11,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 06:51:11,309 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 06:51:11 BasicIcfg [2024-11-09 06:51:11,310 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 06:51:11,310 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 06:51:11,310 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 06:51:11,310 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 06:51:11,311 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 06:51:07" (3/4) ... [2024-11-09 06:51:11,312 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-09 06:51:11,390 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-09 06:51:11,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 06:51:11,391 INFO L158 Benchmark]: Toolchain (without parser) took 5257.94ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 154.2MB in the beginning and 134.0MB in the end (delta: 20.2MB). Peak memory consumption was 58.2MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,392 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 107.0MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 06:51:11,392 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.20ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 132.4MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,392 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.48ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,392 INFO L158 Benchmark]: Boogie Preprocessor took 34.66ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,392 INFO L158 Benchmark]: RCFGBuilder took 518.01ms. Allocated memory is still 184.5MB. Free memory was 128.2MB in the beginning and 144.9MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,393 INFO L158 Benchmark]: TraceAbstraction took 4038.79ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 143.8MB in the beginning and 140.3MB in the end (delta: 3.5MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,393 INFO L158 Benchmark]: Witness Printer took 80.60ms. Allocated memory is still 222.3MB. Free memory was 140.3MB in the beginning and 134.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-09 06:51:11,394 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.36ms. Allocated memory is still 107.0MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.20ms. Allocated memory is still 184.5MB. Free memory was 154.2MB in the beginning and 132.4MB in the end (delta: 21.8MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.48ms. Allocated memory is still 184.5MB. Free memory was 132.4MB in the beginning and 130.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.66ms. Allocated memory is still 184.5MB. Free memory was 130.3MB in the beginning and 128.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 518.01ms. Allocated memory is still 184.5MB. Free memory was 128.2MB in the beginning and 144.9MB in the end (delta: -16.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 4038.79ms. Allocated memory was 184.5MB in the beginning and 222.3MB in the end (delta: 37.7MB). Free memory was 143.8MB in the beginning and 140.3MB in the end (delta: 3.5MB). Peak memory consumption was 44.4MB. Max. memory is 16.1GB. * Witness Printer took 80.60ms. Allocated memory is still 222.3MB. Free memory was 140.3MB in the beginning and 134.0MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 685]: Data race detected Data race detected The following path leads to a data race: [L679] 0 int g; VAL [g={1:0}] [L680] 0 int *g1; VAL [g1={0:0}, g={1:0}] [L681] 0 int *g2; VAL [g1={0:0}, g2={0:0}, g={1:0}] [L682] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L690] 0 pthread_t id; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L691] 0 int x; VAL [g1={0:0}, g2={0:0}, g={1:0}, mutex={2:0}] [L692] EXPR 0 g2 = &g VAL [g1={0:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L692] 0 g1 = g2 = &g VAL [g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L693] FCALL, FORK 0 pthread_create(&id, ((void *)0), t_fun, ((void *)0)) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 *g2 VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] EXPR 0 \read(*g2) VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] EXPR 1 *g1 VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] EXPR 1 \read(*g1) VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] [L694] 0 (*g2)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, id=-1, mutex={2:0}] [L685] 1 (*g1)++ VAL [\old(arg)={0:0}, arg={0:0}, g1={1:0}, g2={1:0}, g={1:0}, mutex={2:0}] Now there is a data race, but we were unable to determine exactly which statements and variables are involved. There could be a race between one of the statements * C: g2 = &g [692] * C: (*g2)++ [694] * C: g1 = g2 = &g [692] and C: (*g1)++ [685] - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 692]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 694]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 693]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 685]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 128 locations, 13 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: 3.8s, OverallIterations: 9, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 316 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 171 mSDsluCounter, 34 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 86 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 776 IncrementalHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 86 mSolverCounterUnsat, 34 mSDtfsCounter, 776 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1512occurred in iteration=8, InterpolantAutomatonStates: 36, 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.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 366 NumberOfCodeBlocks, 366 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 299 ConstructedInterpolants, 0 QuantifiedInterpolants, 631 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-09 06:51:11,425 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE