./Ultimate.py --spec ../sv-benchmarks/c/properties/no-data-race.prp --file ../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version 3289d67d 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/weaver/chl-file-item-symm.wvr.c -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 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 23:43:13,723 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 23:43:13,803 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-16 23:43:13,806 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 23:43:13,806 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 23:43:13,819 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 23:43:13,820 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 23:43:13,820 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 23:43:13,821 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 23:43:13,821 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 23:43:13,821 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 23:43:13,822 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 23:43:13,822 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 23:43:13,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 23:43:13,823 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 23:43:13,823 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 23:43:13,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 23:43:13,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 23:43:13,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 23:43:13,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 23:43:13,824 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 23:43:13,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 23:43:13,825 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-16 23:43:13,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 23:43:13,826 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-16 23:43:13,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 23:43:13,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 23:43:13,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 23:43:13,827 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 23:43:13,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 23:43:13,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 23:43:13,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:43:13,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 23:43:13,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 23:43:13,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 23:43:13,828 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 23:43:13,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 23:43:13,829 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 23:43:13,829 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 23:43:13,829 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 23:43:13,830 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 23:43:13,830 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 -> 3bc77f08e5fdc1758b216096ce0b18debc22015dafe53c78389dc7da36650394 [2024-11-16 23:43:13,986 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 23:43:14,005 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 23:43:14,007 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 23:43:14,008 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 23:43:14,009 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 23:43:14,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2024-11-16 23:43:15,297 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 23:43:15,480 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 23:43:15,480 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/chl-file-item-symm.wvr.c [2024-11-16 23:43:15,491 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed54c92e/63bfa58b1f064e6bb65113d2eda2c244/FLAGa812dd5d2 [2024-11-16 23:43:15,505 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ed54c92e/63bfa58b1f064e6bb65113d2eda2c244 [2024-11-16 23:43:15,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 23:43:15,510 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 23:43:15,513 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 23:43:15,513 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 23:43:15,517 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 23:43:15,518 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:15,519 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4cc0762d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15, skipping insertion in model container [2024-11-16 23:43:15,519 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:15,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 23:43:15,802 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:43:15,814 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 23:43:15,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 23:43:15,906 INFO L204 MainTranslator]: Completed translation [2024-11-16 23:43:15,906 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15 WrapperNode [2024-11-16 23:43:15,907 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 23:43:15,908 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 23:43:15,911 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 23:43:15,911 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 23:43:15,917 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:15,936 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:15,992 INFO L138 Inliner]: procedures = 21, calls = 16, calls flagged for inlining = 10, calls inlined = 12, statements flattened = 231 [2024-11-16 23:43:15,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 23:43:15,993 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 23:43:15,993 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 23:43:15,993 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 23:43:16,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,007 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,009 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,009 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,013 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,015 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,016 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,018 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 23:43:16,018 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 23:43:16,018 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 23:43:16,019 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 23:43:16,019 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (1/1) ... [2024-11-16 23:43:16,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 23:43:16,034 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 23:43:16,049 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-16 23:43:16,051 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-16 23:43:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 23:43:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-16 23:43:16,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-16 23:43:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-16 23:43:16,084 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-16 23:43:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-16 23:43:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 23:43:16,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 23:43:16,086 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-16 23:43:16,167 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 23:43:16,168 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 23:43:16,451 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-16 23:43:16,451 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 23:43:16,468 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 23:43:16,468 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 23:43:16,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:16 BoogieIcfgContainer [2024-11-16 23:43:16,469 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 23:43:16,470 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 23:43:16,470 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 23:43:16,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 23:43:16,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:43:15" (1/3) ... [2024-11-16 23:43:16,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c1a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:16, skipping insertion in model container [2024-11-16 23:43:16,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:43:15" (2/3) ... [2024-11-16 23:43:16,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@401c1a08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:43:16, skipping insertion in model container [2024-11-16 23:43:16,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:16" (3/3) ... [2024-11-16 23:43:16,475 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-file-item-symm.wvr.c [2024-11-16 23:43:16,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 23:43:16,488 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-16 23:43:16,488 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-16 23:43:16,563 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-16 23:43:16,598 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 302 places, 313 transitions, 640 flow [2024-11-16 23:43:16,665 INFO L124 PetriNetUnfolderBase]: 18/311 cut-off events. [2024-11-16 23:43:16,666 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:43:16,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 320 conditions, 311 events. 18/311 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 608 event pairs, 0 based on Foata normal form. 0/263 useless extension candidates. Maximal degree in co-relation 170. Up to 2 conditions per place. [2024-11-16 23:43:16,677 INFO L82 GeneralOperation]: Start removeDead. Operand has 302 places, 313 transitions, 640 flow [2024-11-16 23:43:16,684 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 282 places, 291 transitions, 594 flow [2024-11-16 23:43:16,698 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 23:43:16,708 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;@3f40f35c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 23:43:16,709 INFO L334 AbstractCegarLoop]: Starting to check reachability of 50 error locations. [2024-11-16 23:43:16,716 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-16 23:43:16,716 INFO L124 PetriNetUnfolderBase]: 0/24 cut-off events. [2024-11-16 23:43:16,716 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-16 23:43:16,717 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:16,718 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-16 23:43:16,718 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:16,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:16,724 INFO L85 PathProgramCache]: Analyzing trace with hash -397875821, now seen corresponding path program 1 times [2024-11-16 23:43:16,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:16,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260483294] [2024-11-16 23:43:16,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:16,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:16,915 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-16 23:43:16,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:16,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260483294] [2024-11-16 23:43:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260483294] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:16,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:16,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806476262] [2024-11-16 23:43:16,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:16,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:16,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:16,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:16,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:16,973 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-11-16 23:43:16,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 282 places, 291 transitions, 594 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:16,977 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:16,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-11-16 23:43:16,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,061 INFO L124 PetriNetUnfolderBase]: 17/369 cut-off events. [2024-11-16 23:43:17,061 INFO L125 PetriNetUnfolderBase]: For 11/12 co-relation queries the response was YES. [2024-11-16 23:43:17,065 INFO L83 FinitePrefix]: Finished finitePrefix Result has 399 conditions, 369 events. 17/369 cut-off events. For 11/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 1097 event pairs, 3 based on Foata normal form. 12/321 useless extension candidates. Maximal degree in co-relation 258. Up to 16 conditions per place. [2024-11-16 23:43:17,069 INFO L140 encePairwiseOnDemand]: 304/313 looper letters, 9 selfloop transitions, 2 changer transitions 2/284 dead transitions. [2024-11-16 23:43:17,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 283 places, 284 transitions, 602 flow [2024-11-16 23:43:17,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 894 transitions. [2024-11-16 23:43:17,086 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.952076677316294 [2024-11-16 23:43:17,088 INFO L175 Difference]: Start difference. First operand has 282 places, 291 transitions, 594 flow. Second operand 3 states and 894 transitions. [2024-11-16 23:43:17,089 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 283 places, 284 transitions, 602 flow [2024-11-16 23:43:17,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 279 places, 284 transitions, 594 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-16 23:43:17,128 INFO L231 Difference]: Finished difference. Result has 279 places, 282 transitions, 572 flow [2024-11-16 23:43:17,130 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=277, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=284, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=282, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=572, PETRI_PLACES=279, PETRI_TRANSITIONS=282} [2024-11-16 23:43:17,135 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -3 predicate places. [2024-11-16 23:43:17,136 INFO L471 AbstractCegarLoop]: Abstraction has has 279 places, 282 transitions, 572 flow [2024-11-16 23:43:17,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:17,147 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,148 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] [2024-11-16 23:43:17,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 23:43:17,149 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,151 INFO L85 PathProgramCache]: Analyzing trace with hash -218594169, now seen corresponding path program 1 times [2024-11-16 23:43:17,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108314916] [2024-11-16 23:43:17,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,209 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-16 23:43:17,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108314916] [2024-11-16 23:43:17,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [108314916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274659821] [2024-11-16 23:43:17,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,238 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 292 out of 313 [2024-11-16 23:43:17,239 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 279 places, 282 transitions, 572 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:17,239 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,239 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 292 of 313 [2024-11-16 23:43:17,239 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,303 INFO L124 PetriNetUnfolderBase]: 17/366 cut-off events. [2024-11-16 23:43:17,303 INFO L125 PetriNetUnfolderBase]: For 2/3 co-relation queries the response was YES. [2024-11-16 23:43:17,306 INFO L83 FinitePrefix]: Finished finitePrefix Result has 391 conditions, 366 events. 17/366 cut-off events. For 2/3 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 1086 event pairs, 3 based on Foata normal form. 0/309 useless extension candidates. Maximal degree in co-relation 359. Up to 16 conditions per place. [2024-11-16 23:43:17,308 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 9 selfloop transitions, 2 changer transitions 0/281 dead transitions. [2024-11-16 23:43:17,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 278 places, 281 transitions, 592 flow [2024-11-16 23:43:17,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-11-16 23:43:17,312 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-11-16 23:43:17,312 INFO L175 Difference]: Start difference. First operand has 279 places, 282 transitions, 572 flow. Second operand 3 states and 888 transitions. [2024-11-16 23:43:17,312 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 278 places, 281 transitions, 592 flow [2024-11-16 23:43:17,317 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 276 places, 281 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:17,322 INFO L231 Difference]: Finished difference. Result has 276 places, 281 transitions, 570 flow [2024-11-16 23:43:17,323 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=566, PETRI_DIFFERENCE_MINUEND_PLACES=274, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=281, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=279, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=570, PETRI_PLACES=276, PETRI_TRANSITIONS=281} [2024-11-16 23:43:17,324 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -6 predicate places. [2024-11-16 23:43:17,324 INFO L471 AbstractCegarLoop]: Abstraction has has 276 places, 281 transitions, 570 flow [2024-11-16 23:43:17,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:17,325 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,325 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] [2024-11-16 23:43:17,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 23:43:17,325 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,326 INFO L85 PathProgramCache]: Analyzing trace with hash 612744188, now seen corresponding path program 1 times [2024-11-16 23:43:17,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128587820] [2024-11-16 23:43:17,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,406 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-16 23:43:17,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128587820] [2024-11-16 23:43:17,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128587820] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745634572] [2024-11-16 23:43:17,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,431 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:17,432 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 276 places, 281 transitions, 570 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,432 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:17,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,494 INFO L124 PetriNetUnfolderBase]: 27/518 cut-off events. [2024-11-16 23:43:17,494 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-16 23:43:17,496 INFO L83 FinitePrefix]: Finished finitePrefix Result has 548 conditions, 518 events. 27/518 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 2203 event pairs, 5 based on Foata normal form. 0/430 useless extension candidates. Maximal degree in co-relation 508. Up to 21 conditions per place. [2024-11-16 23:43:17,498 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/280 dead transitions. [2024-11-16 23:43:17,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 280 transitions, 592 flow [2024-11-16 23:43:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-11-16 23:43:17,503 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-11-16 23:43:17,503 INFO L175 Difference]: Start difference. First operand has 276 places, 281 transitions, 570 flow. Second operand 3 states and 886 transitions. [2024-11-16 23:43:17,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 280 transitions, 592 flow [2024-11-16 23:43:17,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 280 transitions, 588 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:17,508 INFO L231 Difference]: Finished difference. Result has 275 places, 280 transitions, 568 flow [2024-11-16 23:43:17,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=564, PETRI_DIFFERENCE_MINUEND_PLACES=273, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=280, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=278, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=568, PETRI_PLACES=275, PETRI_TRANSITIONS=280} [2024-11-16 23:43:17,510 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -7 predicate places. [2024-11-16 23:43:17,510 INFO L471 AbstractCegarLoop]: Abstraction has has 275 places, 280 transitions, 568 flow [2024-11-16 23:43:17,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,511 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,511 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:17,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 23:43:17,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,513 INFO L85 PathProgramCache]: Analyzing trace with hash -892590813, now seen corresponding path program 1 times [2024-11-16 23:43:17,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428517934] [2024-11-16 23:43:17,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,578 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-16 23:43:17,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428517934] [2024-11-16 23:43:17,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428517934] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037066687] [2024-11-16 23:43:17,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,608 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:17,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 275 places, 280 transitions, 568 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,609 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:17,609 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,652 INFO L124 PetriNetUnfolderBase]: 23/429 cut-off events. [2024-11-16 23:43:17,652 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-16 23:43:17,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 460 conditions, 429 events. 23/429 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1571 event pairs, 5 based on Foata normal form. 0/364 useless extension candidates. Maximal degree in co-relation 412. Up to 21 conditions per place. [2024-11-16 23:43:17,656 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-11-16 23:43:17,656 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 276 places, 279 transitions, 590 flow [2024-11-16 23:43:17,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-11-16 23:43:17,658 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-11-16 23:43:17,658 INFO L175 Difference]: Start difference. First operand has 275 places, 280 transitions, 568 flow. Second operand 3 states and 886 transitions. [2024-11-16 23:43:17,658 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 276 places, 279 transitions, 590 flow [2024-11-16 23:43:17,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 274 places, 279 transitions, 586 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:17,662 INFO L231 Difference]: Finished difference. Result has 274 places, 279 transitions, 566 flow [2024-11-16 23:43:17,663 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=562, PETRI_DIFFERENCE_MINUEND_PLACES=272, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=279, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=277, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=566, PETRI_PLACES=274, PETRI_TRANSITIONS=279} [2024-11-16 23:43:17,664 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -8 predicate places. [2024-11-16 23:43:17,664 INFO L471 AbstractCegarLoop]: Abstraction has has 274 places, 279 transitions, 566 flow [2024-11-16 23:43:17,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,665 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,665 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:17,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 23:43:17,666 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1828683381, now seen corresponding path program 1 times [2024-11-16 23:43:17,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029326396] [2024-11-16 23:43:17,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,726 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-16 23:43:17,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029326396] [2024-11-16 23:43:17,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029326396] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070663174] [2024-11-16 23:43:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,754 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:17,755 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 274 places, 279 transitions, 566 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,755 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:17,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,816 INFO L124 PetriNetUnfolderBase]: 22/422 cut-off events. [2024-11-16 23:43:17,816 INFO L125 PetriNetUnfolderBase]: For 4/5 co-relation queries the response was YES. [2024-11-16 23:43:17,817 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453 conditions, 422 events. 22/422 cut-off events. For 4/5 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1411 event pairs, 5 based on Foata normal form. 0/358 useless extension candidates. Maximal degree in co-relation 397. Up to 22 conditions per place. [2024-11-16 23:43:17,818 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-16 23:43:17,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 278 transitions, 588 flow [2024-11-16 23:43:17,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-11-16 23:43:17,820 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-11-16 23:43:17,820 INFO L175 Difference]: Start difference. First operand has 274 places, 279 transitions, 566 flow. Second operand 3 states and 886 transitions. [2024-11-16 23:43:17,820 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 278 transitions, 588 flow [2024-11-16 23:43:17,822 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 273 places, 278 transitions, 584 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:17,824 INFO L231 Difference]: Finished difference. Result has 273 places, 278 transitions, 564 flow [2024-11-16 23:43:17,825 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=560, PETRI_DIFFERENCE_MINUEND_PLACES=271, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=278, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=276, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=564, PETRI_PLACES=273, PETRI_TRANSITIONS=278} [2024-11-16 23:43:17,825 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -9 predicate places. [2024-11-16 23:43:17,826 INFO L471 AbstractCegarLoop]: Abstraction has has 273 places, 278 transitions, 564 flow [2024-11-16 23:43:17,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,826 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,826 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:17,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 23:43:17,827 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,827 INFO L85 PathProgramCache]: Analyzing trace with hash 906997078, now seen corresponding path program 1 times [2024-11-16 23:43:17,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102715038] [2024-11-16 23:43:17,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,863 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-16 23:43:17,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102715038] [2024-11-16 23:43:17,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102715038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139365967] [2024-11-16 23:43:17,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,881 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:17,882 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 273 places, 278 transitions, 564 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,882 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:17,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:17,929 INFO L124 PetriNetUnfolderBase]: 26/507 cut-off events. [2024-11-16 23:43:17,930 INFO L125 PetriNetUnfolderBase]: For 3/4 co-relation queries the response was YES. [2024-11-16 23:43:17,931 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 507 events. 26/507 cut-off events. For 3/4 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 2028 event pairs, 5 based on Foata normal form. 0/427 useless extension candidates. Maximal degree in co-relation 475. Up to 22 conditions per place. [2024-11-16 23:43:17,933 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-16 23:43:17,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 274 places, 277 transitions, 586 flow [2024-11-16 23:43:17,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:17,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:17,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 886 transitions. [2024-11-16 23:43:17,934 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9435569755058573 [2024-11-16 23:43:17,935 INFO L175 Difference]: Start difference. First operand has 273 places, 278 transitions, 564 flow. Second operand 3 states and 886 transitions. [2024-11-16 23:43:17,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 274 places, 277 transitions, 586 flow [2024-11-16 23:43:17,936 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 272 places, 277 transitions, 582 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:17,938 INFO L231 Difference]: Finished difference. Result has 272 places, 277 transitions, 562 flow [2024-11-16 23:43:17,938 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=270, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=275, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=562, PETRI_PLACES=272, PETRI_TRANSITIONS=277} [2024-11-16 23:43:17,939 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -10 predicate places. [2024-11-16 23:43:17,939 INFO L471 AbstractCegarLoop]: Abstraction has has 272 places, 277 transitions, 562 flow [2024-11-16 23:43:17,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,940 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:17,940 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:17,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 23:43:17,940 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err8ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:17,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:17,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1538216019, now seen corresponding path program 1 times [2024-11-16 23:43:17,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:17,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463402409] [2024-11-16 23:43:17,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:17,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:17,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:17,971 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-16 23:43:17,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:17,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463402409] [2024-11-16 23:43:17,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463402409] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:17,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:17,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:17,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453551396] [2024-11-16 23:43:17,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:17,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:17,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:17,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:17,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:17,984 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:17,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 277 transitions, 562 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:17,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:17,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:17,986 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:18,049 INFO L124 PetriNetUnfolderBase]: 48/722 cut-off events. [2024-11-16 23:43:18,050 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2024-11-16 23:43:18,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 770 conditions, 722 events. 48/722 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 3783 event pairs, 8 based on Foata normal form. 0/608 useless extension candidates. Maximal degree in co-relation 698. Up to 36 conditions per place. [2024-11-16 23:43:18,054 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-11-16 23:43:18,054 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 595 flow [2024-11-16 23:43:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:18,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:18,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-11-16 23:43:18,056 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-11-16 23:43:18,056 INFO L175 Difference]: Start difference. First operand has 272 places, 277 transitions, 562 flow. Second operand 3 states and 891 transitions. [2024-11-16 23:43:18,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 595 flow [2024-11-16 23:43:18,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 591 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:18,060 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 573 flow [2024-11-16 23:43:18,060 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=552, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=573, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-11-16 23:43:18,061 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-11-16 23:43:18,061 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 573 flow [2024-11-16 23:43:18,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,061 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:18,062 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:43:18,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 23:43:18,062 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err7ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:18,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:18,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1987936872, now seen corresponding path program 1 times [2024-11-16 23:43:18,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:18,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952507651] [2024-11-16 23:43:18,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:18,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:18,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:18,116 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-16 23:43:18,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:18,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952507651] [2024-11-16 23:43:18,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952507651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:18,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:18,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:18,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10983707] [2024-11-16 23:43:18,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:18,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:18,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:18,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:18,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:18,140 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:18,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 573 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:18,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:18,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:18,249 INFO L124 PetriNetUnfolderBase]: 54/797 cut-off events. [2024-11-16 23:43:18,253 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-16 23:43:18,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 797 events. 54/797 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 4510 event pairs, 6 based on Foata normal form. 0/682 useless extension candidates. Maximal degree in co-relation 707. Up to 36 conditions per place. [2024-11-16 23:43:18,261 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 12 selfloop transitions, 3 changer transitions 0/278 dead transitions. [2024-11-16 23:43:18,262 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 278 transitions, 606 flow [2024-11-16 23:43:18,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:18,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 891 transitions. [2024-11-16 23:43:18,267 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9488817891373802 [2024-11-16 23:43:18,268 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 573 flow. Second operand 3 states and 891 transitions. [2024-11-16 23:43:18,268 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 278 transitions, 606 flow [2024-11-16 23:43:18,269 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 606 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:18,271 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 588 flow [2024-11-16 23:43:18,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=567, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=588, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-11-16 23:43:18,274 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-11-16 23:43:18,274 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 588 flow [2024-11-16 23:43:18,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,279 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:18,279 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:18,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 23:43:18,279 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err6ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:18,279 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:18,279 INFO L85 PathProgramCache]: Analyzing trace with hash -676085956, now seen corresponding path program 1 times [2024-11-16 23:43:18,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:18,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796743927] [2024-11-16 23:43:18,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:18,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:18,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:18,313 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-16 23:43:18,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:18,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796743927] [2024-11-16 23:43:18,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796743927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:18,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:18,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:18,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257157600] [2024-11-16 23:43:18,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:18,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:18,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:18,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:18,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:18,355 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:18,356 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 588 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,356 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:18,356 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:18,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:18,484 INFO L124 PetriNetUnfolderBase]: 56/962 cut-off events. [2024-11-16 23:43:18,484 INFO L125 PetriNetUnfolderBase]: For 12/14 co-relation queries the response was YES. [2024-11-16 23:43:18,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1054 conditions, 962 events. 56/962 cut-off events. For 12/14 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 6002 event pairs, 4 based on Foata normal form. 0/842 useless extension candidates. Maximal degree in co-relation 879. Up to 55 conditions per place. [2024-11-16 23:43:18,489 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/280 dead transitions. [2024-11-16 23:43:18,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 280 transitions, 631 flow [2024-11-16 23:43:18,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:18,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:18,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-11-16 23:43:18,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-11-16 23:43:18,492 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 588 flow. Second operand 3 states and 893 transitions. [2024-11-16 23:43:18,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 280 transitions, 631 flow [2024-11-16 23:43:18,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 280 transitions, 631 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:18,496 INFO L231 Difference]: Finished difference. Result has 270 places, 277 transitions, 603 flow [2024-11-16 23:43:18,496 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=582, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=603, PETRI_PLACES=270, PETRI_TRANSITIONS=277} [2024-11-16 23:43:18,497 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-11-16 23:43:18,497 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 277 transitions, 603 flow [2024-11-16 23:43:18,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,497 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:18,498 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:18,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-16 23:43:18,498 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread1Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:18,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:18,498 INFO L85 PathProgramCache]: Analyzing trace with hash 426964159, now seen corresponding path program 1 times [2024-11-16 23:43:18,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:18,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612715041] [2024-11-16 23:43:18,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:18,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:18,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:18,554 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-16 23:43:18,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612715041] [2024-11-16 23:43:18,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612715041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:18,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:18,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:18,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380803455] [2024-11-16 23:43:18,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:18,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:18,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:18,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:18,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:18,610 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-11-16 23:43:18,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 277 transitions, 603 flow. Second operand has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:18,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:18,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-11-16 23:43:18,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:18,729 INFO L124 PetriNetUnfolderBase]: 42/793 cut-off events. [2024-11-16 23:43:18,729 INFO L125 PetriNetUnfolderBase]: For 4/12 co-relation queries the response was YES. [2024-11-16 23:43:18,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 902 conditions, 793 events. 42/793 cut-off events. For 4/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 4528 event pairs, 4 based on Foata normal form. 2/704 useless extension candidates. Maximal degree in co-relation 727. Up to 25 conditions per place. [2024-11-16 23:43:18,738 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/277 dead transitions. [2024-11-16 23:43:18,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 277 transitions, 628 flow [2024-11-16 23:43:18,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:18,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:18,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-11-16 23:43:18,740 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-11-16 23:43:18,740 INFO L175 Difference]: Start difference. First operand has 270 places, 277 transitions, 603 flow. Second operand 3 states and 892 transitions. [2024-11-16 23:43:18,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 277 transitions, 628 flow [2024-11-16 23:43:18,742 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 277 transitions, 628 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:18,745 INFO L231 Difference]: Finished difference. Result has 271 places, 276 transitions, 605 flow [2024-11-16 23:43:18,746 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=601, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=276, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=274, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=605, PETRI_PLACES=271, PETRI_TRANSITIONS=276} [2024-11-16 23:43:18,746 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-11-16 23:43:18,747 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 276 transitions, 605 flow [2024-11-16 23:43:18,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.3333333333333) internal successors, (883), 3 states have internal predecessors, (883), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-16 23:43:18,748 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:18,748 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:18,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 23:43:18,748 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err2ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:18,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:18,749 INFO L85 PathProgramCache]: Analyzing trace with hash 2120516849, now seen corresponding path program 1 times [2024-11-16 23:43:18,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:18,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042523383] [2024-11-16 23:43:18,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:18,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:18,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:18,784 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-16 23:43:18,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:18,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042523383] [2024-11-16 23:43:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042523383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:18,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924631550] [2024-11-16 23:43:18,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:18,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:18,797 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:18,798 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 276 transitions, 605 flow. Second operand has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,798 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:18,798 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:18,798 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:18,870 INFO L124 PetriNetUnfolderBase]: 60/1068 cut-off events. [2024-11-16 23:43:18,870 INFO L125 PetriNetUnfolderBase]: For 8/10 co-relation queries the response was YES. [2024-11-16 23:43:18,874 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1200 conditions, 1068 events. 60/1068 cut-off events. For 8/10 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 7051 event pairs, 6 based on Foata normal form. 0/948 useless extension candidates. Maximal degree in co-relation 1022. Up to 47 conditions per place. [2024-11-16 23:43:18,876 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 14 selfloop transitions, 3 changer transitions 0/279 dead transitions. [2024-11-16 23:43:18,877 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 270 places, 279 transitions, 648 flow [2024-11-16 23:43:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 893 transitions. [2024-11-16 23:43:18,878 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9510117145899893 [2024-11-16 23:43:18,879 INFO L175 Difference]: Start difference. First operand has 271 places, 276 transitions, 605 flow. Second operand 3 states and 893 transitions. [2024-11-16 23:43:18,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 270 places, 279 transitions, 648 flow [2024-11-16 23:43:18,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 268 places, 279 transitions, 644 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:18,882 INFO L231 Difference]: Finished difference. Result has 269 places, 276 transitions, 616 flow [2024-11-16 23:43:18,883 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=595, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=270, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=616, PETRI_PLACES=269, PETRI_TRANSITIONS=276} [2024-11-16 23:43:18,883 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-11-16 23:43:18,883 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 276 transitions, 616 flow [2024-11-16 23:43:18,884 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 292.3333333333333) internal successors, (877), 3 states have internal predecessors, (877), 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-16 23:43:18,884 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:18,884 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:18,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-16 23:43:18,884 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:18,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:18,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1968698952, now seen corresponding path program 1 times [2024-11-16 23:43:18,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:18,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128484587] [2024-11-16 23:43:18,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:18,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:18,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:18,911 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-16 23:43:18,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:18,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128484587] [2024-11-16 23:43:18,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128484587] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:18,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:18,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:18,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614354882] [2024-11-16 23:43:18,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:18,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:18,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:18,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:18,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:18,923 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-11-16 23:43:18,924 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 276 transitions, 616 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-16 23:43:18,924 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:18,924 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-11-16 23:43:18,924 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:19,011 INFO L124 PetriNetUnfolderBase]: 45/1163 cut-off events. [2024-11-16 23:43:19,011 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-11-16 23:43:19,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1290 conditions, 1163 events. 45/1163 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 7231 event pairs, 2 based on Foata normal form. 0/1055 useless extension candidates. Maximal degree in co-relation 1095. Up to 42 conditions per place. [2024-11-16 23:43:19,018 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/279 dead transitions. [2024-11-16 23:43:19,018 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 279 transitions, 653 flow [2024-11-16 23:43:19,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:19,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:19,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-11-16 23:43:19,020 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-11-16 23:43:19,020 INFO L175 Difference]: Start difference. First operand has 269 places, 276 transitions, 616 flow. Second operand 3 states and 898 transitions. [2024-11-16 23:43:19,020 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 279 transitions, 653 flow [2024-11-16 23:43:19,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 279 transitions, 653 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:19,023 INFO L231 Difference]: Finished difference. Result has 270 places, 276 transitions, 626 flow [2024-11-16 23:43:19,024 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=612, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=274, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=272, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=626, PETRI_PLACES=270, PETRI_TRANSITIONS=276} [2024-11-16 23:43:19,024 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-11-16 23:43:19,024 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 276 transitions, 626 flow [2024-11-16 23:43:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-16 23:43:19,025 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:19,025 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:19,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 23:43:19,025 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting thread2Err0ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:19,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:19,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1435570833, now seen corresponding path program 1 times [2024-11-16 23:43:19,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:19,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180703869] [2024-11-16 23:43:19,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:19,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:19,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:19,050 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-16 23:43:19,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:19,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180703869] [2024-11-16 23:43:19,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180703869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:19,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:19,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:19,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [638988556] [2024-11-16 23:43:19,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:19,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:19,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:19,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:19,052 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:19,068 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 293 out of 313 [2024-11-16 23:43:19,069 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 276 transitions, 626 flow. Second operand has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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-16 23:43:19,069 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:19,069 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 293 of 313 [2024-11-16 23:43:19,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:19,131 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,131 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is cut-off event [2024-11-16 23:43:19,131 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-16 23:43:19,131 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,132 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,132 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([723] L50-8-->L50-7: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][134], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 344#(= |#race~filename_1~0| 0), 325#(= |#race~isNull_0~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,132 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,132 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-16 23:43:19,132 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,132 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is cut-off event [2024-11-16 23:43:19,133 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,133 INFO L294 olderBase$Statistics]: this new event has 179 ancestors and is cut-off event [2024-11-16 23:43:19,133 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-16 23:43:19,133 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,133 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,134 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is cut-off event [2024-11-16 23:43:19,135 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,135 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-16 23:43:19,135 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,135 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,135 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,136 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,136 INFO L294 olderBase$Statistics]: this new event has 181 ancestors and is cut-off event [2024-11-16 23:43:19,136 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-16 23:43:19,136 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:43:19,136 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-16 23:43:19,139 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([723] L50-8-->L50-7: Formula: true InVars {} OutVars{thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_1|} AuxVars[] AssignedVars[thread2Thread1of1ForFork0_#t~nondet12#1][134], [8#L50-7true, Black: 323#true, 16#L69true, Black: 327#true, 344#(= |#race~filename_1~0| 0), 325#(= |#race~isNull_0~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,139 INFO L294 olderBase$Statistics]: this new event has 143 ancestors and is not cut-off event [2024-11-16 23:43:19,139 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:43:19,139 INFO L297 olderBase$Statistics]: existing Event has 143 ancestors and is not cut-off event [2024-11-16 23:43:19,139 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is not cut-off event [2024-11-16 23:43:19,139 INFO L297 olderBase$Statistics]: existing Event has 179 ancestors and is not cut-off event [2024-11-16 23:43:19,140 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 16#L69true, 233#L50-6true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,140 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [Black: 323#true, 16#L69true, 100#L52true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,140 INFO L294 olderBase$Statistics]: this new event has 187 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,140 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-16 23:43:19,141 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][178], [Black: 323#true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), 348#(= |thread2Thread1of1ForFork0_#t~nondet12#1| |#race~result_7~0|), Black: 331#true, 10#L50-5true, 329#(= |#race~isNull_3~0| 0), Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,141 INFO L294 olderBase$Statistics]: this new event has 145 ancestors and is cut-off event [2024-11-16 23:43:19,141 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-16 23:43:19,141 INFO L297 olderBase$Statistics]: existing Event has 181 ancestors and is cut-off event [2024-11-16 23:43:19,141 INFO L297 olderBase$Statistics]: existing Event has 145 ancestors and is cut-off event [2024-11-16 23:43:19,141 INFO L297 olderBase$Statistics]: existing Event has 153 ancestors and is cut-off event [2024-11-16 23:43:19,142 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][170], [Black: 323#true, 16#L69true, 100#L52true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 346#true, Black: 338#true, Black: 342#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,143 INFO L294 olderBase$Statistics]: this new event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,143 INFO L297 olderBase$Statistics]: existing Event has 187 ancestors and is cut-off event [2024-11-16 23:43:19,143 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-16 23:43:19,143 INFO L297 olderBase$Statistics]: existing Event has 151 ancestors and is cut-off event [2024-11-16 23:43:19,143 INFO L297 olderBase$Statistics]: existing Event has 159 ancestors and is cut-off event [2024-11-16 23:43:19,146 INFO L124 PetriNetUnfolderBase]: 70/1028 cut-off events. [2024-11-16 23:43:19,146 INFO L125 PetriNetUnfolderBase]: For 42/45 co-relation queries the response was YES. [2024-11-16 23:43:19,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1268 conditions, 1028 events. 70/1028 cut-off events. For 42/45 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 6074 event pairs, 6 based on Foata normal form. 0/940 useless extension candidates. Maximal degree in co-relation 1064. Up to 86 conditions per place. [2024-11-16 23:43:19,151 INFO L140 encePairwiseOnDemand]: 310/313 looper letters, 10 selfloop transitions, 2 changer transitions 0/276 dead transitions. [2024-11-16 23:43:19,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 276 transitions, 651 flow [2024-11-16 23:43:19,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:19,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:19,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 892 transitions. [2024-11-16 23:43:19,153 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9499467518636848 [2024-11-16 23:43:19,153 INFO L175 Difference]: Start difference. First operand has 270 places, 276 transitions, 626 flow. Second operand 3 states and 892 transitions. [2024-11-16 23:43:19,153 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 276 transitions, 651 flow [2024-11-16 23:43:19,155 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 271 places, 276 transitions, 651 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:19,157 INFO L231 Difference]: Finished difference. Result has 271 places, 275 transitions, 628 flow [2024-11-16 23:43:19,157 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=624, PETRI_DIFFERENCE_MINUEND_PLACES=269, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=275, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=273, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=628, PETRI_PLACES=271, PETRI_TRANSITIONS=275} [2024-11-16 23:43:19,157 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -11 predicate places. [2024-11-16 23:43:19,158 INFO L471 AbstractCegarLoop]: Abstraction has has 271 places, 275 transitions, 628 flow [2024-11-16 23:43:19,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 294.6666666666667) internal successors, (884), 3 states have internal predecessors, (884), 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-16 23:43:19,158 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:19,158 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:19,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-16 23:43:19,159 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err3ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:19,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:19,159 INFO L85 PathProgramCache]: Analyzing trace with hash 2134103178, now seen corresponding path program 1 times [2024-11-16 23:43:19,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:19,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911497865] [2024-11-16 23:43:19,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:19,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:19,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:19,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-16 23:43:19,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:19,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911497865] [2024-11-16 23:43:19,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911497865] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:19,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:19,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:19,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104601356] [2024-11-16 23:43:19,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:19,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:19,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:19,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:19,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:19,191 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 294 out of 313 [2024-11-16 23:43:19,192 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 271 places, 275 transitions, 628 flow. Second operand has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-16 23:43:19,192 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:19,192 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 294 of 313 [2024-11-16 23:43:19,192 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:19,285 INFO L124 PetriNetUnfolderBase]: 46/1179 cut-off events. [2024-11-16 23:43:19,285 INFO L125 PetriNetUnfolderBase]: For 13/18 co-relation queries the response was YES. [2024-11-16 23:43:19,288 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1376 conditions, 1179 events. 46/1179 cut-off events. For 13/18 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 7428 event pairs, 4 based on Foata normal form. 0/1100 useless extension candidates. Maximal degree in co-relation 1175. Up to 43 conditions per place. [2024-11-16 23:43:19,290 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 12 selfloop transitions, 2 changer transitions 0/278 dead transitions. [2024-11-16 23:43:19,291 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 271 places, 278 transitions, 665 flow [2024-11-16 23:43:19,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:19,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:19,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 898 transitions. [2024-11-16 23:43:19,292 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9563365282215123 [2024-11-16 23:43:19,292 INFO L175 Difference]: Start difference. First operand has 271 places, 275 transitions, 628 flow. Second operand 3 states and 898 transitions. [2024-11-16 23:43:19,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 271 places, 278 transitions, 665 flow [2024-11-16 23:43:19,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 278 transitions, 661 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-16 23:43:19,296 INFO L231 Difference]: Finished difference. Result has 270 places, 275 transitions, 634 flow [2024-11-16 23:43:19,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=273, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=634, PETRI_PLACES=270, PETRI_TRANSITIONS=275} [2024-11-16 23:43:19,297 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -12 predicate places. [2024-11-16 23:43:19,297 INFO L471 AbstractCegarLoop]: Abstraction has has 270 places, 275 transitions, 634 flow [2024-11-16 23:43:19,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 295.3333333333333) internal successors, (886), 3 states have internal predecessors, (886), 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-16 23:43:19,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:19,298 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:43:19,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-16 23:43:19,298 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:19,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:19,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1923798695, now seen corresponding path program 1 times [2024-11-16 23:43:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:19,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012165705] [2024-11-16 23:43:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:19,333 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-16 23:43:19,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:19,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012165705] [2024-11-16 23:43:19,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012165705] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:19,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:19,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:19,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [503865556] [2024-11-16 23:43:19,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:19,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:19,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:19,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:19,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:19,348 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:19,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 275 transitions, 634 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:19,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:19,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:19,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:19,426 INFO L124 PetriNetUnfolderBase]: 43/1137 cut-off events. [2024-11-16 23:43:19,427 INFO L125 PetriNetUnfolderBase]: For 6/12 co-relation queries the response was YES. [2024-11-16 23:43:19,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1315 conditions, 1137 events. 43/1137 cut-off events. For 6/12 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 7079 event pairs, 3 based on Foata normal form. 0/1063 useless extension candidates. Maximal degree in co-relation 1121. Up to 30 conditions per place. [2024-11-16 23:43:19,433 INFO L140 encePairwiseOnDemand]: 309/313 looper letters, 10 selfloop transitions, 1 changer transitions 0/272 dead transitions. [2024-11-16 23:43:19,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 269 places, 272 transitions, 650 flow [2024-11-16 23:43:19,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:19,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:19,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 887 transitions. [2024-11-16 23:43:19,435 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9446219382321619 [2024-11-16 23:43:19,435 INFO L175 Difference]: Start difference. First operand has 270 places, 275 transitions, 634 flow. Second operand 3 states and 887 transitions. [2024-11-16 23:43:19,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 269 places, 272 transitions, 650 flow [2024-11-16 23:43:19,436 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 269 places, 272 transitions, 650 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-16 23:43:19,438 INFO L231 Difference]: Finished difference. Result has 269 places, 272 transitions, 630 flow [2024-11-16 23:43:19,439 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=628, PETRI_DIFFERENCE_MINUEND_PLACES=267, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=272, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=271, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=630, PETRI_PLACES=269, PETRI_TRANSITIONS=272} [2024-11-16 23:43:19,440 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -13 predicate places. [2024-11-16 23:43:19,440 INFO L471 AbstractCegarLoop]: Abstraction has has 269 places, 272 transitions, 630 flow [2024-11-16 23:43:19,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:19,441 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-16 23:43:19,441 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 23:43:19,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-16 23:43:19,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE === [thread1Err8ASSERT_VIOLATIONDATA_RACE, thread1Err1ASSERT_VIOLATIONDATA_RACE, thread1Err7ASSERT_VIOLATIONDATA_RACE, thread1Err6ASSERT_VIOLATIONDATA_RACE (and 46 more)] === [2024-11-16 23:43:19,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 23:43:19,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1831023864, now seen corresponding path program 1 times [2024-11-16 23:43:19,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 23:43:19,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312397576] [2024-11-16 23:43:19,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 23:43:19,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 23:43:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 23:43:19,478 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-16 23:43:19,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 23:43:19,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312397576] [2024-11-16 23:43:19,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312397576] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 23:43:19,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 23:43:19,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 23:43:19,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908317214] [2024-11-16 23:43:19,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 23:43:19,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 23:43:19,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 23:43:19,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 23:43:19,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 23:43:19,491 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 291 out of 313 [2024-11-16 23:43:19,492 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 269 places, 272 transitions, 630 flow. Second operand has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:19,492 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-16 23:43:19,492 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 291 of 313 [2024-11-16 23:43:19,492 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-16 23:43:19,568 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][169], [Black: 349#true, Black: 323#true, 16#L69true, 233#L50-6true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,569 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,569 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,569 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,569 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,573 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([727] L50-7-->L50-6: Formula: (= |v_#race~result_7~0_3| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_3|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 349#true, Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,574 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-16 23:43:19,574 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,574 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,574 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,575 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([790] thread1EXIT-->L69: Formula: (and (= |v_ULTIMATE.start_main_~t1~0#1_6| v_thread1Thread1of1ForFork1_thidvar0_4) (= 0 v_thread1Thread1of1ForFork1_thidvar1_4)) InVars {ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} OutVars{ULTIMATE.start_main_~t1~0#1=|v_ULTIMATE.start_main_~t1~0#1_6|, thread1Thread1of1ForFork1_thidvar1=v_thread1Thread1of1ForFork1_thidvar1_4, thread1Thread1of1ForFork1_thidvar0=v_thread1Thread1of1ForFork1_thidvar0_4} AuxVars[] AssignedVars[][169], [Black: 349#true, Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,576 INFO L294 olderBase$Statistics]: this new event has 180 ancestors and is cut-off event [2024-11-16 23:43:19,576 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,576 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,576 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is cut-off event [2024-11-16 23:43:19,576 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is cut-off event [2024-11-16 23:43:19,581 INFO L292 olderBase$Statistics]: inserting event number 5 for the transition-marking pair ([727] L50-7-->L50-6: Formula: (= |v_#race~result_7~0_3| |v_thread2Thread1of1ForFork0_#t~nondet12#1_3|) InVars {thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} OutVars{#race~result_7~0=|v_#race~result_7~0_3|, thread2Thread1of1ForFork0_#t~nondet12#1=|v_thread2Thread1of1ForFork0_#t~nondet12#1_3|} AuxVars[] AssignedVars[#race~result_7~0][140], [Black: 349#true, Black: 323#true, 233#L50-6true, 16#L69true, Black: 327#true, 325#(= |#race~isNull_0~0| 0), 344#(= |#race~filename_1~0| 0), Black: 331#true, 329#(= |#race~isNull_3~0| 0), 353#true, Black: 338#true, 351#(= |#race~filename_4~0| 0), Black: 342#true, 356#true, 340#(= |#race~filename_5~0| 0), 333#(= |#race~filename_2~0| 0)]) [2024-11-16 23:43:19,581 INFO L294 olderBase$Statistics]: this new event has 144 ancestors and is not cut-off event [2024-11-16 23:43:19,581 INFO L297 olderBase$Statistics]: existing Event has 144 ancestors and is not cut-off event [2024-11-16 23:43:19,581 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:43:19,581 INFO L297 olderBase$Statistics]: existing Event has 152 ancestors and is not cut-off event [2024-11-16 23:43:19,581 INFO L297 olderBase$Statistics]: existing Event has 180 ancestors and is not cut-off event [2024-11-16 23:43:19,589 INFO L124 PetriNetUnfolderBase]: 47/1092 cut-off events. [2024-11-16 23:43:19,590 INFO L125 PetriNetUnfolderBase]: For 15/18 co-relation queries the response was YES. [2024-11-16 23:43:19,593 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1276 conditions, 1092 events. 47/1092 cut-off events. For 15/18 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 6301 event pairs, 3 based on Foata normal form. 3/1031 useless extension candidates. Maximal degree in co-relation 1078. Up to 47 conditions per place. [2024-11-16 23:43:19,594 INFO L140 encePairwiseOnDemand]: 307/313 looper letters, 0 selfloop transitions, 0 changer transitions 271/271 dead transitions. [2024-11-16 23:43:19,594 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 268 places, 271 transitions, 652 flow [2024-11-16 23:43:19,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 23:43:19,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-16 23:43:19,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 888 transitions. [2024-11-16 23:43:19,598 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.9456869009584664 [2024-11-16 23:43:19,598 INFO L175 Difference]: Start difference. First operand has 269 places, 272 transitions, 630 flow. Second operand 3 states and 888 transitions. [2024-11-16 23:43:19,598 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 268 places, 271 transitions, 652 flow [2024-11-16 23:43:19,600 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 271 transitions, 651 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-16 23:43:19,601 INFO L231 Difference]: Finished difference. Result has 267 places, 0 transitions, 0 flow [2024-11-16 23:43:19,602 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=623, PETRI_DIFFERENCE_MINUEND_PLACES=265, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=269, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=269, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=0, PETRI_PLACES=267, PETRI_TRANSITIONS=0} [2024-11-16 23:43:19,602 INFO L277 CegarLoopForPetriNet]: 282 programPoint places, -15 predicate places. [2024-11-16 23:43:19,602 INFO L471 AbstractCegarLoop]: Abstraction has has 267 places, 0 transitions, 0 flow [2024-11-16 23:43:19,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 293.3333333333333) internal successors, (880), 3 states have internal predecessors, (880), 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-16 23:43:19,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (49 of 50 remaining) [2024-11-16 23:43:19,605 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (48 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (47 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (46 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (45 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (44 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (43 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (42 of 50 remaining) [2024-11-16 23:43:19,606 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (41 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (40 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (39 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (38 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (37 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (36 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (35 of 50 remaining) [2024-11-16 23:43:19,607 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (34 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (33 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (32 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (31 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (30 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (29 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (28 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (27 of 50 remaining) [2024-11-16 23:43:19,608 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (26 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (25 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (24 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (23 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (22 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (21 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (20 of 50 remaining) [2024-11-16 23:43:19,609 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (19 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (18 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err8ASSERT_VIOLATIONDATA_RACE (17 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err1ASSERT_VIOLATIONDATA_RACE (16 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err7ASSERT_VIOLATIONDATA_RACE (15 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err6ASSERT_VIOLATIONDATA_RACE (14 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err0ASSERT_VIOLATIONDATA_RACE (13 of 50 remaining) [2024-11-16 23:43:19,610 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err2ASSERT_VIOLATIONDATA_RACE (12 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err5ASSERT_VIOLATIONDATA_RACE (11 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err4ASSERT_VIOLATIONDATA_RACE (10 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread1Err3ASSERT_VIOLATIONDATA_RACE (9 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err8ASSERT_VIOLATIONDATA_RACE (8 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err1ASSERT_VIOLATIONDATA_RACE (7 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err7ASSERT_VIOLATIONDATA_RACE (6 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err6ASSERT_VIOLATIONDATA_RACE (5 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err0ASSERT_VIOLATIONDATA_RACE (4 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err2ASSERT_VIOLATIONDATA_RACE (3 of 50 remaining) [2024-11-16 23:43:19,611 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err5ASSERT_VIOLATIONDATA_RACE (2 of 50 remaining) [2024-11-16 23:43:19,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err4ASSERT_VIOLATIONDATA_RACE (1 of 50 remaining) [2024-11-16 23:43:19,612 INFO L782 garLoopResultBuilder]: Registering result SAFE for location thread2Err3ASSERT_VIOLATIONDATA_RACE (0 of 50 remaining) [2024-11-16 23:43:19,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-16 23:43:19,612 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 23:43:19,617 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-16 23:43:19,618 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 23:43:19,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:43:19 BasicIcfg [2024-11-16 23:43:19,622 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 23:43:19,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 23:43:19,623 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 23:43:19,623 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 23:43:19,623 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 11:43:16" (3/4) ... [2024-11-16 23:43:19,625 INFO L143 WitnessPrinter]: Generating witness for correct program [2024-11-16 23:43:19,628 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread1 [2024-11-16 23:43:19,628 INFO L393 IcfgBacktranslator]: Ignoring RootEdge to procedure thread2 [2024-11-16 23:43:19,632 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 20 nodes and edges [2024-11-16 23:43:19,632 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-11-16 23:43:19,632 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-16 23:43:19,633 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-16 23:43:19,704 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-16 23:43:19,705 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-16 23:43:19,705 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 23:43:19,705 INFO L158 Benchmark]: Toolchain (without parser) took 4195.32ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 143.3MB in the beginning and 255.3MB in the end (delta: -112.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,706 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 100.7MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:43:19,706 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.83ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 166.7MB in the end (delta: -23.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,706 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.07ms. Allocated memory is still 201.3MB. Free memory was 165.7MB in the beginning and 163.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,706 INFO L158 Benchmark]: Boogie Preprocessor took 24.66ms. Allocated memory is still 201.3MB. Free memory was 163.6MB in the beginning and 162.6MB in the end (delta: 983.3kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 23:43:19,706 INFO L158 Benchmark]: IcfgBuilder took 450.72ms. Allocated memory is still 201.3MB. Free memory was 162.6MB in the beginning and 138.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,707 INFO L158 Benchmark]: TraceAbstraction took 3151.87ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 138.4MB in the beginning and 261.6MB in the end (delta: -123.1MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,707 INFO L158 Benchmark]: Witness Printer took 82.43ms. Allocated memory is still 327.2MB. Free memory was 260.5MB in the beginning and 255.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 23:43:19,708 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.14ms. Allocated memory is still 100.7MB. Free memory is still 53.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.83ms. Allocated memory is still 201.3MB. Free memory was 143.3MB in the beginning and 166.7MB in the end (delta: -23.4MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.07ms. Allocated memory is still 201.3MB. Free memory was 165.7MB in the beginning and 163.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.66ms. Allocated memory is still 201.3MB. Free memory was 163.6MB in the beginning and 162.6MB in the end (delta: 983.3kB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 450.72ms. Allocated memory is still 201.3MB. Free memory was 162.6MB in the beginning and 138.4MB in the end (delta: 24.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 3151.87ms. Allocated memory was 201.3MB in the beginning and 327.2MB in the end (delta: 125.8MB). Free memory was 138.4MB in the beginning and 261.6MB in the end (delta: -123.1MB). Peak memory consumption was 136.9MB. Max. memory is 16.1GB. * Witness Printer took 82.43ms. Allocated memory is still 327.2MB. Free memory was 260.5MB in the beginning and 255.3MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 44]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 50]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 58]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 59]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 60]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 61]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 62]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 63]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 71]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 72]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - PositiveResult [Line: 73]: there are no data races For all program executions holds that there are no data races at this location - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 448 locations, 50 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.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 351 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 106 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 403 IncrementalHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 106 mSDtfsCounter, 403 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=634occurred in iteration=14, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1158 NumberOfCodeBlocks, 1158 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 1142 ConstructedInterpolants, 0 QuantifiedInterpolants, 1174 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 30 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-16 23:43:19,733 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE