./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/no-data-race.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for data races Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! data-race) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 13:39:36,735 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 13:39:36,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DataRace-32bit-Automizer_Default.epf [2024-11-20 13:39:36,793 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 13:39:36,794 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 13:39:36,814 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 13:39:36,814 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 13:39:36,814 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 13:39:36,815 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 13:39:36,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 13:39:36,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 13:39:36,818 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 13:39:36,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 13:39:36,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 13:39:36,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 13:39:36,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 13:39:36,820 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 13:39:36,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 13:39:36,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 13:39:36,821 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 13:39:36,821 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 13:39:36,821 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 13:39:36,822 INFO L153 SettingsManager]: * Check absence of data races in concurrent programs=true [2024-11-20 13:39:36,822 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 13:39:36,822 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 13:39:36,822 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 13:39:36,822 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 13:39:36,823 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 13:39:36,823 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 13:39:36,824 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 13:39:36,824 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 13:39:36,824 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:39:36,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 13:39:36,825 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 13:39:36,825 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 13:39:36,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 13:39:36,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 13:39:36,826 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 13:39:36,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 13:39:36,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 13:39:36,826 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 13:39:36,827 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 -> a0f042164bf78d3595348b117153fa7346585efa21c060e488a9879023a64e1b [2024-11-20 13:39:37,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 13:39:37,041 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 13:39:37,043 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 13:39:37,044 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 13:39:37,045 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 13:39:37,046 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i [2024-11-20 13:39:38,304 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 13:39:38,492 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 13:39:38,493 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-lit/qw2004-2.i [2024-11-20 13:39:38,502 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025a9621e/3d15a6cc642b4b288bc12a048d5a182d/FLAG6d5277744 [2024-11-20 13:39:38,854 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/025a9621e/3d15a6cc642b4b288bc12a048d5a182d [2024-11-20 13:39:38,856 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 13:39:38,858 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 13:39:38,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 13:39:38,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 13:39:38,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 13:39:38,865 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:39:38" (1/1) ... [2024-11-20 13:39:38,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48847a16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:38, skipping insertion in model container [2024-11-20 13:39:38,865 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 01:39:38" (1/1) ... [2024-11-20 13:39:38,897 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 13:39:39,182 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:39:39,190 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 13:39:39,235 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 13:39:39,267 INFO L204 MainTranslator]: Completed translation [2024-11-20 13:39:39,268 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39 WrapperNode [2024-11-20 13:39:39,268 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 13:39:39,269 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 13:39:39,269 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 13:39:39,269 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 13:39:39,275 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,288 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,311 INFO L138 Inliner]: procedures = 174, calls = 29, calls flagged for inlining = 10, calls inlined = 11, statements flattened = 170 [2024-11-20 13:39:39,313 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 13:39:39,314 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 13:39:39,314 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 13:39:39,315 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 13:39:39,321 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,323 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,326 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,329 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,334 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,340 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,342 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 13:39:39,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 13:39:39,343 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 13:39:39,343 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 13:39:39,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (1/1) ... [2024-11-20 13:39:39,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 13:39:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 13:39:39,373 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-20 13:39:39,379 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-20 13:39:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure BCSP_PnpStop [2024-11-20 13:39:39,413 INFO L138 BoogieDeclarations]: Found implementation of procedure BCSP_PnpStop [2024-11-20 13:39:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-20 13:39:39,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 13:39:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-20 13:39:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-20 13:39:39,414 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 13:39:39,414 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 13:39:39,415 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-20 13:39:39,508 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 13:39:39,510 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 13:39:39,689 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-20 13:39:39,689 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 13:39:39,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 13:39:39,764 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-20 13:39:39,764 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:39:39 BoogieIcfgContainer [2024-11-20 13:39:39,764 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 13:39:39,766 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 13:39:39,766 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 13:39:39,769 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 13:39:39,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 01:39:38" (1/3) ... [2024-11-20 13:39:39,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab8fc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:39:39, skipping insertion in model container [2024-11-20 13:39:39,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 01:39:39" (2/3) ... [2024-11-20 13:39:39,770 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ab8fc90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 01:39:39, skipping insertion in model container [2024-11-20 13:39:39,770 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:39:39" (3/3) ... [2024-11-20 13:39:39,771 INFO L112 eAbstractionObserver]: Analyzing ICFG qw2004-2.i [2024-11-20 13:39:39,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 13:39:39,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 19 error locations. [2024-11-20 13:39:39,784 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-20 13:39:39,831 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-20 13:39:39,860 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 153 transitions, 310 flow [2024-11-20 13:39:39,903 INFO L124 PetriNetUnfolderBase]: 7/152 cut-off events. [2024-11-20 13:39:39,903 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:39,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 152 events. 7/152 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 219 event pairs, 0 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2024-11-20 13:39:39,914 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 153 transitions, 310 flow [2024-11-20 13:39:39,919 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 152 transitions, 307 flow [2024-11-20 13:39:39,925 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 13:39:39,930 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;@3205e694, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 13:39:39,930 INFO L334 AbstractCegarLoop]: Starting to check reachability of 27 error locations. [2024-11-20 13:39:39,935 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-20 13:39:39,936 INFO L124 PetriNetUnfolderBase]: 0/16 cut-off events. [2024-11-20 13:39:39,936 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:39,936 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:39,936 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:39,937 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:39,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:39,941 INFO L85 PathProgramCache]: Analyzing trace with hash 2080314901, now seen corresponding path program 1 times [2024-11-20 13:39:39,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:39,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [163236040] [2024-11-20 13:39:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:39,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,098 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-20 13:39:40,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [163236040] [2024-11-20 13:39:40,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [163236040] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:40,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164377436] [2024-11-20 13:39:40,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:40,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:40,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:40,184 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2024-11-20 13:39:40,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 152 transitions, 307 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:40,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2024-11-20 13:39:40,188 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:40,293 INFO L124 PetriNetUnfolderBase]: 37/402 cut-off events. [2024-11-20 13:39:40,293 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-20 13:39:40,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 402 events. 37/402 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1666 event pairs, 17 based on Foata normal form. 15/369 useless extension candidates. Maximal degree in co-relation 421. Up to 64 conditions per place. [2024-11-20 13:39:40,299 INFO L140 encePairwiseOnDemand]: 134/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/133 dead transitions. [2024-11-20 13:39:40,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 133 transitions, 301 flow [2024-11-20 13:39:40,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:40,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:40,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 390 transitions. [2024-11-20 13:39:40,309 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8496732026143791 [2024-11-20 13:39:40,310 INFO L175 Difference]: Start difference. First operand has 149 places, 152 transitions, 307 flow. Second operand 3 states and 390 transitions. [2024-11-20 13:39:40,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 133 transitions, 301 flow [2024-11-20 13:39:40,313 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 133 transitions, 300 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-20 13:39:40,316 INFO L231 Difference]: Finished difference. Result has 134 places, 133 transitions, 272 flow [2024-11-20 13:39:40,317 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=133, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=272, PETRI_PLACES=134, PETRI_TRANSITIONS=133} [2024-11-20 13:39:40,321 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -15 predicate places. [2024-11-20 13:39:40,321 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 133 transitions, 272 flow [2024-11-20 13:39:40,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,322 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:40,322 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:40,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 13:39:40,323 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:40,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:40,324 INFO L85 PathProgramCache]: Analyzing trace with hash -306112500, now seen corresponding path program 1 times [2024-11-20 13:39:40,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:40,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997133112] [2024-11-20 13:39:40,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:40,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,376 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-20 13:39:40,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997133112] [2024-11-20 13:39:40,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997133112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:40,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212113880] [2024-11-20 13:39:40,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:40,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:40,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2024-11-20 13:39:40,392 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 133 transitions, 272 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:40,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2024-11-20 13:39:40,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:40,450 INFO L124 PetriNetUnfolderBase]: 37/401 cut-off events. [2024-11-20 13:39:40,450 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:40,454 INFO L83 FinitePrefix]: Finished finitePrefix Result has 473 conditions, 401 events. 37/401 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1665 event pairs, 17 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 449. Up to 64 conditions per place. [2024-11-20 13:39:40,455 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/132 dead transitions. [2024-11-20 13:39:40,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 132 transitions, 302 flow [2024-11-20 13:39:40,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:40,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-20 13:39:40,459 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2024-11-20 13:39:40,459 INFO L175 Difference]: Start difference. First operand has 134 places, 133 transitions, 272 flow. Second operand 3 states and 374 transitions. [2024-11-20 13:39:40,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 132 transitions, 302 flow [2024-11-20 13:39:40,460 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:40,463 INFO L231 Difference]: Finished difference. Result has 133 places, 132 transitions, 270 flow [2024-11-20 13:39:40,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=130, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=133, PETRI_TRANSITIONS=132} [2024-11-20 13:39:40,464 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -16 predicate places. [2024-11-20 13:39:40,465 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 132 transitions, 270 flow [2024-11-20 13:39:40,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,466 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:40,466 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] [2024-11-20 13:39:40,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 13:39:40,466 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:40,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:40,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1546925183, now seen corresponding path program 1 times [2024-11-20 13:39:40,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:40,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611778807] [2024-11-20 13:39:40,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:40,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,499 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-20 13:39:40,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611778807] [2024-11-20 13:39:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611778807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:40,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493024448] [2024-11-20 13:39:40,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,500 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:40,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:40,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:40,507 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2024-11-20 13:39:40,508 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 132 transitions, 270 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,508 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:40,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2024-11-20 13:39:40,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:40,575 INFO L124 PetriNetUnfolderBase]: 37/400 cut-off events. [2024-11-20 13:39:40,576 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:40,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 472 conditions, 400 events. 37/400 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 1664 event pairs, 17 based on Foata normal form. 0/354 useless extension candidates. Maximal degree in co-relation 443. Up to 64 conditions per place. [2024-11-20 13:39:40,577 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 14 selfloop transitions, 2 changer transitions 0/131 dead transitions. [2024-11-20 13:39:40,577 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 134 places, 131 transitions, 300 flow [2024-11-20 13:39:40,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:40,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:40,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2024-11-20 13:39:40,579 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8148148148148148 [2024-11-20 13:39:40,579 INFO L175 Difference]: Start difference. First operand has 133 places, 132 transitions, 270 flow. Second operand 3 states and 374 transitions. [2024-11-20 13:39:40,579 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 134 places, 131 transitions, 300 flow [2024-11-20 13:39:40,580 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:40,583 INFO L231 Difference]: Finished difference. Result has 132 places, 131 transitions, 268 flow [2024-11-20 13:39:40,583 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=129, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=131} [2024-11-20 13:39:40,584 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -17 predicate places. [2024-11-20 13:39:40,585 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 131 transitions, 268 flow [2024-11-20 13:39:40,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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-20 13:39:40,585 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:40,586 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-20 13:39:40,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 13:39:40,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:40,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:40,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1630333190, now seen corresponding path program 1 times [2024-11-20 13:39:40,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:40,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324016346] [2024-11-20 13:39:40,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:40,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,641 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-20 13:39:40,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324016346] [2024-11-20 13:39:40,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324016346] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:40,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534561273] [2024-11-20 13:39:40,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:40,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:40,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:40,671 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2024-11-20 13:39:40,671 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 131 transitions, 268 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-20 13:39:40,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:40,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2024-11-20 13:39:40,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:40,723 INFO L124 PetriNetUnfolderBase]: 52/426 cut-off events. [2024-11-20 13:39:40,723 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:40,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 426 events. 52/426 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 1901 event pairs, 27 based on Foata normal form. 0/379 useless extension candidates. Maximal degree in co-relation 494. Up to 94 conditions per place. [2024-11-20 13:39:40,725 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 16 selfloop transitions, 2 changer transitions 0/130 dead transitions. [2024-11-20 13:39:40,726 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 133 places, 130 transitions, 302 flow [2024-11-20 13:39:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:40,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:40,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2024-11-20 13:39:40,727 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8061002178649237 [2024-11-20 13:39:40,728 INFO L175 Difference]: Start difference. First operand has 132 places, 131 transitions, 268 flow. Second operand 3 states and 370 transitions. [2024-11-20 13:39:40,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 133 places, 130 transitions, 302 flow [2024-11-20 13:39:40,729 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 130 transitions, 298 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:40,731 INFO L231 Difference]: Finished difference. Result has 131 places, 130 transitions, 266 flow [2024-11-20 13:39:40,732 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=266, PETRI_PLACES=131, PETRI_TRANSITIONS=130} [2024-11-20 13:39:40,733 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -18 predicate places. [2024-11-20 13:39:40,733 INFO L471 AbstractCegarLoop]: Abstraction has has 131 places, 130 transitions, 266 flow [2024-11-20 13:39:40,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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-20 13:39:40,734 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:40,734 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] [2024-11-20 13:39:40,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 13:39:40,734 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:40,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:40,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1645077027, now seen corresponding path program 1 times [2024-11-20 13:39:40,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:40,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726422399] [2024-11-20 13:39:40,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:40,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,862 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-20 13:39:40,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726422399] [2024-11-20 13:39:40,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726422399] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:39:40,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986407170] [2024-11-20 13:39:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:39:40,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:39:40,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:39:40,871 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 153 [2024-11-20 13:39:40,872 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 130 transitions, 266 flow. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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-20 13:39:40,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:40,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 153 [2024-11-20 13:39:40,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:40,948 INFO L124 PetriNetUnfolderBase]: 55/439 cut-off events. [2024-11-20 13:39:40,948 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-20 13:39:40,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 543 conditions, 439 events. 55/439 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 2055 event pairs, 13 based on Foata normal form. 0/394 useless extension candidates. Maximal degree in co-relation 503. Up to 53 conditions per place. [2024-11-20 13:39:40,950 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 23 selfloop transitions, 7 changer transitions 0/144 dead transitions. [2024-11-20 13:39:40,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 354 flow [2024-11-20 13:39:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 13:39:40,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-20 13:39:40,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 632 transitions. [2024-11-20 13:39:40,952 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8261437908496732 [2024-11-20 13:39:40,952 INFO L175 Difference]: Start difference. First operand has 131 places, 130 transitions, 266 flow. Second operand 5 states and 632 transitions. [2024-11-20 13:39:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 354 flow [2024-11-20 13:39:40,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 144 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:40,955 INFO L231 Difference]: Finished difference. Result has 137 places, 135 transitions, 310 flow [2024-11-20 13:39:40,956 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=310, PETRI_PLACES=137, PETRI_TRANSITIONS=135} [2024-11-20 13:39:40,957 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -12 predicate places. [2024-11-20 13:39:40,958 INFO L471 AbstractCegarLoop]: Abstraction has has 137 places, 135 transitions, 310 flow [2024-11-20 13:39:40,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 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-20 13:39:40,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:40,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:40,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 13:39:40,959 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:40,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:40,961 INFO L85 PathProgramCache]: Analyzing trace with hash 14998367, now seen corresponding path program 1 times [2024-11-20 13:39:40,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:40,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107426709] [2024-11-20 13:39:40,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:40,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:40,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:40,991 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-20 13:39:40,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:40,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107426709] [2024-11-20 13:39:40,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107426709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:40,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:40,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:40,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17233560] [2024-11-20 13:39:40,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:40,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:40,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:40,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:40,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:41,004 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2024-11-20 13:39:41,005 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 135 transitions, 310 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-20 13:39:41,005 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:41,005 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2024-11-20 13:39:41,005 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:41,067 INFO L124 PetriNetUnfolderBase]: 63/604 cut-off events. [2024-11-20 13:39:41,067 INFO L125 PetriNetUnfolderBase]: For 40/43 co-relation queries the response was YES. [2024-11-20 13:39:41,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 773 conditions, 604 events. 63/604 cut-off events. For 40/43 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 3256 event pairs, 17 based on Foata normal form. 0/559 useless extension candidates. Maximal degree in co-relation 724. Up to 76 conditions per place. [2024-11-20 13:39:41,070 INFO L140 encePairwiseOnDemand]: 149/153 looper letters, 22 selfloop transitions, 3 changer transitions 0/143 dead transitions. [2024-11-20 13:39:41,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 143 transitions, 380 flow [2024-11-20 13:39:41,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:41,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:41,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 387 transitions. [2024-11-20 13:39:41,071 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8431372549019608 [2024-11-20 13:39:41,071 INFO L175 Difference]: Start difference. First operand has 137 places, 135 transitions, 310 flow. Second operand 3 states and 387 transitions. [2024-11-20 13:39:41,071 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 143 transitions, 380 flow [2024-11-20 13:39:41,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 143 transitions, 380 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-20 13:39:41,074 INFO L231 Difference]: Finished difference. Result has 141 places, 137 transitions, 332 flow [2024-11-20 13:39:41,074 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=310, PETRI_DIFFERENCE_MINUEND_PLACES=137, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=135, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=332, PETRI_PLACES=141, PETRI_TRANSITIONS=137} [2024-11-20 13:39:41,076 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -8 predicate places. [2024-11-20 13:39:41,076 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 137 transitions, 332 flow [2024-11-20 13:39:41,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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-20 13:39:41,077 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:41,077 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:41,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 13:39:41,077 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:41,077 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:41,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1440972180, now seen corresponding path program 1 times [2024-11-20 13:39:41,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:41,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57702520] [2024-11-20 13:39:41,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:41,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:41,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:41,171 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-20 13:39:41,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:41,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57702520] [2024-11-20 13:39:41,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57702520] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:41,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:41,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 13:39:41,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629915429] [2024-11-20 13:39:41,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:41,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 13:39:41,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:41,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 13:39:41,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-20 13:39:41,193 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 153 [2024-11-20 13:39:41,194 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 137 transitions, 332 flow. Second operand has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-20 13:39:41,194 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:41,194 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 153 [2024-11-20 13:39:41,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:41,368 INFO L124 PetriNetUnfolderBase]: 166/881 cut-off events. [2024-11-20 13:39:41,369 INFO L125 PetriNetUnfolderBase]: For 61/64 co-relation queries the response was YES. [2024-11-20 13:39:41,370 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1291 conditions, 881 events. 166/881 cut-off events. For 61/64 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5811 event pairs, 6 based on Foata normal form. 0/814 useless extension candidates. Maximal degree in co-relation 1239. Up to 167 conditions per place. [2024-11-20 13:39:41,371 INFO L140 encePairwiseOnDemand]: 145/153 looper letters, 25 selfloop transitions, 3 changer transitions 30/174 dead transitions. [2024-11-20 13:39:41,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 174 transitions, 536 flow [2024-11-20 13:39:41,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 13:39:41,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-20 13:39:41,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1228 transitions. [2024-11-20 13:39:41,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8026143790849674 [2024-11-20 13:39:41,375 INFO L175 Difference]: Start difference. First operand has 141 places, 137 transitions, 332 flow. Second operand 10 states and 1228 transitions. [2024-11-20 13:39:41,375 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 174 transitions, 536 flow [2024-11-20 13:39:41,379 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 174 transitions, 530 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-20 13:39:41,380 INFO L231 Difference]: Finished difference. Result has 155 places, 138 transitions, 361 flow [2024-11-20 13:39:41,381 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=326, PETRI_DIFFERENCE_MINUEND_PLACES=139, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=361, PETRI_PLACES=155, PETRI_TRANSITIONS=138} [2024-11-20 13:39:41,381 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places. [2024-11-20 13:39:41,382 INFO L471 AbstractCegarLoop]: Abstraction has has 155 places, 138 transitions, 361 flow [2024-11-20 13:39:41,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 119.0) internal successors, (714), 6 states have internal predecessors, (714), 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-20 13:39:41,382 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:41,383 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-20 13:39:41,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 13:39:41,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:41,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:41,384 INFO L85 PathProgramCache]: Analyzing trace with hash 771969135, now seen corresponding path program 1 times [2024-11-20 13:39:41,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:41,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972670085] [2024-11-20 13:39:41,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:41,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:41,424 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-20 13:39:41,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:41,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972670085] [2024-11-20 13:39:41,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972670085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:41,425 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:41,425 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 13:39:41,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269418832] [2024-11-20 13:39:41,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:41,426 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 13:39:41,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:41,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 13:39:41,426 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 13:39:41,436 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 153 [2024-11-20 13:39:41,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 138 transitions, 361 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-20 13:39:41,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:41,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 153 [2024-11-20 13:39:41,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:41,506 INFO L124 PetriNetUnfolderBase]: 105/797 cut-off events. [2024-11-20 13:39:41,506 INFO L125 PetriNetUnfolderBase]: For 312/319 co-relation queries the response was YES. [2024-11-20 13:39:41,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1279 conditions, 797 events. 105/797 cut-off events. For 312/319 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 4804 event pairs, 33 based on Foata normal form. 0/747 useless extension candidates. Maximal degree in co-relation 1220. Up to 159 conditions per place. [2024-11-20 13:39:41,509 INFO L140 encePairwiseOnDemand]: 148/153 looper letters, 20 selfloop transitions, 4 changer transitions 7/146 dead transitions. [2024-11-20 13:39:41,509 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 146 transitions, 449 flow [2024-11-20 13:39:41,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 13:39:41,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-20 13:39:41,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2024-11-20 13:39:41,511 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8344226579520697 [2024-11-20 13:39:41,511 INFO L175 Difference]: Start difference. First operand has 155 places, 138 transitions, 361 flow. Second operand 3 states and 383 transitions. [2024-11-20 13:39:41,511 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 146 transitions, 449 flow [2024-11-20 13:39:41,513 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 146 transitions, 440 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-20 13:39:41,515 INFO L231 Difference]: Finished difference. Result has 147 places, 136 transitions, 366 flow [2024-11-20 13:39:41,515 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=138, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=134, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=366, PETRI_PLACES=147, PETRI_TRANSITIONS=136} [2024-11-20 13:39:41,515 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, -2 predicate places. [2024-11-20 13:39:41,516 INFO L471 AbstractCegarLoop]: Abstraction has has 147 places, 136 transitions, 366 flow [2024-11-20 13:39:41,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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-20 13:39:41,516 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:41,516 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] [2024-11-20 13:39:41,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 13:39:41,516 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:41,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:41,517 INFO L85 PathProgramCache]: Analyzing trace with hash 332444654, now seen corresponding path program 1 times [2024-11-20 13:39:41,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:41,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792175463] [2024-11-20 13:39:41,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:41,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:41,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:41,566 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-20 13:39:41,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:41,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792175463] [2024-11-20 13:39:41,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792175463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:41,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:41,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 13:39:41,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431727925] [2024-11-20 13:39:41,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:41,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 13:39:41,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:41,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 13:39:41,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 13:39:41,583 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 153 [2024-11-20 13:39:41,584 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 136 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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-20 13:39:41,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:41,585 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 153 [2024-11-20 13:39:41,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:41,742 INFO L124 PetriNetUnfolderBase]: 101/979 cut-off events. [2024-11-20 13:39:41,743 INFO L125 PetriNetUnfolderBase]: For 341/353 co-relation queries the response was YES. [2024-11-20 13:39:41,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1523 conditions, 979 events. 101/979 cut-off events. For 341/353 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 6345 event pairs, 62 based on Foata normal form. 4/930 useless extension candidates. Maximal degree in co-relation 1467. Up to 173 conditions per place. [2024-11-20 13:39:41,746 INFO L140 encePairwiseOnDemand]: 147/153 looper letters, 21 selfloop transitions, 0 changer transitions 20/154 dead transitions. [2024-11-20 13:39:41,746 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 152 places, 154 transitions, 506 flow [2024-11-20 13:39:41,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 13:39:41,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-20 13:39:41,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 735 transitions. [2024-11-20 13:39:41,749 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8006535947712419 [2024-11-20 13:39:41,749 INFO L175 Difference]: Start difference. First operand has 147 places, 136 transitions, 366 flow. Second operand 6 states and 735 transitions. [2024-11-20 13:39:41,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 152 places, 154 transitions, 506 flow [2024-11-20 13:39:41,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 149 places, 154 transitions, 492 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-20 13:39:41,754 INFO L231 Difference]: Finished difference. Result has 153 places, 134 transitions, 360 flow [2024-11-20 13:39:41,755 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=153, PETRI_TRANSITIONS=134} [2024-11-20 13:39:41,755 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, 4 predicate places. [2024-11-20 13:39:41,756 INFO L471 AbstractCegarLoop]: Abstraction has has 153 places, 134 transitions, 360 flow [2024-11-20 13:39:41,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 118.8) internal successors, (594), 5 states have internal predecessors, (594), 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-20 13:39:41,756 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:41,756 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] [2024-11-20 13:39:41,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 13:39:41,757 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:41,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1602492005, now seen corresponding path program 1 times [2024-11-20 13:39:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:41,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220793524] [2024-11-20 13:39:41,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:41,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:41,923 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-20 13:39:41,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220793524] [2024-11-20 13:39:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220793524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 13:39:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948637933] [2024-11-20 13:39:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:41,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 13:39:41,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:41,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 13:39:41,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-20 13:39:41,988 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 153 [2024-11-20 13:39:41,989 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 153 places, 134 transitions, 360 flow. Second operand has 9 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 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-20 13:39:41,989 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:41,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 153 [2024-11-20 13:39:41,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:42,354 INFO L124 PetriNetUnfolderBase]: 234/2281 cut-off events. [2024-11-20 13:39:42,354 INFO L125 PetriNetUnfolderBase]: For 356/365 co-relation queries the response was YES. [2024-11-20 13:39:42,357 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3329 conditions, 2281 events. 234/2281 cut-off events. For 356/365 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 20519 event pairs, 73 based on Foata normal form. 5/2196 useless extension candidates. Maximal degree in co-relation 3312. Up to 272 conditions per place. [2024-11-20 13:39:42,359 INFO L140 encePairwiseOnDemand]: 140/153 looper letters, 61 selfloop transitions, 7 changer transitions 54/227 dead transitions. [2024-11-20 13:39:42,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 169 places, 227 transitions, 853 flow [2024-11-20 13:39:42,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-11-20 13:39:42,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2024-11-20 13:39:42,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2430 transitions. [2024-11-20 13:39:42,364 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7563025210084033 [2024-11-20 13:39:42,364 INFO L175 Difference]: Start difference. First operand has 153 places, 134 transitions, 360 flow. Second operand 21 states and 2430 transitions. [2024-11-20 13:39:42,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 169 places, 227 transitions, 853 flow [2024-11-20 13:39:42,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 165 places, 227 transitions, 843 flow, removed 5 selfloop flow, removed 4 redundant places. [2024-11-20 13:39:42,370 INFO L231 Difference]: Finished difference. Result has 183 places, 138 transitions, 431 flow [2024-11-20 13:39:42,371 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=350, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=431, PETRI_PLACES=183, PETRI_TRANSITIONS=138} [2024-11-20 13:39:42,371 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, 34 predicate places. [2024-11-20 13:39:42,371 INFO L471 AbstractCegarLoop]: Abstraction has has 183 places, 138 transitions, 431 flow [2024-11-20 13:39:42,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 112.66666666666667) internal successors, (1014), 9 states have internal predecessors, (1014), 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-20 13:39:42,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:42,372 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] [2024-11-20 13:39:42,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 13:39:42,373 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:42,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:42,373 INFO L85 PathProgramCache]: Analyzing trace with hash -213544983, now seen corresponding path program 2 times [2024-11-20 13:39:42,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:42,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383630945] [2024-11-20 13:39:42,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:42,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:42,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 13:39:42,415 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-20 13:39:42,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 13:39:42,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383630945] [2024-11-20 13:39:42,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383630945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 13:39:42,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 13:39:42,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 13:39:42,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85348936] [2024-11-20 13:39:42,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 13:39:42,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 13:39:42,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 13:39:42,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 13:39:42,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 13:39:42,426 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 153 [2024-11-20 13:39:42,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 183 places, 138 transitions, 431 flow. Second operand has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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-20 13:39:42,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-20 13:39:42,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 153 [2024-11-20 13:39:42,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-20 13:39:42,503 INFO L124 PetriNetUnfolderBase]: 57/781 cut-off events. [2024-11-20 13:39:42,503 INFO L125 PetriNetUnfolderBase]: For 781/804 co-relation queries the response was YES. [2024-11-20 13:39:42,505 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1393 conditions, 781 events. 57/781 cut-off events. For 781/804 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4546 event pairs, 28 based on Foata normal form. 10/748 useless extension candidates. Maximal degree in co-relation 1361. Up to 91 conditions per place. [2024-11-20 13:39:42,506 INFO L140 encePairwiseOnDemand]: 150/153 looper letters, 20 selfloop transitions, 1 changer transitions 7/143 dead transitions. [2024-11-20 13:39:42,507 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 172 places, 143 transitions, 503 flow [2024-11-20 13:39:42,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 13:39:42,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-20 13:39:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 507 transitions. [2024-11-20 13:39:42,508 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8284313725490197 [2024-11-20 13:39:42,508 INFO L175 Difference]: Start difference. First operand has 183 places, 138 transitions, 431 flow. Second operand 4 states and 507 transitions. [2024-11-20 13:39:42,508 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 172 places, 143 transitions, 503 flow [2024-11-20 13:39:42,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 162 places, 143 transitions, 478 flow, removed 8 selfloop flow, removed 10 redundant places. [2024-11-20 13:39:42,512 INFO L231 Difference]: Finished difference. Result has 162 places, 134 transitions, 388 flow [2024-11-20 13:39:42,512 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=159, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=136, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=388, PETRI_PLACES=162, PETRI_TRANSITIONS=134} [2024-11-20 13:39:42,512 INFO L277 CegarLoopForPetriNet]: 149 programPoint places, 13 predicate places. [2024-11-20 13:39:42,513 INFO L471 AbstractCegarLoop]: Abstraction has has 162 places, 134 transitions, 388 flow [2024-11-20 13:39:42,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 124.25) internal successors, (497), 4 states have internal predecessors, (497), 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-20 13:39:42,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-20 13:39:42,513 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] [2024-11-20 13:39:42,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 13:39:42,514 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE === [BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE, BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (and 24 more)] === [2024-11-20 13:39:42,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 13:39:42,514 INFO L85 PathProgramCache]: Analyzing trace with hash 2144852204, now seen corresponding path program 1 times [2024-11-20 13:39:42,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 13:39:42,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893825194] [2024-11-20 13:39:42,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 13:39:42,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 13:39:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:42,526 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 13:39:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 13:39:42,555 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 13:39:42,555 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 13:39:42,556 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (26 of 27 remaining) [2024-11-20 13:39:42,557 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (25 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (24 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (23 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (22 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (21 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (20 of 27 remaining) [2024-11-20 13:39:42,558 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr6ASSERT_VIOLATIONDATA_RACE (19 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONDATA_RACE (18 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONDATA_RACE (17 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONDATA_RACE (16 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONDATA_RACE (15 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONDATA_RACE (14 of 27 remaining) [2024-11-20 13:39:42,559 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONDATA_RACE (13 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6ASSERT_VIOLATIONDATA_RACE (12 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONDATA_RACE (11 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONDATA_RACE (10 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONDATA_RACE (9 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONDATA_RACE (8 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONDATA_RACE (7 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 27 remaining) [2024-11-20 13:39:42,560 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr0ASSERT_VIOLATIONDATA_RACE (5 of 27 remaining) [2024-11-20 13:39:42,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr1ASSERT_VIOLATIONDATA_RACE (4 of 27 remaining) [2024-11-20 13:39:42,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr2ASSERT_VIOLATIONDATA_RACE (3 of 27 remaining) [2024-11-20 13:39:42,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr3ASSERT_VIOLATIONDATA_RACE (2 of 27 remaining) [2024-11-20 13:39:42,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr4ASSERT_VIOLATIONDATA_RACE (1 of 27 remaining) [2024-11-20 13:39:42,561 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location BCSP_PnpStopErr5ASSERT_VIOLATIONDATA_RACE (0 of 27 remaining) [2024-11-20 13:39:42,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 13:39:42,561 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 13:39:42,616 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-20 13:39:42,616 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 13:39:42,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 01:39:42 BasicIcfg [2024-11-20 13:39:42,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 13:39:42,620 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 13:39:42,620 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 13:39:42,620 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 13:39:42,621 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 01:39:39" (3/4) ... [2024-11-20 13:39:42,621 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-20 13:39:42,672 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 13:39:42,672 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 13:39:42,672 INFO L158 Benchmark]: Toolchain (without parser) took 3814.72ms. Allocated memory was 146.8MB in the beginning and 251.7MB in the end (delta: 104.9MB). Free memory was 74.9MB in the beginning and 87.6MB in the end (delta: -12.7MB). Peak memory consumption was 94.4MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,672 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 146.8MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 13:39:42,672 INFO L158 Benchmark]: CACSL2BoogieTranslator took 408.01ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 74.6MB in the beginning and 170.8MB in the end (delta: -96.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,673 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.67ms. Allocated memory is still 209.7MB. Free memory was 170.8MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,673 INFO L158 Benchmark]: Boogie Preprocessor took 28.31ms. Allocated memory is still 209.7MB. Free memory was 167.7MB in the beginning and 166.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,673 INFO L158 Benchmark]: RCFGBuilder took 421.75ms. Allocated memory is still 209.7MB. Free memory was 166.6MB in the beginning and 141.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,677 INFO L158 Benchmark]: TraceAbstraction took 2853.87ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 141.5MB in the beginning and 97.0MB in the end (delta: 44.5MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,677 INFO L158 Benchmark]: Witness Printer took 51.57ms. Allocated memory is still 251.7MB. Free memory was 97.0MB in the beginning and 87.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-20 13:39:42,678 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.09ms. Allocated memory is still 146.8MB. Free memory is still 96.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 408.01ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 74.6MB in the beginning and 170.8MB in the end (delta: -96.3MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.67ms. Allocated memory is still 209.7MB. Free memory was 170.8MB in the beginning and 167.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.31ms. Allocated memory is still 209.7MB. Free memory was 167.7MB in the beginning and 166.6MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 421.75ms. Allocated memory is still 209.7MB. Free memory was 166.6MB in the beginning and 141.5MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 2853.87ms. Allocated memory was 209.7MB in the beginning and 251.7MB in the end (delta: 41.9MB). Free memory was 141.5MB in the beginning and 97.0MB in the end (delta: 44.5MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 51.57ms. Allocated memory is still 251.7MB. Free memory was 97.0MB in the beginning and 87.6MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - DataRaceFoundResult [Line: 751]: Data race detected Data race detected The following path leads to a data race: [L697] 0 volatile int stoppingFlag; VAL [stoppingFlag=0] [L698] 0 volatile int pendingIo; VAL [pendingIo=0, stoppingFlag=0] [L699] 0 volatile int stoppingEvent; VAL [pendingIo=0, stoppingEvent=0, stoppingFlag=0] [L700] 0 volatile int stopped; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L755] 0 pthread_t t; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=0] [L756] 0 pendingIo = 1 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L757] 0 stoppingFlag = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L758] 0 stoppingEvent = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L759] 0 stopped = 0 VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L760] FCALL, FORK 0 pthread_create(&t, 0, BCSP_PnpStop, 0) VAL [pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0, t=-1] [L761] CALL 0 BCSP_PnpAdd(0) [L734] 0 int status; [L735] CALL, EXPR 0 BCSP_IoIncrement() [L703] 0 int lsf = stoppingFlag; VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L705] COND FALSE 0 !(\read(lsf)) VAL [lsf=0, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=0] [L744] 1 stoppingFlag = 1 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, stopped=0, stoppingEvent=0, stoppingFlag=1] [L746] CALL 1 BCSP_IoDecrement() [L725] 1 int pending; [L726] CALL, EXPR 1 dec() [L719] 1 pendingIo-- [L720] 1 int tmp = pendingIo; VAL [pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L722] 1 return tmp; VAL [\result=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1, tmp=0] [L726] RET, EXPR 1 dec() [L726] 1 pending = dec() VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L727] COND TRUE 1 pending == 0 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=0, stoppingFlag=1] [L729] 1 stoppingEvent = 1 VAL [pending=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L746] RET 1 BCSP_IoDecrement() [L748] 1 int lse = stoppingEvent; VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L709] 0 int lp = pendingIo; VAL [lp=0, lsf=0, pendingIo=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L712] 0 pendingIo = lp + 1 VAL [lp=0, lsf=0, pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L715] 0 return 0; VAL [\result=0, lsf=0, pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L735] RET, EXPR 0 BCSP_IoIncrement() [L735] 0 status = BCSP_IoIncrement() VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L736] COND TRUE 0 status == 0 VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] CALL 1 assume_abort_if_not(lse) [L686] COND FALSE 1 !(!cond) VAL [\old(cond)=1, cond=1, pendingIo=1, stopped=0, stoppingEvent=1, stoppingFlag=1] [L750] RET 1 assume_abort_if_not(lse) [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] [L737] 0 !stopped VAL [\old(arg)={0:0}, arg={0:0}, pendingIo=1, status=0, stopped=1, stoppingEvent=1, stoppingFlag=1] [L751] 1 stopped = 1 VAL [\old(arg)={0:0}, arg={0:0}, lse=1, pendingIo=1, stopped=1, stoppingEvent=1, stoppingFlag=1] Now there is a data race on ~stopped~0 between C: !stopped [737] and C: stopped = 1 [751] - UnprovableResult [Line: 744]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 756]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 757]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 758]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 759]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 703]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 709]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 712]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 737]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 719]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 720]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 729]: Unable to prove that there are no data races Unable to prove that there are no data races Reason: Not analyzed. - UnprovableResult [Line: 760]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 187 locations, 27 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: 2.7s, OverallIterations: 12, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 327 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 245 mSDsluCounter, 550 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 490 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 831 IncrementalHoareTripleChecker+Invalid, 844 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 60 mSDtfsCounter, 831 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 64 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=431occurred in iteration=10, InterpolantAutomatonStates: 64, 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.6s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 585 ConstructedInterpolants, 0 QuantifiedInterpolants, 869 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 11 InterpolantComputations, 11 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-20 13:39:42,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE